Fair and Efficient Frame-Based Scheduling Algorithm for Multimedia Networks

The broad spread of packet data networks and the emergence of applications in multimedia communications, created a driving force towards an improved Quality of Service (QoS) model for today’s Internet. A primary component of this model is packet schedulers. We introduce a new frame-based scheduling technique called Mini Round Robin (MRR) designed primarily for providing lower latency bounds, and lower start-up latency bound for low-rate but high-priority flows. This enables applications such as Voice-over-IP to demand low delay despite the low reserved bit rate of the voice sessions.

• Type: Conference
• Year: 2005
• Where: ISCC
• Authors: T. Al-Khasib, Hussein M. Alnuweiri, Hossam Fattah, Victor C. M. Leung
• Keywords: Communications, ISCC 2005, Latency Bound, Lower Latency Bounds, Lower Start-up Latency