In previous decades, the Internet has moved from a limited low bandwidth network to a sophisticated infrastructure supporting many new applications such as video conferencing and Internet telephony. These applications have diverse QoS requirements. Support of QoS in such a packet-switched network requires a broad range of functions, such as priority mechanisms, scheduling disciplines, traffic shaping schemes, QoS signaling, and routing algorithms. One of the most important parameters in QoS is the delay of packets. The absolute guarantee model and the proportional service model are two methods to guarantee the delay. In the absolute guarantee model, a fixed maximum service delay for each class needs to be enforced. In the proportional service model, a fixed ratio between the delays seen by the different service classes can be enforced. To reach the delay constraints, routers allocate the rates of classes by scheduling algorithms.
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
Demers A, Keshav S, Shenker S (1990) Analysis and simulation of a fair queuing algorithm Journal of Internetworking Research and Experience, pp 3–26, October
Parekh A, Gallager R (1992) A generalized processor sharing approach to flow control—the single node case. In: Proceedings of the INFOCOM’92
Bennett JCR, Zhang H (1996) WF2Q: Worst-case fair weighted fair queuing. In: Proceedings of IEEE INFOCOM’96, pp 120–128, March
Golestani S (1994) A self-clocked fair queuing scheme for broadband applications. In: Proceedings of IEEE INFOCOM’94, Toronto, CA, pp 636–646, June
Shreedhar M, Varghese G (1995) Efficient fair queuing using deficit round robin. In: Proceedings of SIGCOMM’95, Boston, MA, pp 231–243, September
Anderson TE, Owicki SS, Saxe JB, Thacker CP (1993) High speed switch scheduling for local area networks. ACM, Transactions on Computer Systems, pp 319–352, November
Goudreau MW, Kolliopoulos SG, Rao SB (2000) Scheduling algorithms for input-queued switches: randomized techniques and experimental evaluation. In: Proceedings of IEEE INFOCOM’00, Tel Aviv, Israel, pp 1634–1643, March
McKeown N, Anantharam V, Walrand J (1996) Achieving 100% throughput in an input-queued switch. In: Proceedings of IEEE INFOCOM’96, San Francisco, CA, pp 296–302, March
McKeown N, Izzard M, Mekkittikul A, Ellersick W, Horowitz M (1997) Tiny tera: a packet switch core. IEEE Micro, pp 26–33, January/February
Blake S, Black D, Carlson M, Davies E, Wang Z, Weiss W (1998) An Architecture for differentiated service. IETF RFC2475, December
Li T, Rekhter Y (1998) A Provider architecture for differentiated services and traffic engineering. IETF RFC2430, October
Christian N, Liebehrr J, Abdelzaher TF (2001) A Quantitative assured forwarding service. Technical Report, University of Virginia
Dovrolis C, Stiliadis D, Ramanathan D (1999) Proportional differentiated services: delay differentiation and packet scheduling. In: Proceedings of ACM SIGCOMM’99, pp 109–120, Boston, MA, August
Parekh AK, Gallagher RG (1993) A generalized processor sharing approach to flow control in integrated services networks: the single-node case. IEEE/ACM Transactions on Networking 1(3):344–357, June
Athuralia S, Li VH, Low SH, Yin Q (2001) REM: active queue management. IEEE Network, May-June
Matta I, Guo L (2000) Differentiated predictive fair service for TCP flows. Technical Report, Computer Science Department, Boston University, May
Bodin U, Jonsson A, Schelen O (2001) On creating proportional loss differentiation: predictability and performance. In: Proceedings of IWQoS, Karlsruhe, Germany, pp 372–386
Dovrolis C, Ramanathan P (2000) Proportional differentiated services, part II: loss rate differentiation and packet dropping. In: Proceedings of IWQoS, Pittsburgh, pp 52–61
Liebeherr J, Christin N (2001) JoBS: Joint buffer management and scheduling for differentiated services. In: Proceedings of IWQoS 2001, Karlsruhe, Germany, pp 404–418, June
Firoiu V, Boudec JL, Towsley D, Zhang Z (2001) Advances in internet quality of service. Technical Report
Mirjalily G, Saadat R, Ahmadian M (2007) Improving JoBS algorithm using PID and fuzzy PID controllers. In: Proceedings of IMECS’07, Hong Kong, pp 1405–1409
Astrom KJ, Hagglund H (1995) PID controllers: theory, design, and tuning, 2nd ed, Instrument Society of America
Astrom KJ, Hagglund T, Hang CC, Ho WK (n.d.) Automatic tuning and adaptation for PID controllers: a survey. IFAC J Control Eng Practice 1(4)
Zhao ZY, Tomizuka M, Isaka S (1993) Fuzzy gain scheduling of our PID controllers. IEEE Trans On Systems, Man, and Cyber 23(5):1392–1398
Wang L-X (1996) A Course in fuzzy systems and control. Prentice-Hall
NS-2 network simulator available at http://www.isi.edu/nsnam/ns
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Mirjalily, G., Ahmadian, M. (2008). A New Approach in Scheduling for Differentiated Services Networks. In: Huang, X., Chen, YS., Ao, SI. (eds) Advances in Communication Systems and Electrical Engineering. Lecture Notes in Electrical Engineering, vol 4. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74938-9_8
Download citation
DOI: https://doi.org/10.1007/978-0-387-74938-9_8
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-74937-2
Online ISBN: 978-0-387-74938-9
eBook Packages: EngineeringEngineering (R0)