A new scalable service discipline for real-time traffic: The framed-deadline scheduler
Computer Communications
Frame-counter scheduler: A novel QoS scheduler for real-time traffic
Computer Communications
| Hi-index | 0.00 |
Two major services are offered in today's telecommunication networks: TDM (voice, video, and private leased line) and Packet (Internet). The existing TDM and IP network architectures have limitations in providing the specific Quality of Service (QoS) guarantees for those two services in a scalable integrated fashion. Furthermore, at the current high network speeds, it is expensive to build switching systems to realize the required network services. We identify two issues that have to be addressed to realize high-speed core networks with end-to-end QoS in scalable architecture. The first issue is the complexity and high cost of providing QoS for different traffic types (TDM and packet traffic). The second issue is the scalability of the switching system to operate and support the QoS guarantees at the high speed. In this thesis, we present a novel core network architecture, the Virtual Synchronous Frame (VSF) network that can provide end-to-end bandwidth and delay guarantees for TDM traffic and best effort service for packet traffic in a unified and scalable fashion. We present two different VSF network architectures with different bandwidth allocation granularities for the real time traffic flows. We then propose the specific VSF switch architectures complete with the fabric schedulers and the output port schedulers that provide these end-to-end bandwidth and delay guarantees. The proposed architectures are scalable and posses low complexity. We also provide the framework for the respective connection admission tests, which assure that the offered guarantees are maintained for new flows admitted to the network.