Multiple Hop Jitter Controlled Quality of Service with Measurement Based Admission Control

摘要

Providing reasonable quality of service (QoS) for realtime applications yet improving network resource utilization strongly relies on a traffic scheduling method that is adaptable to varying traffic load and an admission control algorithm that does not depend on worst-case traffic description. This paper presents a jitter controlled scheduling approach called LAZY with a measurement based admission control algorithm. The LAZY approach provides an on-time delivery service; hence, packets arrive at the destination neither too late nor too early, but right around the deadline. This service will ensure an end user that he will receive the requested data when he needs them. In addition, network bandwidth can be utilized more efficiently. Our simulation results shows that in the case of smooth traffic, the LAZY approach shows similar percentages of flow rejection and link utilization while offering much less standard deviation of packet delays compared to the FIFO approach. In the case of bursty traffic, the LAZY approach can achieve a better end-to-end delay closer to the target delay yet provide much less standard deviation of packet delays with the price of a slight increase in the flow rejection when compared with the FIFO approach.