Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

Rate-based packet scheduling paradigm

Rate-based packet scheduling paradigm

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IEE Proceedings - Software — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

One of the most important issues in providing timely and predictable communication services is the packet scheduling algorithms used at the end/intermediate nodes in the network. A generic rate-based scheduling paradigm that can serve as a vehicle for implementing existing well-known rate-based packet scheduling algorithms is presented. The proposed scheduling paradigm is general enough to encompass a wide spectrum of rate-based scheduling algorithms and is flexible enough to allow realisation of several desirable features, e.g. rate enforcement, capability of handling overbooking, and capability of providing rate parameters for traffic monitoring. Its modular design also facilitates realisation of multiple scheduling algorithms in a uniform framework.

References

    1. 1)
      • A.K. PAREKH , R.G. GALLAGER . A generalised processor sharing approach to flow control in integrated services networks: The single-node case. IEEE/ACM Trans. Netw. , 3 , 344 - 357
    2. 2)
      • C.L. LIU , J.W. LAYLAND . Scheduling algorithms for multiprogramming in a hard-real-time environment. Journal of the ACM , 174 - 189
    3. 3)
      • P. GOYAL , H.M. VIN , H. CHENG . Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks. Proc. of ACM SIGCOMM'96 , 157 - 168
    4. 4)
      • BENNETT, J.C.R., ZHANG, H.: `WF ', IEEE INFOCOM'96, March 1996, San Francisco, California.
    5. 5)
      • CHEN, B., AGRAWAL, G., ZHAO, W.: `Optimal synchronous capacity allocation for hard real-time communications with the timed token protocol', Proc. of the 13th Real-Time Systems Symposium, December 1992, Phoenix, Arizona, p. 198–207.
    6. 6)
      • A. VOGEL , B. KERHERVE , G. von BOCHMANN , J. GECSEI . Distributed multimedia and QoS: a survey. IEEE Multimedia , 10 - 18
    7. 7)
      • L. ZHANG , S. DEERING , D. ESTRIN , S. SHENKER , D. ZAPPALA . A new resource reservation protocol. IEEE Netw. , 5
    8. 8)
      • DEMERS, A., KESHAV, S., SHENKER, S.: `Analysis and simulation of a fair queueing algorithm', SIGCOMM Symp. on Communications architectures and protocols, September 1989, Austin, TX, p. 1–12.
    9. 9)
      • C.-C. HAN , K.-J. LIN , C.-J. HOU . Distance-constrained scheduling and its applications in real-time systems. IEEE Trans. Comput. , 7 , 814 - 826
    10. 10)
      • HAN, C.-C., SHIN, K.G.: `Scheduling mpeg-compressed video streams with firm deadline constraints', Proc. 3rd ACM international multimedia conference and exhibition (Multimedia'95), November 1995, San Francisco, California, p. 411–422.
    11. 11)
      • S. JAMALODDIN GOLESTANI . A self-clocked fair queueing scheme for broadband applications. Proc. IEEE INFOCOM'94 , 636 - 646
    12. 12)
      • HAMDAOUI, M., RAMANATHAN, P.: `A service policy for real-time customers with (', Proc. 24th annual international symposium on Fault-tolerant computing, 1994, Austin, Texas, p. 196–205.
    13. 13)
      • S. SURI , G. VARGHESE , G. CHANDRANMENON . Leap forward virtual clock: A new fair queuing scheme with guaranteed delays and throughput fairness. IEEE Proc. INFOCOM'97
    14. 14)
      • N. MALCOLM , W. ZHAO . The timed-token protocol for real-time communications. IEEE Comput. , 1 , 35 - 40
    15. 15)
      • C.M. ARAS , J.F. KUROSE , D.S. REEVES , H. SCHULZRINNE . Real-time communication in packet-switched networks. Proc. IEEE , 1 , 122 - 139
    16. 16)
      • H.-Y. TYAN , C.-J. HOU . JavaSim: A component-based compositional network simulation environment. Western Simulation Multiconference—Communication Networks and Distributed Systems Modeling and Simulation
    17. 17)
      • G. AGRAWAL , B. CHEN , W. ZHAO , S. DAVARI . Guaranteeing synchronous message deadlines with the timed token medium access control protocol. IEEE Trans. Comput. , 3 , 327 - 350
    18. 18)
      • JACOBSON, V.: `Differentiated services architecture', Talk in the Int-Serv WG at the Munich IETF, August 1997.
    19. 19)
      • TYAN, H.-Y., WANG, B., YE, Y., HOU, C.-J.: `Netsim', 3rd NASA research and education network workshop, August 1998, Moffett Field, CA.
    20. 20)
      • A.K. PAREKH , R.G. GALLAGER . A generalised processor sharing approach to flow control in integrated services networks: the multiple node case. IEEE/ACM Trans. Netw. , 2 , 137 - 150
    21. 21)
      • L. ZHANG . Virtual clock: a new traffic control algorithm for packet switching. ACM Trans. Comput. Syst. , 2 , 101 - 124
    22. 22)
      • S. JAMALODDIN GOLESTANI . Congestion-free communication in high-speed packet networks. IEEE Trans. Commun. , 1802 - 1812
    23. 23)
      • K. NICHOLS , V. JACOBSON , L. ZHANG . A two-bit differentiated services architecture for the Internet', November 1997.
http://iet.metastore.ingenta.com/content/journals/10.1049/ip-sen_20010508
Loading

Related content

content/journals/10.1049/ip-sen_20010508
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address