Name
Abstract | ||
|---|---|---|
This paper proposes a new efficient cell scheduling scheme based on the round-robin scheme with multiple distributed windows. The proposed scheduler consists of a set of windows. Each input queue may be linked with windows in proportional to the reserved bandwidth. The scheduler rotates along the windows in a round-robin manner and each window generates a token. Token enables a cell to get service in a slot time. The proposed scheme can be implemented with simple hardware logic of O(1) round-robin technique and can reduce the maximum delay. The proposed scheme also provides good fairness of weighted fair queueing. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1007/3-540-45801-8_76 | ICOIN (2) |
Keywords | Field | DocType |
scheduler rotates,round-robin technique,proposed scheduler,new efficient cell scheduling,round-robin manner,proposed scheme,maximum delay,round-robin scheduling algorithm,good fairness,round-robin scheme,input queue,quality of service,scheduling,weighted fair queueing,scheduling algorithm | Computer science,Scheduling (computing),Queue,Computer network,Quality of service,Real-time computing,Bandwidth (signal processing),Weighted fair queueing,Security token,Round-robin scheduling,Distributed computing | Conference |
ISBN | Citations | PageRank |
3-540-44255-3 | 1 | 0.37 |
References | Authors | |
8 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jin Seek Choi | 1 | 33 | 6.17 |
| Bum Sik Bae | 2 | 1 | 0.37 |
| Hyeong Ho Lee | 3 | 23 | 3.96 |
| Hyeung Sub Lee | 4 | 1 | 0.37 |