Abstract
To achieve Quality of Service (QoS) in Next Generation Networks (NGNs), the Differentiated Services architecture implements appropriate Per Hop Behavior (PHB) for service differentiation. Common recommendations to enforce appropriate PHB include Weighted Round Robin (WRR), Deficit Round-Robin (DRR) and similar algorithms. They assign a fixed bandwidth share to Transport Service Classes (TSCs) of different priority. This is a viable approach if the ratio of high priority traffic TSC high over low priority traffic TSC low is known in advance. If TSC high holds more and TSC low less users than expected, the QoS for TSC high can be worse than for TSC low . As shown in preceding work, the Modified Earliest Deadline First (MEDF) algorithm heals this problem on the packet level. Therefore, we investigate its impact in congested TCP/IP networks by simulations and show its attractiveness as a powerful service differentiation mechanism.
Chapter PDF
References
Blake, S., Black, D.L., Carlson, M.A., Davies, E., Wang, Z., Weiss, W.: RFC2475: An Architecture for Differentiated Services (1998), ftp://ftp.rfc-editor.org/in-notes/rfc2475.txt
Grossman, D.: RFC3260: New Terminology and Clarifications for Diffser (2002), ftp://ftp.rfc-editor.org/in-notes/rfc3260.txt
Davie, B., et al.: An Expedited Forwarding PHB, Per-Hop Behavior (2002), ftp://ftp.rfc-editor.org/in-notes/rfc3246.txt
Charny, A., et al.: Supplemental Information for the NewDefinition of the EF PHB (Expedited Forwarding Per-Hop Behavior) (2002), ftp://ftp.rfc-editor.org/in-notes/rfc3247.txt
Floyd, S., Jacobson, V.: Link-sharing and Resource Management Models for Packet Networks. IEEE/ACM Transactions on Networking 3 (1995)
Shreedhar, M., Varghese, G.: Efficient Fair Queueing Using Deficit Round-Robin. IEEE/ACM Transactions on Networking 4 (1996)
Menth, M., Schmid, M., Heiß, H., Reim, T.: MEDF - A Simple Scheduling Algorithm for Two Real-Time Transport Service Classes with Application in the UTRAN. In: IEEE INFOCOM 2003 (2003)
Ramabhadran, S., Pasquale, J.: Stratified round Robin: a lowcomplexity packet scheduler with bandwidth fairness and bounded delay. In: Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications Karlsruhe, Germany, pp. 239–250 (2003)
Stiliadis, D., Varma, A.: Efficient fair queueing algorithms for packet-switched networks. IEEE/ACM Transactions on Networking (TON) 6, 175–185 (1998)
Martin, R., Menth, M.: Performance of TCP/IP with MEDF Scheduling. Technical Report 323, University of Würzburg (2004)
Floyd, S., Jacobson, V.: Random Early Detection Gateways for Congestion Avoidance. IEEE/ACM Transactions on Networking 1, 397–413 (1993)
Anjum, F., Tassiulas, L.: Balanced-RED: An Algorithm to Achieve Fairness in the Internet. In: IEEE INFOCOM 1999 (1999)
Bodin, U., Schelén, O., Pink, S.: Load-tolerant Differentiation with Active Queue Management. SIGCOMM Computer Communication Review (2000)
Le Faucheur, F.: Russian Dolls Bandwidth Constraints Model for Diff-Serv-aware MPLS Traffic Engineering. Internet Draft TEWG (2003)
Fall, K., Varadhan, K.: The ns Manual (2003), http://www.isi.edu/nsnam/ns/doc/nsdoc.pdf
Stevens, W.R.: TCP/IP Illustrated, vol. 1. Addison-Wesley Longman, Amsterdam (1994)
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
Martin, R., Menth, M., Vu, PG. (2004). Performance of TCP/IP with MEDF Scheduling. In: Solé-Pareta, J., et al. Quality of Service in the Emerging Networking Panorama. WQoSR QofIS ICQT 2004 2004 2004. Lecture Notes in Computer Science, vol 3266. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30193-6_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-30193-6_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23238-4
Online ISBN: 978-3-540-30193-6
eBook Packages: Springer Book Archive