A novel core stateless virtual clock scheduling algorithm

Authors:
Wenyu Gao;Jianxin Wang;Songqiao Chen
Affiliations:
School of Information Science and Engineering, Central South University, Changsha, Hunan, P.R. China;School of Information Science and Engineering, Central South University, Changsha, Hunan, P.R. China;School of Information Science and Engineering, Central South University, Changsha, Hunan, P.R. China
Venue:
ICCNMC'05 Proceedings of the Third international conference on Networking and Mobile Computing
Year:
2005

Citing 5
Cited 0

Analysis and simulation of a fair queueing algorithm

SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Virtual clock: a new traffic control algorithm for packet switching networks

SIGCOMM '90 Proceedings of the ACM symposium on Communications architectures & protocols
Efficient fair queueing using deficit round-robin

IEEE/ACM Transactions on Networking (TON)
Providing guaranteed services without per flow management

Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Virtual time reference system: a unifying scheduling framework for scalable support of guaranteed services

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

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.