Name
Abstract | ||
|---|---|---|
In this paper, a core-stateless virtual clock-based scheduling algorithm is developed, which combines the simplicity and high performance of FCFS and the fair resource allocation of Fair Queue. The basic idea of this algorithm is using virtual clock to calculate the expected depart time of every packet, and construct a packet queue according to the expected depart time. The algorithm uses only one queue to approximate the multi queue in fair queue algorithm. Because of using the only one packet queue, it is unnecessary for routers to perform per flow state management and the algorithm has good performance in scalability. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/11534310_70 | ICCNMC |
Keywords | Field | DocType |
fair queue,basic idea,good performance,multi queue,high performance,virtual clock scheduling algorithm,virtual clock,core-stateless virtual clock-based scheduling,fair resource allocation,novel core,fair queue algorithm,packet queue,resource allocation,scheduling algorithm,fair queueing | Run queue,Multilevel queue,Computer science,Multilevel feedback queue,Parallel computing,Computer network,Priority queue,Queue management system,Job queue,Double-ended queue,Distributed computing,Fair queuing | Conference |
Volume | ISSN | ISBN |
3619 | 0302-9743 | 3-540-28102-9 |
Citations | PageRank | References |
0 | 0.34 | 6 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| wenyu gao | 1 | 9 | 0.98 |
| Jianxin Wang | 2 | 2163 | 283.94 |
| Songqiao Chen | 3 | 58 | 11.12 |