Integrated Provision of QoS Guarantees to Unicast and Multicast Traffic in Packet Switches
IWDC '01 Proceedings of the Thyrrhenian International Workshop on Digital Communications: Evolutionary Trends of the Internet
Dispatching schemes for Clos-network switches
Computer Networks: The International Journal of Computer and Telecommunications Networking
Resource allocation for quality of service provision in multistage buffered crossbar switches
Computer Networks: The International Journal of Computer and Telecommunications Networking
Design issues in next-generation merchant switch fabrics
IEEE/ACM Transactions on Networking (TON)
Fair link striping with FIFO delivery on heterogeneous channels
Computer Communications
Microprocessors & Microsystems
Distributed WFQ scheduling converging to weighted max-min fairness
Computer Networks: The International Journal of Computer and Telecommunications Networking
Scheduling multicast traffic in a combined input separate output queued switch
NPC'05 Proceedings of the 2005 IFIP international conference on Network and Parallel Computing
AsiaSim'04 Proceedings of the Third Asian simulation conference on Systems Modeling and Simulation: theory and applications
| Hi-index | 0.07 |
The continuous growth in the demand for diversified quality-of-service (QoS) guarantees in broadband networks introduces new challenges in the design of packet switches that scale to large switching capacities. Packet scheduling is the most critical function involved in the provision of individual bandwidth and delay guarantees to the switched flows. Most of the scheduling techniques proposed so far assume the presence in the switch of a single contention point, residing in front of the outgoing links. Such an assumption is not consistent with the highly distributed nature of many popular architectures for scalable switches, which typically have multiple contention points, located in both ingress and egress port cards, as well as in the switching fabric. We define a distributed multilayered scheduler (DMS) to provide differentiated QoS guarantees to individual end-to-end flows in packet switches with multiple contention points. Our scheduling architecture is simple to implement, since it keeps per-flow scheduling confined within the port cards, and is suitable to support guaranteed and best-effort traffic in a wide range of QoS frameworks in both IP and ATM networks