BCSQ: Bin-Based Core Stateless Queueing for Scalable Support of Guaranteed Services

Free registration required

Executive Summary

Core stateless packet scheduling systems have received considerable attention in recent years because of their scalability in supporting per-flow Quality of Services guarantees. In such a system core routers do not need to maintain per-flow state and do not need to perform per-flow operations such as per-flow classification, per-flow queueing, and per-flow scheduling. On the other hand, existing core stateless packet schedulers require core routers to sort incoming packets based on their virtual finish times.

  • Format: PDF
  • Size: 209.7 KB