Performance bounds in communication networks with variable-rate links
- 1 October 1995
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGCOMM Computer Communication Review
- Vol. 25 (4) , 126-136
- https://doi.org/10.1145/217391.217422
Abstract
In most network models for quality of service support, the communication links interconnecting the switches and gateways are assumed to have fixed bandwidth and zero error rate. This assumption of steadiness, especially in a heterogeneous internet-working environment, might be invalid owing to subnetwork multiple-access mechanism, link-level flow/error control, and user mobility. Techniques are presented in this paper to characterize and analyze work-conserving communication nodes with varying output rate. In the deterministic approach, the notion of "fluctuation constraint," analogous to the "burstiness constraint" for traffic characterization, is introduced to characterize the node. In the statistical approach, the variable-rate output is modelled as an "exponentially bounded fluctuation" process in a way similar to the "exponentially bounded burstiness" method for traffic modelling. Based on these concepts, deterministic and statistical bounds on queue size and packet delay in isolated variable-rate communication server-nodes are derived, including cases of single-input and multiple-input under first-come-first-serve queueing. Queue size bounds are shown to be useful for buffer requirement and packet loss probability estimation at individual nodes. Our formulations also facilitate the computation of end-to-end performance bounds across a feedforward network of variable-rate server-nodes. Several numerical examples of interest are given in the discussion.Keywords
This publication has 9 references indexed in Scilit:
- Stability, queue length, and delay of deterministic and stochastic queueing networksIEEE Transactions on Automatic Control, 1994
- A generalized processor sharing approach to flow control in integrated services networks: the multiple node caseIEEE/ACM Transactions on Networking, 1994
- Statistical analysis of generalized processor sharing scheduling disciplinePublished by Association for Computing Machinery (ACM) ,1994
- On per-session end-to-end delay distributions and the call admission problem for real-time applications with QOS requirementsPublished by Association for Computing Machinery (ACM) ,1993
- Performance and stability of communication networks via robust exponential boundsIEEE/ACM Transactions on Networking, 1993
- A generalized processor sharing approach to flow control in integrated services networks: the single-node caseIEEE/ACM Transactions on Networking, 1993
- On computing per-session performance bounds in high-speed multi-hop computer networksPublished by Association for Computing Machinery (ACM) ,1992
- A calculus for network delay. II. Network analysisIEEE Transactions on Information Theory, 1991
- A calculus for network delay. I. Network elements in isolationIEEE Transactions on Information Theory, 1991