References
[1]. Deming Liu & Yann-Hang Lee.(2003). An Efficient
Scheduling Discipline for Packet Switching Networks using
Earliest Deadline First Round Robin. IEEE Department of
Computer Science and Engineering. Arizona State
University:USA.
[2]. Douglas Corner, Maxim Martynov (2006). Design and Implementation of Hybrid Packet Scheduling Schemes with
Network Processors. IEEE ICC Proceedings.
[3]. Golestani.S (1994). A Self Clocked Fair Queuing
Scheme for Broadband Applications. In Proc.IEEE
INFOCOM’94. (pp. 636-646).Toronto: Ont.Canada.
[4]. Greenberg.A & Madras.N. (1990). How Fair is Fair
Queuing?. In Proc.Performance.90
[5]. Jiani Guo,Jingnan Yao & Laxmi Bhuyan(2005). An
Efficient Packet Scheduling Algorithm in Network Processors.
IEEE.
[6]. John Stankovic. A, Marco Spuri, et al.(1998). Deadline
Scheduling for Real-Time systems: EDF and related
Algorithms. Kluwer Academic Publishers.
[7]. Parekh.A.K..& Gallager.R.G.(1992). A Generalized
Processor sharing approach to flow control. In Proc. IEEE INFOCOM’92.Vol.2, 915-924.
[8]. Ramabhadran. S & Pasquale. J.(2006). The Stratified
Round Robin Scheduler: Design, Analysis and
Implementation. IEEE/ACM Trans. on Networking. Vol.14.
Issue 6.(pp.1362-1373).
[9]. Shreedhar.M & Varghese.G,.(1996). Efficient fair
Queuing using Deficit Round Robin. IEEE/ACM Transactions
on Networking. Vol.4, No.3.
[10]. Shun Cheng Y & Corneliu Pencea.S.(2002). BSFQ: Bin
Sort Fair Queuing. IEEE. Department of Mathematics and
Computer Science: Emory University: Atlanta.
[11]. Suri,Varghese.G & Chandranmenon.G. (1997). Leap
Forward Virtual Clock: A New Fair Queuing Scheme with
Guaranteed Delays and Throughput Fairness, IEEE Infocom
(pp.557-565).
