Abstract
The rapid growth of the Internet, along with the availability of powerful computers and high-speed networks as low-cost commodity components, is changing the way people do computing and manage information. These new technologies have enabled the utilization of a wide variety of geographically distributed computational resources, including computers, storage systems, data sources, and special devices, as a unified resource. This new paradigm is popularly termed “grid” computing. The federation of highly distributed heterogeneous resources to deliver high-performance computational services is a key feature of grid computing. Computer networks form the basis for resource sharing across geographically distributed sites and many grid applications require the underlying networks guarantee certain levels of delay performance.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Boudec JL, Thiran P (2001) Network calculus: a theory of deterministic queuing systems for the Internet. Springer.
Chuang ST, Goel A, McKeown N, Prabhakar B (1999) Matching output queuing with a combined input/output-queued switch. J. IEEE Select. Areas Commun. 17: 1030-1038.
Chuang ST, Iyer S, McKeown N (2003) Practical algorithms for performance guarantees in buffered crossbar switches. Technical Report of Stanford University.
Duan Q, Li X, Zhang L (2003) Network calculus-based delay analysis for QoS provision in buffered crossbar switches. J. Interconnection Networks 4: 131-146.
Fizek FH, Reisslein M (2001) MPEG-4 and H.263 video traces for network performance evaluation. IEEE Network Magazine 15: 40-54.
Mekkittiul A, McKeown N (1998) A practical scheduling algorithm to achieve 100\% throughput in input-queued switches. In: Proc. IEEE INFOCOM'98, San Francisco, pp 792-799.
Parekh AK, Gallager RG (1993) A generalized processor sharing approach to flow control in integrated services networks: the single-node case. IEEE/ACM Trans. Networking 1: 344-357.
Stiliadis D, Varma A (1998) Latency-rate servers: a general model for analysis of traffic scheduling algorithms. IEEE/ACM Trans. Networking 6: 611-624.
Turner J, Yamanaka N (1998) Architectural choices in large scale ATM switches. IEICE Transactions E81-B: 120-137.
Yoshigoe K, Christensen KJ (2003) An evolution to crossbar switches with virtual output queuing and buffered cross points. IEEE Network Magazine, 17: 48-56.
Zhang H (1995) Service disciplines for guaranteed performance service in packet-switching networks. Proceedings of the IEEE 82: 1374-1398.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Duan, Q. (2009). Delay Characteristics of Packet Switched Networks. In: Chan, Y., Talburt, J., Talley, T. (eds) Data Engineering. International Series in Operations Research & Management Science, vol 132. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-0176-7_10
Download citation
DOI: https://doi.org/10.1007/978-1-4419-0176-7_10
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-0175-0
Online ISBN: 978-1-4419-0176-7
eBook Packages: Computer ScienceComputer Science (R0)