An Enhanced Round Robin Policy for Real Time Traffic

  • Prosanta Gope
  • Ajit Singh
  • Ashwani Sharma
  • Nikhil Pahwa
Conference paper
Part of the Communications in Computer and Information Science book series (CCIS, volume 142)


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.


Round Robin Quantum Preemptive BGP Router Context Switches CPU cycles 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Chaskar, H.M., Madhow, U.: Fair Scheduling with tunable latency:a round robin approach. IEEE/ACM Trans. Netw. A247, 529–551 (1955)Google Scholar
  2. 2.
    Katevenis, M., Sidoropojlos, S., Courcoubetis, C.: Weighted round robin cell multiplexing in a general-purpose ATM switch chip. IEEE J. Sel. Areas Commun. (1991)Google Scholar
  3. 3.
    Shreedhar, M., Varghese, G.: Efficent fair queueing using deficit Round Robin Technique. IEEE/ACM Trans. Netw. (1996)Google Scholar
  4. 4.
    Saha, D., Mukherjee, S., Tripathi, S.K.: Carry-over round robin: a simple cell scheduling mechanism for ATM networks. IEEE/ACM Trans. Netw. (1998)Google Scholar
  5. 5.
    Saha, D., Mukherjee, S., Tripathi, S.K.: Carry-over round robin: a simple cell scheduling mechanism for ATM networks. IEEE/ACM Trans. Netw. (1998)Google Scholar
  6. 6.
    Zhang, L.: Virtual Clock: a new traffic control algoritm for packet switching networks. ACM SIGCOMM Comput. Commun. Rev. (1990)Google Scholar
  7. 7.
    Garg, R., Chen, X.: RRR: recurcive round robin scheduler. Int. J. Comput. Telecommun. (1999)Google Scholar
  8. 8.
    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 INFOCOMGoogle Scholar
  9. 9.
    Saito, H.: Optimal queuing discipline for real time traffic at ATM switching nodes. IEEE Transaction on CommunicationsGoogle Scholar
  10. 10.
    Tanenbaum, A.S.: Operating System Desin and Implementation. Princeton Hall, Englewood Cliffs (1987)Google Scholar
  11. 11.
    Gueria, R., Ahmadi, H., Naghahineh, M.: Equivalent Capacity and its application to bandwidth allocation is high-speed networks. IEEE Journal on selected Areas in CommunicationGoogle Scholar
  12. 12.
    Boedihardjo, A.P., Liang, Y.: Hierarchical smoothed round robin scheduling in high speed networks,
  13. 13.
    Silerschatz, A., Galvin, P.B., Gagne, G.: Operating System ConceptsGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Prosanta Gope
    • 1
  • Ajit Singh
    • 2
  • Ashwani Sharma
    • 2
  • Nikhil Pahwa
    • 2
  1. 1.Member IACSIT, M.Tech. in Computer Science & EngineeringNIT DurgapurIndia
  2. 2.TIT&SBhiwani

Personalised recommendations