On CBR service

Authors:
M. Grossglauser;S. Keshav
Affiliations:
AT&T Bell Labs, Murray Hill, NJ;AT&T Bell Labs, Murray Hill, NJ
Venue:
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Year:
1996

Citing 3
Cited 8

Generating burstiness in networks: a simulation study of correlation effects in networks of queues

ACM SIGCOMM Computer Communication Review
RCBR: a simple and efficient service for multiple time-scale traffic

SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Guaranteed Performance Communication in High Speed Networks

Guaranteed Performance Communication in High Speed Networks

Supporting stored video: reducing rate variability and end-to-end resource requirements through optimal smoothing

Proceedings of the 1996 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
RCBR: a simple and efficient service for multiple time-scale traffic

IEEE/ACM Transactions on Networking (TON)
Connection admission control for constant bit rate traffic at a multi-buffer multiplexer using the oldest-cell-first discipline

Queueing Systems: Theory and Applications
Minimizing end-to-end delay in high-speed networks with a simple coordinated schedule

Journal of Algorithms
Conformance analysis in networks with service level agreements

Computer Networks and ISDN Systems
An optimal cache algorithm for streaming VBR video over a heterogeneous network

Computer Communications
Conformance analysis in networks with service level agreements

Computer Networks: The International Journal of Computer and Telecommunications Networking
Energy consumption and message delay analysis of QoS enhanced base station controlled dynamic clustering protocol for wireless sensor networks

IEEE Transactions on Wireless Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the performance of CBR traffic in the context of large-scale networks, where many connections and switches coexist and interact. We develop a framework for simulating such networks, decoupling the influence of breadth and depth. Our results are briefly as follows: we found that a Poisson stream is a good approximation to a superposition of many CBR streams with differing phases and bandwidths. Delays incurred by a reference stream with cross traffic composed of many CBR streams with different bandwidths and phases do not exceed a few cell times even under heavy load, which means that buildout buffers of 10 to 20 cells seem to be sufficient after travelrsing 20 switches. CBR trafFic can be efficiently served by the First Come First Served (FCFS) scheduling discipline, which has the least implementation cost. Surprisingly, the Round Robin (RR) and Weighted Round Robin (WRR) disciplines perform worse than FCFS, despite their greater implementation complexity. We also compare an analytical approximation method, based on the Multiclass Parametric Decomposition Method, with the simulation results and found it to be suitable to estimate end-to-end delays for the FCFS discipline.