Networking

Worst-Case Fair Bin Sort Queuing (WBSQ): An O(1) Worst-Case Fair Scheduler

Download Now Free registration required

Executive Summary

The Internet has evolved into a ubiquitous global communication medium that carries a constantly evolving traffic mix that is becoming richer as innovation and technology improvements spawn new telecommunications applications and services. Hence, the network must support some form of Quality of Service (QoS) functionality in order to serve large numbers of heterogeneous users and applications with a wide range of requirements in terms of throughput and delay. In packet-switched networks, the link scheduling discipline is a central component of the QoS architecture.

  • Format: PDF
  • Size: 142.1 KB