Abstract
We investigate the effect of flow aggregation on the end-to-end delay in large scale networks. We show that networks with Differentiated services (DiffServ) architectures, where packets are treated according to the class they belong, can guarantee the end-to-end delay for packets of the highest priority class, which are queued and scheduled with a strict priority, but without preemption. We then analyze the network with arbitrary flow aggregation and deaggregation, and again derive an upper bound on the end-to-end delay. Throughout the paper we use Latency-Rate (\({\mathcal{LR}}\)) server model, and prove that FIFO, Strict Priority, and other rate-guaranteeing servers with aggregated flows are all \({\mathcal{LR}}\) servers to individual flows in certain conditions. We show that the delay bound of a flow that experiences aggregation and deaggregation, including the flows in DiffServ, depends on, among others, the burst sizes of the other flows within the aggregated flow and the number of the aggregations and the deaggregations.
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.
References
Braden, R., Clark, D., Shenker, S.: Integrated Services in the Internet Architecture: an Overview, IETF Request for Comments, RFC-1633 (1994)
White, P.P.: RSVP and Integrated services in the Internet: A tutorial. IEEE Commun. Mag. 35, 100–106 (1997)
Blake, S., Black, D., Carlson, M., Davies, E., Wang, Z., Weiss, W.: An architecture for Differentiated Services. IETF RFC-2475 (1998)
Shreedhar, M., Varghese, G.: Efficient fair queueing using deficit round-robin. IEEE/ACM Trans. Networking 4(3), 375–385 (1996)
Golestani, S.: A Self-clocked Fair Queueing Scheme for Broadband Applications. In: IEEE INFOCOM 1994 (1994)
Stiliadis, D., Varma, A.: Latency-Rate servers: A general model for analysis of traffic scheduling algorithms. IEEE/ACM Trans. Networking 6(5) (October 1998)
Stiliadis, D.: Traffic Scheduling in Packet-Switched Networks: Analysis, Design and Implementation, Ph.D. Dissertation, U.C. Santa Cruz (June 1996)
Cobb, J.A.: Preserving quality of service guarantees in spite of flow aggregation. IEEE/ACM Transactions on Networking 10(1), 43–53 (2002)
Goyal, P., Lam, S.S., Vin, H.M.: Determining end-to-end delay bounds in heterogeneous networks. In: Proc. Workshop on Network and Operating Systems upport for Digital Audio and Video (NOSSDAV 1995), pp. 287–298 (April 1995)
Sun, W., Shin, K.G.: End-to-End Delay Bounds for Traffic Aggregates Under Guaranteed-Rate Scheduling Algorithms. IEEE/ACM Transactions on Networking 13(5) (October 2005)
Residential Ethernet Study Group website, http://www.ieee802.org/3/re_study/index.html
Feng, F., Garner, G.M.: Meeting Residential Ethernet Requirements: A Simulation Study, IEEE 802.3 Residential Ethernet Study Group (September 2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Joung, J., Choe, BS., Jeong, H., Ryu, H. (2006). Effect of Flow Aggregation on the Maximum End-to-End Delay. In: Gerndt, M., Kranzlmüller, D. (eds) High Performance Computing and Communications. HPCC 2006. Lecture Notes in Computer Science, vol 4208. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11847366_44
Download citation
DOI: https://doi.org/10.1007/11847366_44
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-39368-9
Online ISBN: 978-3-540-39372-6
eBook Packages: Computer ScienceComputer Science (R0)