Journal ArticleDOI
Delay bounds for a network of guaranteed rate servers with FIFO aggregation
TLDR
It is shown that while for a specific network configuration, the derived delay bound is not restricted by the utilization level on the GR, it is so for a general network configuration.About:
This article is published in Computer Networks.The article was published on 2002-12-20. It has received 72 citations till now. The article focuses on the topics: Network delay & Fair-share scheduling.read more
Citations
More filters
Book
Network Calculus: A Theory of Deterministic Queuing Systems for the Internet
TL;DR: The application of Network Calculus to the Internet and basic Min-plus and Max-plus Calculus and Optimal Multimedia Smoothing and Adaptive and Packet Scale Rate Guarantees are studied.
Book
Stochastic Network Calculus
Yuming Jiang,Yong Liu +1 more
TL;DR: In this paper, the authors present a comprehensive treatment for the state-of-the-art in stochastic service-guarantee analysis research and provide basic introductory material on the subject, as well as discusses the most recent research in the area.
Journal ArticleDOI
Survey of deterministic and stochastic service curve models in the network calculus
TL;DR: In this paper, the authors survey the state-of-the-art of the deterministic and the recent probabilistic network calculus and discuss the use of service curves, its use in the network calculus, and the relation to systems theory under the min-plus algebra.
Deterministic and stochastic service curve models in the network calculus
TL;DR: The state-of-the-art of the deterministic and the recent probabilistic network calculus is surveyed and stochastic service curve models allow utilizing the statistical multiplexing gain in a network calculus framework that features end-to-end network analysis by convolution of service curves.
Proceedings ArticleDOI
Delay Bounds under Arbitrary Multiplexing: When Network Calculus Leaves You in the Lurch...
TL;DR: This paper addresses the problem of bounding the delay of individual traffic flows in feed-forward networks under arbitrary multiplexing and finds that direct application of network calculus results in loose bounds even in seemingly simple scenarios.
References
More filters
An Architecture for Differentiated Service
TL;DR: An architecture for implementing scalable service differentiation in the Internet achieves scalability by aggregating traffic classification state which is conveyed by means of IP-layer packet marking using the DS field [DSFIELD].
Journal ArticleDOI
A generalized processor sharing approach to flow control in integrated services networks: the multiple node case
Abhay Parekh,Robert G. Gallager +1 more
TL;DR: Worst-case bounds on delay and backlog are derived for leaky bucket constrained sessions in arbitrary topology networks of generalized processor sharing (GPS) servers and the effectiveness of PGPS in guaranteeing worst-case session delay is demonstrated under certain assignments.
Journal ArticleDOI
A calculus for network delay. I. Network elements in isolation
TL;DR: A calculus is developed for obtaining bounds on delay and buffering requirements in a communication network operating in a packet switched mode under a fixed routing strategy, and burstiness constraints satisfied by the traffic that exits the element are derived.
Book
Network Calculus: A Theory of Deterministic Queuing Systems for the Internet
TL;DR: The application of Network Calculus to the Internet and basic Min-plus and Max-plus Calculus and Optimal Multimedia Smoothing and Adaptive and Packet Scale Rate Guarantees are studied.
Proceedings ArticleDOI
A self-clocked fair queueing scheme for broadband applications
TL;DR: The author proves that the scheme possesses the desired fairness property and is nearly optimal, in the sense that the maximum permissible disparity among the normalized services offered to the backlogged sessions is never more than two times the corresponding figure in any packet-based queueing system.