Abstract
The amount of traffic carried over the Internet has dynamically increase with the tremendous popularity of World Wide Web because of that it is mandatory to have a router or high speed switch that can deals with the network traffic in an efficient way. This one is also applicable for a computer system of multiprogramming environment where multiple process are required to have the support of CPU to perform the required operations but the CPU will handle then in a proper manner by using an efficient CPU scheduling algorithm. Here in this paper we have introduced an enhanced cost effective model of Round Robin Technique which is applied on a real time traffic based on policy based routing. Apart from this we have also analysis the enhanced model of Round Robin with some valuable case studies.
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
Chaskar, H.M., Madhow, U.: Fair Scheduling with tunable latency:a round robin approach. IEEE/ACM Trans. Netw. A247, 529–551 (1955)
Katevenis, M., Sidoropojlos, S., Courcoubetis, C.: Weighted round robin cell multiplexing in a general-purpose ATM switch chip. IEEE J. Sel. Areas Commun. (1991)
Shreedhar, M., Varghese, G.: Efficent fair queueing using deficit Round Robin Technique. IEEE/ACM Trans. Netw. (1996)
Saha, D., Mukherjee, S., Tripathi, S.K.: Carry-over round robin: a simple cell scheduling mechanism for ATM networks. IEEE/ACM Trans. Netw. (1998)
Saha, D., Mukherjee, S., Tripathi, S.K.: Carry-over round robin: a simple cell scheduling mechanism for ATM networks. IEEE/ACM Trans. Netw. (1998)
Zhang, L.: Virtual Clock: a new traffic control algoritm for packet switching networks. ACM SIGCOMM Comput. Commun. Rev. (1990)
Garg, R., Chen, X.: RRR: recurcive round robin scheduler. Int. J. Comput. Telecommun. (1999)
Bae, J.J., Suda, T., Simha, R.: Analysis of a finite buffer queue with heterogenous markow modulated arrival process: A study of a the effects of traffic burstiness on individual packet loss. In: Proceeding of the IEEE INFOCOM
Saito, H.: Optimal queuing discipline for real time traffic at ATM switching nodes. IEEE Transaction on Communications
Tanenbaum, A.S.: Operating System Desin and Implementation. Princeton Hall, Englewood Cliffs (1987)
Gueria, R., Ahmadi, H., Naghahineh, M.: Equivalent Capacity and its application to bandwidth allocation is high-speed networks. IEEE Journal on selected Areas in Communication
Boedihardjo, A.P., Liang, Y.: Hierarchical smoothed round robin scheduling in high speed networks, www.ietdl.org
Silerschatz, A., Galvin, P.B., Gagne, G.: Operating System Concepts
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gope, P., Singh, A., Sharma, A., Pahwa, N. (2011). An Enhanced Round Robin Policy for Real Time Traffic. In: Das, V.V., Stephen, J., Chaba, Y. (eds) Computer Networks and Information Technologies. CNC 2011. Communications in Computer and Information Science, vol 142. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-19542-6_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-19542-6_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-19541-9
Online ISBN: 978-3-642-19542-6
eBook Packages: Computer ScienceComputer Science (R0)