Hierarchical Scheduling for DiffServ Classes

Document Type

Curriculum Material

Publication Date

11-29-2004

Publication Title

GLOBECOM'04 - IEEE Global Telecommunications Conference

Publisher

Institute of Electrical and Electronics Engineers

First page number:

707

Last page number:

712

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. We propose a 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 needed to be transmitted between input ports and the central scheduler are dramatically reduced compared with existing maximal weight matching based DiffServ scheduling algorithms. The trade-off of its slightly worse delay performance is acceptable.

Keywords

Delay; Diffserv networks; Dynamic scheduling; Impedance matching; Processor scheduling; Scalability; Scheduling algorithm; Switches; Throughput; Web and internet services

Language

English

Permissions

Use Find in Your Library, contact the author, or interlibrary loan to garner a copy of the item. Publisher policy does not allow archiving the final published version. If a post-print (author's peer-reviewed manuscript) is allowed and available, or publisher policy changes, the item will be deposited.

UNLV article access

Share

COinS