Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Alireza Shekaramiz

dblp:166/1683 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2016
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1 · 1 first-authorSoftware engineering, systems software and programming languages · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Network performance modeling · 50% Transport protocols and congestion control · 50%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Performance modeling and evaluation · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Transport protocols and congestion control
flow control
0.212016
Network Calculus Analysis of a Feedback System with Random Service · SIGMETRICS 2016
Network performance modeling
network calculus
0.212016
Network Calculus Analysis of a Feedback System with Random Service · SIGMETRICS 2016
Network performance modeling › network calculus
stochastic network calculus
0.212016
Network Calculus Analysis of a Feedback System with Random Service · SIGMETRICS 2016
Transport protocols and congestion control › flow control
window flow control
0.212016
Network Calculus Analysis of a Feedback System with Random Service · SIGMETRICS 2016
Performance modeling and evaluation
queueing models
0.112016
Network Calculus Analysis of a Feedback System with Random Service · SIGMETRICS 2016

Methods — techniques the papers use, named apart from their topics

stochastic network calculus · 0.5statistical bounds · 0.5
YearPublicationVenuePosition
2016 Network Calculus Analysis of a Feedback System with Random Service
abstract
Feedback mechanisms are integral components of network protocols and traffic control algorithms. Their performance evaluation is hard due to intricate time correlations introduced by feedback. Network calculus has been successfully applied for the analysis of feedback mechanisms in deterministic systems. However, an extension to random systems has remained an open problem for more than a decade. We present a stochastic network calculus analysis of a random system with feedback, specifically, a window flow control system with random service and fixed feedback delay. We quantify the service impediment due to the feedback mechanism by deriving statistical lower bounds on the available service, and obtain complementary upper bounds. We also discover special cases where an exact description of the service is feasible.
Alireza Shekaramiz, Jörg Liebeherr, Almut Burchard
SIGMETRICS1