Packet-Mode Scheduling with Proportional Fairness for Input-Queued Switches

Kang XI; Shin'ichi ARAKAWA; Masayuki MURATA; Ning GE; Chongxi FENG

doi:10.1093/ietcom/e88-b.11.4274

Packet-Mode Scheduling with Proportional Fairness for Input-Queued Switches

Kang XI, Shin'ichi ARAKAWA, Masayuki MURATA, Ning GE, Chongxi FENG

Full Text Views

0

Share
Cite this

Summary :

Proportional fair bandwidth allocation in packet switches is a fundamental issue to provide quality of service (QoS) support in IP networks. In input-queued switches, packet-mode scheduling delivers all the segments of a packet contiguously from the input port to the output port, thus greatly simplifying the design of packet reassembly modules and yielding performance advantage over cell-mode scheduling under certain conditions [1]. One of the important issues of packet-mode scheduling is how to achieve fair bandwidth allocation among flows with different packet sizes. This paper presents an algorithm called packet-mode fair scheduling (pFS) that guarantees each flow a bandwidth proportional to its reservation regardless of the packet size distribution and the system load. Simulations show that our approach achieves good fairness as well as high throughput and low packet delay. Compared to algorithms without fairness mechanism, pFS yields significant performance improvement in terms of average packet delay when the traffic is heterogeneous. A hardware implementation is presented to show that the proposed algorithm has low complexity and the computation can be completed in a single clock cycle, which makes pFS applicable to high-speed switches.

Publication: IEICE TRANSACTIONS on Communications Vol.E88-B No.11 pp.4274-4284

Publication Date: 2005/11/01

Publicized

Online ISSN

DOI: 10.1093/ietcom/e88-b.11.4274

Type of Manuscript: PAPER

Category: Switching for Communications

Cite this

Copy

Kang XI, Shin'ichi ARAKAWA, Masayuki MURATA, Ning GE, Chongxi FENG, "Packet-Mode Scheduling with Proportional Fairness for Input-Queued Switches" in IEICE TRANSACTIONS on Communications, vol. E88-B, no. 11, pp. 4274-4284, November 2005, doi: 10.1093/ietcom/e88-b.11.4274.
Abstract: Proportional fair bandwidth allocation in packet switches is a fundamental issue to provide quality of service (QoS) support in IP networks. In input-queued switches, packet-mode scheduling delivers all the segments of a packet contiguously from the input port to the output port, thus greatly simplifying the design of packet reassembly modules and yielding performance advantage over cell-mode scheduling under certain conditions [1]. One of the important issues of packet-mode scheduling is how to achieve fair bandwidth allocation among flows with different packet sizes. This paper presents an algorithm called packet-mode fair scheduling (pFS) that guarantees each flow a bandwidth proportional to its reservation regardless of the packet size distribution and the system load. Simulations show that our approach achieves good fairness as well as high throughput and low packet delay. Compared to algorithms without fairness mechanism, pFS yields significant performance improvement in terms of average packet delay when the traffic is heterogeneous. A hardware implementation is presented to show that the proposed algorithm has low complexity and the computation can be completed in a single clock cycle, which makes pFS applicable to high-speed switches.
URL: https://globals.ieice.org/en_transactions/communications/10.1093/ietcom/e88-b.11.4274/_p

Copy

@ARTICLE{e88-b_11_4274,
author={Kang XI, Shin'ichi ARAKAWA, Masayuki MURATA, Ning GE, Chongxi FENG, },
journal={IEICE TRANSACTIONS on Communications},
title={Packet-Mode Scheduling with Proportional Fairness for Input-Queued Switches},
year={2005},
volume={E88-B},
number={11},
pages={4274-4284},
abstract={Proportional fair bandwidth allocation in packet switches is a fundamental issue to provide quality of service (QoS) support in IP networks. In input-queued switches, packet-mode scheduling delivers all the segments of a packet contiguously from the input port to the output port, thus greatly simplifying the design of packet reassembly modules and yielding performance advantage over cell-mode scheduling under certain conditions [1]. One of the important issues of packet-mode scheduling is how to achieve fair bandwidth allocation among flows with different packet sizes. This paper presents an algorithm called packet-mode fair scheduling (pFS) that guarantees each flow a bandwidth proportional to its reservation regardless of the packet size distribution and the system load. Simulations show that our approach achieves good fairness as well as high throughput and low packet delay. Compared to algorithms without fairness mechanism, pFS yields significant performance improvement in terms of average packet delay when the traffic is heterogeneous. A hardware implementation is presented to show that the proposed algorithm has low complexity and the computation can be completed in a single clock cycle, which makes pFS applicable to high-speed switches.},
keywords={},
doi={10.1093/ietcom/e88-b.11.4274},
ISSN={},
month={November},}

Copy

TY - JOUR
TI - Packet-Mode Scheduling with Proportional Fairness for Input-Queued Switches
T2 - IEICE TRANSACTIONS on Communications
SP - 4274
EP - 4284
AU - Kang XI
AU - Shin'ichi ARAKAWA
AU - Masayuki MURATA
AU - Ning GE
AU - Chongxi FENG
PY - 2005
DO - 10.1093/ietcom/e88-b.11.4274
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E88-B
IS - 11
JA - IEICE TRANSACTIONS on Communications
Y1 - November 2005
AB - Proportional fair bandwidth allocation in packet switches is a fundamental issue to provide quality of service (QoS) support in IP networks. In input-queued switches, packet-mode scheduling delivers all the segments of a packet contiguously from the input port to the output port, thus greatly simplifying the design of packet reassembly modules and yielding performance advantage over cell-mode scheduling under certain conditions [1]. One of the important issues of packet-mode scheduling is how to achieve fair bandwidth allocation among flows with different packet sizes. This paper presents an algorithm called packet-mode fair scheduling (pFS) that guarantees each flow a bandwidth proportional to its reservation regardless of the packet size distribution and the system load. Simulations show that our approach achieves good fairness as well as high throughput and low packet delay. Compared to algorithms without fairness mechanism, pFS yields significant performance improvement in terms of average packet delay when the traffic is heterogeneous. A hardware implementation is presented to show that the proposed algorithm has low complexity and the computation can be completed in a single clock cycle, which makes pFS applicable to high-speed switches.
ER -