5 November 1999 Lightweight scheduling for delay and bandwidth assurance in differentiated services
Author Affiliations +
To overcome the inherent limitation of the single best- effort service currently provided the Internet, providing differentiated services for different classes of applications is being discussed in IETF. In this paper, we propose a lightweight packet scheduling algorithm that allocates forwarding resources to different classes, which we name controlled priority (CP) gateway algorithm. The proposed CP algorithm consists of two mechanisms denoted by CP-CQD (controllable queuing delay) and CP-STI (service time interval), respectively. CP-CQD controls the queuing delay for a class of delay/jitter-sensitive traffic. CP-STI is to service classes that require bandwidth assurance. The proposed algorithm can provide guaranteed bounds of delay, jitter, rate, and packet loss to certain aggregate flows. The CP-CQD can accommodate variable bit rate as well as constant bit rate flow without bandwidth reservation for end-to-end delay bound and minimum delay jitter. The CP-STI enables tagged classes to get guaranteed throughput. These two modules can control resources allocated to the traffic classes by adjusting parameters in response to local congestion level. The simulation results show that CP gateway algorithm can provide required quality of service to certain classes while easing the negative effects on best- effort classes.
© (1999) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Jitae Shin, Jitae Shin, Daniel C. Lee, Daniel C. Lee, C.-C. Jay Kuo, C.-C. Jay Kuo, } "Lightweight scheduling for delay and bandwidth assurance in differentiated services", Proc. SPIE 3842, Internet II: Quality of Service and Future Directions, (5 November 1999); doi: 10.1117/12.368308; https://doi.org/10.1117/12.368308

Back to Top