Survey of deterministic and stochastic service curve models in the network calculus
M Fidler - IEEE Communications surveys & tutorials, 2010 - ieeexplore.ieee.org
In recent years service curves have proven a powerful and versatile model for performance
analysis of network elements, such as schedulers, links, and traffic shapers, up to entire …
analysis of network elements, such as schedulers, links, and traffic shapers, up to entire …
[图书][B] Performance guarantees in communication networks
CS Chang - 2012 - books.google.com
Providing performance guarantees is one of the most important issues for future
telecommunication networks. This book describes theoretical developments in performance …
telecommunication networks. This book describes theoretical developments in performance …
Matching output queueing with a combined input/output-queued switch
The Internet is facing two problems simultaneously: there is a need for a faster
switching/routing infrastructure and a need to introduce guaranteed qualities-of-service …
switching/routing infrastructure and a need to introduce guaranteed qualities-of-service …
Topology control and routing in ad hoc networks: A survey
R Rajaraman - ACM SIGACT News, 2002 - dl.acm.org
An ad hoc wireless network, or simply an ad hoc network, consists of a collection of
geographically distributed nodes that communicate with one other over a wireless medium …
geographically distributed nodes that communicate with one other over a wireless medium …
[图书][B] Stability of queueing networks
M Bramson - 2008 - Springer
The approach we employ in this chapter to study the stability of queueing networks employs
fluid limits and fluid models. Fluid models were discussed briefly in Section 1.3; we will …
fluid limits and fluid models. Fluid models were discussed briefly in Section 1.3; we will …
[HTML][HTML] Computing robust basestock levels
D Bienstock, N Özbay - Discrete Optimization, 2008 - Elsevier
This paper considers how to optimally set the basestock level for a single buffer when
demand is uncertain, in a robust framework. We present a family of algorithms based on …
demand is uncertain, in a robust framework. We present a family of algorithms based on …
Delay bounds in a network with aggregate scheduling
A Charny, JYL Boudec - Quality of Future Internet Services: First COST …, 2000 - Springer
A large number of products implementing aggregate buffering and scheduling mechanisms
have been developed and deployed, and still more are under development. With the rapid …
have been developed and deployed, and still more are under development. With the rapid …
Universal-stability results and performance bounds for greedy contention-resolution protocols
M Andrews, B Awerbuch, A Fernández… - Journal of the ACM …, 2001 - dl.acm.org
In this paper, we analyze the behavior of packet-switched communication networks in which
packets arrive dynamically at the nodes and are routed in discrete time steps across the …
packets arrive dynamically at the nodes and are routed in discrete time steps across the …
Protocols and impossibility results for gossip-based communication mechanisms
D Kempe, J Kleinberg - The 43rd Annual IEEE Symposium on …, 2002 - ieeexplore.ieee.org
In recent years, gossip-based algorithms have gained prominence as a methodology for
designing robust and scalable communication schemes in large distributed systems. The …
designing robust and scalable communication schemes in large distributed systems. The …
[图书][B] Universal routing strategies for interconnection networks
C Scheideler - 2006 - books.google.com
This book presents the history and state of the art of universal routing strategies, which can
be applied to networks independently of their respective topologies. It opens with a self …
be applied to networks independently of their respective topologies. It opens with a self …