IEICE TRANSACTIONS on Information
A New Frame-Based Packet Scheduling for Variable-Length Packet Switched Networks --Architecture and Performance Analysis
Summary :
A new frame-based packet scheduling discipline designed for variable length packets is discussed. This algorithm extends a weighted round robin scheduling so that it can serve each queue fairly even if the length of packets varies. It can also handle burstiness by one of its important properties which we call "elasticity." In this paper, an overview of the proposed algorithm is described, and then it is systematically analyzed in terms of several important performance parameters: throughput, work complexity and elasticity. The proposed algorithm is evaluated by simulation and compared with the normal weighted round robin with regard to throughput and delay performance, thereby validating fairness of the algorithm with various types of traffic. Focusing on the complexity of the scheduling algorithm, we further propose and evaluate an improved version of the proposed algorithm, which provides the same properties with lower work complexity.
- Publication
- IEICE TRANSACTIONS on Information Vol.E82-D No.4 pp.879-887
- Publication Date
- 1999/04/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (Special Issue on Internet Technology and Its Applications)
- Category
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Hidetoshi YOKOTA, Mattias FORSBERG, Tohru ASAMI, "A New Frame-Based Packet Scheduling for Variable-Length Packet Switched Networks --Architecture and Performance Analysis" in IEICE TRANSACTIONS on Information,
vol. E82-D, no. 4, pp. 879-887, April 1999, doi: .
Abstract: A new frame-based packet scheduling discipline designed for variable length packets is discussed. This algorithm extends a weighted round robin scheduling so that it can serve each queue fairly even if the length of packets varies. It can also handle burstiness by one of its important properties which we call "elasticity." In this paper, an overview of the proposed algorithm is described, and then it is systematically analyzed in terms of several important performance parameters: throughput, work complexity and elasticity. The proposed algorithm is evaluated by simulation and compared with the normal weighted round robin with regard to throughput and delay performance, thereby validating fairness of the algorithm with various types of traffic. Focusing on the complexity of the scheduling algorithm, we further propose and evaluate an improved version of the proposed algorithm, which provides the same properties with lower work complexity.
URL: https://global.ieice.org/en_transactions/information/10.1587/e82-d_4_879/_p
Copy
@ARTICLE{e82-d_4_879,
author={Hidetoshi YOKOTA, Mattias FORSBERG, Tohru ASAMI, },
journal={IEICE TRANSACTIONS on Information},
title={A New Frame-Based Packet Scheduling for Variable-Length Packet Switched Networks --Architecture and Performance Analysis},
year={1999},
volume={E82-D},
number={4},
pages={879-887},
abstract={A new frame-based packet scheduling discipline designed for variable length packets is discussed. This algorithm extends a weighted round robin scheduling so that it can serve each queue fairly even if the length of packets varies. It can also handle burstiness by one of its important properties which we call "elasticity." In this paper, an overview of the proposed algorithm is described, and then it is systematically analyzed in terms of several important performance parameters: throughput, work complexity and elasticity. The proposed algorithm is evaluated by simulation and compared with the normal weighted round robin with regard to throughput and delay performance, thereby validating fairness of the algorithm with various types of traffic. Focusing on the complexity of the scheduling algorithm, we further propose and evaluate an improved version of the proposed algorithm, which provides the same properties with lower work complexity.},
keywords={},
doi={},
ISSN={},
month={April},}
Copy
TY - JOUR
TI - A New Frame-Based Packet Scheduling for Variable-Length Packet Switched Networks --Architecture and Performance Analysis
T2 - IEICE TRANSACTIONS on Information
SP - 879
EP - 887
AU - Hidetoshi YOKOTA
AU - Mattias FORSBERG
AU - Tohru ASAMI
PY - 1999
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E82-D
IS - 4
JA - IEICE TRANSACTIONS on Information
Y1 - April 1999
AB - A new frame-based packet scheduling discipline designed for variable length packets is discussed. This algorithm extends a weighted round robin scheduling so that it can serve each queue fairly even if the length of packets varies. It can also handle burstiness by one of its important properties which we call "elasticity." In this paper, an overview of the proposed algorithm is described, and then it is systematically analyzed in terms of several important performance parameters: throughput, work complexity and elasticity. The proposed algorithm is evaluated by simulation and compared with the normal weighted round robin with regard to throughput and delay performance, thereby validating fairness of the algorithm with various types of traffic. Focusing on the complexity of the scheduling algorithm, we further propose and evaluate an improved version of the proposed algorithm, which provides the same properties with lower work complexity.
ER -
English
