Abstract
We consider networks with aggregated links, that is networks in which physical link segments between two interconnected devices are grouped into a single logical link. Network devices supporting such aggregated links must implement a distribution algorithm responsible for choosing the transmission link for any given packet. Traditionally, in order to maintain packet ordering within conversations, all distribution algorithms transmitted packets from a given conversation on a single link. This approach is attractive for its simplicity, but in some conditions it tends to under-utilize the capacity of the link. On the other hand, due to variations in packet lengths, sending packets from the same conversation simultaneously along different physical links requires careful scheduling to ensure that the packets arrive in the correct order.
Recently, Jawor et al. [6] formulated this packet scheduling problem as an online optimization problem and proposed an algorithm called Block. The focus of the work in [6] was purely theoretical – to achieve an optimal competitive ratio. In this paper we study this problem in an experimental setting. To this end, we develop a refined version of Algorithm Block, and we show, through experimental analysis, that it indeed significantly reduces the maximum amount of time packets spent in buffers before transmission, compared to the standard methods based on hashing.
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
MAWI Working Group Traffic Archive, http://tracer.csl.sony.co.jp/mawi/
Bennett, J.C.R., Partridge, C., Shectman, N.: Packet reordering is not pathological network behavior. IEEE/ACM Transactions on networking 7(6), 789–798 (1999)
Gareiss, R.: Is the internet in trouble? Data Communications Magazine (September 1997)
Gharai, L., Perkins, C., Lehman, T.: Packet reordering, high speed networks and transport protocol performance. In: Proceedings of the International Conference On Computer Communications and Networks, pp. 73–78 (2004)
C.S.: IEEE. Part 3: Carrier sense multiple access with collision detection (CSMA/CD) access method and physical layer specifications. In: IEEE Std 802.3. Standard for Information technology. Telecommunications and information exchange between systems. Local and metropolitan area networks. Specific requirements. The IEEE, Inc. (2002)
Jawor, W., Chrobak, M., Dürr, C.: Competitive analysis of scheduling algorithms for aggregated links. Algorithmica 51, 367–386 (2008)
Sleator, D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Commun. ACM 28, 202–208 (1985)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jawor, W., Chrobak, M., Molle, M. (2009). Experimental Analysis of Scheduling Algorithms for Aggregated Links. In: Bampis, E., Skutella, M. (eds) Approximation and Online Algorithms. WAOA 2008. Lecture Notes in Computer Science, vol 5426. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-93980-1_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-93980-1_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-93979-5
Online ISBN: 978-3-540-93980-1
eBook Packages: Computer ScienceComputer Science (R0)