Abstract
Recent Internet traffic measurements show that 60% of the total packets are short packets, which include TCP acknowledgment and control segments. These short packets make a great impact on the performance of TCP. Unfortunately, short packets suffer from large delay due to serving long data packets in switches running in the packet mode, i.e. a packet is switched in its entirety. To optimize TCP performance, we apply a cross-layer approach to the design of switching architectures and scheduling algorithms. Specifically, we propose a preemptive packet-mode scheduling architecture and an algorithm called preemptive short packets first (P-SPF). Analysis and simulation results demonstrate that compared to existing packet-mode schedulers, P-SPF significantly reduces the waiting time for short packets while achieving a high overall throughput when the traffic load is heavy. Moreover, with a relatively low speedup, P-SPF performs better than existing packet-mode schedulers under any traffic load.
This work was supported by NSFC (No. 60173009 and No. 60373007), China 863 High-tech Plan (No. 2002AA103011-1 and No. 2003AA115110), China/Ireland Science and Technology Collaboration Research Fund (CI-2003-02) and the Specialized Research Fund for the Doctoral Program of Higher Education of China (No. 20040003048).
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
McKeown, N.: Fast Switched Backplane for a Gigabit Switched Router. Business Commun. Review 27(12), 1–30 (1997)
McKeown, N., Izzard, M., Mekkittikul, A., Ellersick, W., Horowitz, M.: Tiny Tera: a Packet Switch Core. IEEE Micro 17(1), 26–33 (1997)
Partridge, C., et al.: A 50-Gb/s IP Router. IEEE/ACM Trans. Networking 6(3), 237–248 (1998)
McKeown, N.: The iSLIP Scheduling Algorithm for Input-Queued Switches. IEEE/ACM Trans. Networking 7(2), 188–201 (1999)
Mekkittikul, A., McKeown, N.: A Practical Scheduling Algorithm to Achieve 100% Throughput in Input-Queued Switches. IEEE INFOCOM 1998, 792–799 (1998)
Chao, H.J.: Saturn: a Terabit Packet Switch Using Dual Round-Robin. IEEE Commun. Magazine 38(12), 78–84 (2000)
Marsan, M.A., Bianco, A., Giaccone, P., Leonardi, E., Neri, F.: Packet-Mode Scheduling in Input-Queued Cell-Based Switches. IEEE/ACM Trans. Networking 10(5), 666–678 (2002)
Ganjali, Y., Keshavarzian, A., Shah, D.: Input Queued Switches: Cell Switching vs. Packet Switching. IEEE INFOCOM 2003, 1651–1658 (2003)
The Auckland-II trace, National Laboratory for Applied Network Research (NLANR), http://pma.nlanr.net/Special/
Thompson, K., Miller, G.J., Wilder, R.: Wide-Area Internet Traffic Patterns and Characteristics. IEEE Network 11(6), 10–23 (1997)
Fraleigh, C., et al.: Packet-level Traffic Measurements from the Sprint IP Backbone. IEEE Network 17(6), 6–16 (2003)
Aikat, J., Kaur, J., Smith, F.D., Jeffay, K.: Variability in TCP Round-trip Times. In: ACM SIGCOMM Conference on Internet Measurement Workshop 2003, pp. 279–284 (2003)
Blake, S., Black, D., Carlson, M., Davies, E., Wang, Z., Weiss, W.: An Architecture for Differentiated Services. IETF RFC 2475 (1998)
Papagiannaki, K., Thiran, P., Crowcroft, J., Diot, C.: Preferential Treatment of Acknowledgment Packets in a Differentiated Services Network. In: Wolf, L., Hutchinson, D.A., Steinmetz, R. (eds.) IWQoS 2001. LNCS, vol. 2092, pp. 187–201. Springer, Heidelberg (2001)
Wang, H.N., Shin, K.G.: Transport-aware IP Routers: a Built-in Protection Mechanism to Counter DDoS Attacks. IEEE Trans. Parallel and Distributed Systems 14(9), 873–884 (2003)
Rai, I.A., Biersack, E.W., Urvoy-Keller, G.: Size-Based Scheduling to Improve the Performance of Short TCP Flows. IEEE Network 19(1), 12–17 (2005)
Li, W.J., Liu, B.: SPF: to Improve the Performance of Packet-Mode Scheduling. In: Elsevier Computer Commun. (2005) (in press)
Baker, F.: Requirements for IP Version 4 Routers. IETF RFC 1812 (1995)
Bennett, J.C.R., Partridge, C., Shectman, N.: Packet Reordering is not Pathological Network Behavior. IEEE/ACM Trans. Networking 7(6), 789–798 (1999)
Karol, M., Hluchyj, M., Morgan, S.: Input Versus Output Queueing on a Space-Division Packet Switch. IEEE Trans. Commun. 35(12), 1347–1356 (1987)
Allen, A.O.: Probability, Statistics, and Queueing Theory with Computer Science Applications. New York Academic Press, New York (1978)
Wolff, R.W.: Stochastic Modeling and the Theory of Queues. Prentice-Hall Inc., Englewood Cliffs (1989)
Mckeown, N., Mekkittikul, A., Anantharam, V., Walrand, J.: Achieving 100% Throughput in an Input-Queued Switch. IEEE Trans. Commun. 47(8), 1260–1267 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, W., Liu, B., Shi, L., Xu, Y., Wu, D. (2005). Preemptive Packet-Mode Scheduling to Improve TCP Performance. In: de Meer, H., Bhatti, N. (eds) Quality of Service – IWQoS 2005. IWQoS 2005. Lecture Notes in Computer Science, vol 3552. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11499169_20
Download citation
DOI: https://doi.org/10.1007/11499169_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26294-7
Online ISBN: 978-3-540-31659-6
eBook Packages: Computer ScienceComputer Science (R0)