DocumentCode :
2710867
Title :
Credit-based fair queueing (CBFQ): a simple and feasible scheduling algorithm for packet networks
Author :
Bensaou, Brahim ; Chan, K.T. ; Tsang, D.H.K.
Author_Institution :
Dept. of Electr. & Electron. Eng., Hong Kong Univ. of Sci. & Technol., Hong Kong
fYear :
1997
fDate :
25-28 May 1997
Firstpage :
589
Lastpage :
594
Abstract :
A simple rate-based scheduling algorithm for packet-switched networks (e.g. Internet, ATM) is proposed. By using simple counters to keep trade of the amount of credits accumulated by each traffic stream, the algorithm decides which stream to serve next based on the bandwidth share allocated to each traffic stream and the sizes of their respective head of line (HOL) packets. Our proposed CBFQ algorithm achieves the same fairness and delay bounds as the alternative approaches based on virtual time, while avoiding the implementation problems inherent in these methods. In addition, to take advantage of the fixed packet size in ATM networks, a variant of the algorithm (CBFQ-F) is proposed. By relaxing the fairness bound by a negligible amount, CBFQ-F achieves a complexity of O(1)
Keywords :
asynchronous transfer mode; computational complexity; packet switching; queueing theory; scheduling; telecommunication traffic; ATM networks; CBFQ; CBFQ-F; bandwidth share allocation; complexity; credit-based fair queueing; delay; fairness; head of line packets; packet networks; packet size; packet-switched networks; rate-based scheduling algorithm; scheduling algorithm; traffic stream; Aggregates; Bandwidth; Clocks; Computer networks; Counting circuits; Internet; Scheduling algorithm; Stability; Telecommunication traffic; Traffic control;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
IEEE ATM Workshop 1997. Proceedings
Conference_Location :
Lisboa
Print_ISBN :
0-7803-4196-1
Type :
conf
DOI :
10.1109/ATM.1997.624744
Filename :
624744
Link To Document :
بازگشت