On QoS guarantee in MPLS network with software deadline awareness
Yu Gao, Yaohui Jin, Hong Cheng, Yingdi Yu, Weiqiang Sun, Wei Guo, Weisheng Hu · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 2007
With the increasing number of internet users, more and more real-time services are added into the network, such as IPTV, online-video, Voice over IP, etc. As we know, throughput is a highly important performance criterion for scheduling algorithms of networks. Besides throughput, these growing real-time services are very sensitive to delay variance termed as jitter. Therefore, high performance scheduling algorithm should achieve good performance in terms of throughput, delay, jitter and fairness together. Scheduling algorithm with deadline-awareness employed in packet switching plays a key role in QoS guarantees. Although traditional hard-deadline can provide guarantee on in-node delay-deadline criteria, the end-to-end delay-deadline criteria cannot be guaranteed due to the characteristic of hard-deadline, while the delay-deadline guaranteed throughput is low. Thus, soft-deadline scheduling algorithm has been proposed. In this paper, we investigate and compare the classical hard-deadline and soft-deadline switching algorithm. A new scheme "Bonus System" is proposed in order to realize the idea of soft-deadline switching algorithm. Bonus System based on soft-deadline is compared with classical Early-Deadline First scheme based on hard-deadline, which shows that Bonus System has better performance in End-to-End deadline guarantee.