Hierarchical scheduling algorithm for QoS guaranteein MIQ switches

Kim, Hakyong; Kim, Kiseon; Lee, Yongtak

doi:10.1049/el:20001123

Cited by 4 publications

(4 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The idea of hierarchical scheduling was first introduced in [8] to provide QoS guarantees for real-time traffic as well as high switch throughput. We extend the idea here to support DiffServ classes.…”

Section: The Hds Algorithmmentioning

confidence: 99%

“…Compared with OQ switches, input-queued (IQ) switches are more scalable since they only need the switching fabric and memories to run at the line rate. In the literature, many QoS supporting scheduling algorithms have been proposed for IQ switches [6], [7], [8], [9], [10], [11]. Most of them are maximal weight matching (MWM)-based algorithms [12] with different definitions of the weight.…”

Section: Introductionmentioning

confidence: 99%

“…Extending the idea of hierarchial scheduling [8], we propose the hierarchical DiffServ scheduling (HDS) algorithm which provides minimum bandwidth guarantees for EF and AF classes and fair bandwidth allocation for BE class as the DDS algorithm but with a much simpler implementation.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Hierarchical scheduling for DiffServ classes

Yang

Wang

et al.

IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.

View full text Add to dashboard Cite

Abstract-Due to its simplicity and scalability, the differentiated services (DiffServ) model is expected to be widely deployed across the Internet. For each DiffServ compliant router, the scheduling algorithm is critical in implementing per hop behaviors (PHBs), according to which packets are forwarded. In this paper, we propose the hierarchical DiffServ scheduling (HDS) algorithm to support DiffServ classes on input-queued switches. The proposed HDS algorithm features in a hierarchical scheduling scheme that consists of two levels of schedulers. One level is the central scheduler which is designed to maximize the switch throughput by computing a maximal size matching between input ports and output ports. The other level is formed by input port schedulers which provide differentiated services by serving cells belonging to different classes dynamically. Using such a hierarchical scheme, the implementation complexity and the amount of information needs to be transmitted between input ports and the central scheduler are dramatically reduced compared with existing maximal weight matching based DiffServ scheduling algorithms. The tradeoff of its slightly worse delay performance is acceptable.

show abstract

Section: The Hds Algorithmmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Hierarchical scheduling for DiffServ classes

Yang

Wang

et al.

IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.

View full text Add to dashboard Cite

show abstract

“…Therefore, it is envisaged that WRR_PQ technique will improve the limitations of both Recently, hierarchical scheduling methods have been deployed in data communication area for QoS purpose in terms of rate controlling [11], Multiple Input-Queued (MIQ) switches [12], [131, scheduling latency [14] as well as in DiffServ domain [15], [16], [17]. This work suggests the used of hierarchical scheduling in DiffServ ingress edge router where the design is based on the Diffserv network model shown in [15].…”

Section: C3rsmentioning

confidence: 99%

Differentiated Services Enhancements for Efficient IP QoS Implementation

Abidin

Din

Fisal³

2005 13th IEEE International Conference on Networks Jointly Held With the 2005 IEEE 7th Malaysia International Conf on Communic

View full text Add to dashboard Cite

To enhance the deployment of DifServ network we propose two mechanisms, i.e. Connection Admission Control (CAC) facility and hierarchical scheduling. In this paper we describe both facilities and report the results of the simulation work. Simulation work was conducted using ns-2. The CAC scheme is parameter-based, where three distinct types of DiffServ traffic were given bandwidth allocation using peak rate, effective rate and mean rate values. In the simulation work, it is found that the admission control scheme gave better service in terms of blocking probability, throughput and queue size compared to normal DiffServ network. Whereas in the hierarchical scheduling scheme, two levels of scheduling were used, i.e. using weighted round robin and priority queuing. The network performance in terms of throughput is observed. The simulation results shows that better performance were achieved with hierarchical scheduling.

show abstract

PMUF: A High-Performance Scheduling Algorithm for DiffServ Classes

Peng

Wang

et al. 2009

2009 International Joint Conference on Computational Sciences and Optimization

View full text Add to dashboard Cite

Hierarchical scheduling algorithm for QoS guaranteein MIQ switches

Cited by 4 publications

References 3 publications

Hierarchical scheduling for DiffServ classes

Hierarchical scheduling for DiffServ classes

Differentiated Services Enhancements for Efficient IP QoS Implementation

PMUF: A High-Performance Scheduling Algorithm for DiffServ Classes

Contact Info

Product

Resources

About