Abstract
It is important to understand delay bounds of an individual flow in the Internet in order to provide real-time applications such as Voice over IP (VoIP). In this paper, we study the deterministic bounds on edge-to-edge delay of a flow in a Differentiated Service (DiffServ) network domain with FIFO aggregation and class-based Guaranteed-Rate (GR) scheduler which provides guaranteed performance with rate reservation for a traffic class. We derive edge-to-edge delay bounds of a flow as a function of service rate allocated for a traffic class and leaky-bucket parameters adopted for flows at the network ingress, and information about joining and leaving flows. The resulting bounds are less than previously derived delay bounds, especially in the case where the burstiness of aggregated traffic is high and the edge-to-edge path is long.
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
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Blake, S., et al.: An Archiecture for Differentiated Services, IETF RFC 2475 (1998)
Fu, H., Knightly, E.W.: Aggregation and Scalable QoS: A Performance Study. In: Wolf, L., Hutchinson, D.A., Steinmetz, R. (eds.) IWQoS 2001. LNCS, vol. 2092, pp. 307–324. Springer, Heidelberg (2001)
Charny, A., Le Boudec, J.-Y.: Delay bounds in an Network with Aggregate Scheduling. In: Crowcroft, J., Roberts, J., Smirnov, M.I. (eds.) QofIS 2000. LNCS, vol. 1922, pp. 1–13. Springer, Heidelberg (2000)
Jiang, Y.: Delay bounds for a network of guaranteed rate servers with FIFO aggregation. Computer Networks 40(6), 684–684 (2002)
Duan, Z., Zhang, Z.L., Hou, Y.T.: Fundamental Trade-offs in Aggregate Packet Scheduling. In: ICNP 2001 (2001)
Chlamtac, I., et al.: A deterministic approach to the end-to-end analysis of packet flows in connection oriented networks. IEEE/ACM Trans. on Networking, 422–431 (1998)
Le Boudec, J.-Y., Hebuterne, G.: Comment on a deterministic approach to the end-to-end analysis of packet flows in connection oriented network. IEEE/ACM Trans. on Networking, 121–124 (February 2000)
Le Boudec, J.-Y., Thiran, P. (eds.): Network Calculus:A Theory of Deterministic Queuing Systems for the Internet, January 2002. Springer, Heidelberg (2002)
Stiliadis, D., Varma, A.: Latency-Rate Servers: A General Model for Analysis of Traffic Scheduling Algorithms. IEEE/ACM Trans. on Networking 6(5), 611–624 (1998)
Cruz, R.L.: A Calclus for Network Delay, Part I: Network Elements in Isolation. IEEE Trans. Information Theory 37(1), 114–131
Cruz, R.L.: A Calclus for Network Delay, Part II: Network Analysis. IEEE Trans. Information Theory 37(1), 132–141
Guerin, R., Pla, V.: Aggregation of conformance in Differentiated Service network: A case study. ACM CCR 31(1), 21–32 (2001)
Jiang, Y., Yao, Q.: Impact of FIFO Aggregation on Delay Performance of a Differentiated Services Network. In: ICOIN 2003 (February 2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kim, G., Kim, C. (2004). Deterministic Edge-to-Edge Delay Bounds for a Flow in a DiffServ Network Domain. In: Kahng, HK., Goto, S. (eds) Information Networking. Networking Technologies for Broadband and Mobile Networks. ICOIN 2004. Lecture Notes in Computer Science, vol 3090. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25978-7_38
Download citation
DOI: https://doi.org/10.1007/978-3-540-25978-7_38
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23034-2
Online ISBN: 978-3-540-25978-7
eBook Packages: Springer Book Archive