IEICE TRANSACTIONS on Communications
A Priority-Based Packet Scheduling Architecture for Integrated Services Networks
Summary :
To simultaneously support guaranteed real-time services and best-effort service, a Priority-based Scheduling Architecture (PSA) designed for high-speed switches is proposed. PSA divides packet scheduling into high-priority phase and low-priority phase. In the high-priority phase, an improved sorted-priority algorithm is presented. It introduces a new constraint into the scheduling discipline to overcome bandwidth preemption. Meanwhile, the virtual time function with a control factor α is employed. Both computer simulation results and theoretic analysis show that the PSA mechanism has excellent performance in terms of the implementation complexity, fairness and delay properties.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E89-B No.3 pp.704-708
- Publication Date
- 2006/03/01
- Publicized
- Online ISSN
- 1745-1345
- DOI
- 10.1093/ietcom/e89-b.3.704
- Type of Manuscript
- Special Section LETTER (Special Section on the Next Generation Ethernet Technologies)
- 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
Junni ZOU, Hongkai XIONG, Rujian LIN, "A Priority-Based Packet Scheduling Architecture for Integrated Services Networks" in IEICE TRANSACTIONS on Communications,
vol. E89-B, no. 3, pp. 704-708, March 2006, doi: 10.1093/ietcom/e89-b.3.704.
Abstract: To simultaneously support guaranteed real-time services and best-effort service, a Priority-based Scheduling Architecture (PSA) designed for high-speed switches is proposed. PSA divides packet scheduling into high-priority phase and low-priority phase. In the high-priority phase, an improved sorted-priority algorithm is presented. It introduces a new constraint into the scheduling discipline to overcome bandwidth preemption. Meanwhile, the virtual time function with a control factor α is employed. Both computer simulation results and theoretic analysis show that the PSA mechanism has excellent performance in terms of the implementation complexity, fairness and delay properties.
URL: https://global.ieice.org/en_transactions/communications/10.1093/ietcom/e89-b.3.704/_p
Copy
@ARTICLE{e89-b_3_704,
author={Junni ZOU, Hongkai XIONG, Rujian LIN, },
journal={IEICE TRANSACTIONS on Communications},
title={A Priority-Based Packet Scheduling Architecture for Integrated Services Networks},
year={2006},
volume={E89-B},
number={3},
pages={704-708},
abstract={To simultaneously support guaranteed real-time services and best-effort service, a Priority-based Scheduling Architecture (PSA) designed for high-speed switches is proposed. PSA divides packet scheduling into high-priority phase and low-priority phase. In the high-priority phase, an improved sorted-priority algorithm is presented. It introduces a new constraint into the scheduling discipline to overcome bandwidth preemption. Meanwhile, the virtual time function with a control factor α is employed. Both computer simulation results and theoretic analysis show that the PSA mechanism has excellent performance in terms of the implementation complexity, fairness and delay properties.},
keywords={},
doi={10.1093/ietcom/e89-b.3.704},
ISSN={1745-1345},
month={March},}
Copy
TY - JOUR
TI - A Priority-Based Packet Scheduling Architecture for Integrated Services Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 704
EP - 708
AU - Junni ZOU
AU - Hongkai XIONG
AU - Rujian LIN
PY - 2006
DO - 10.1093/ietcom/e89-b.3.704
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E89-B
IS - 3
JA - IEICE TRANSACTIONS on Communications
Y1 - March 2006
AB - To simultaneously support guaranteed real-time services and best-effort service, a Priority-based Scheduling Architecture (PSA) designed for high-speed switches is proposed. PSA divides packet scheduling into high-priority phase and low-priority phase. In the high-priority phase, an improved sorted-priority algorithm is presented. It introduces a new constraint into the scheduling discipline to overcome bandwidth preemption. Meanwhile, the virtual time function with a control factor α is employed. Both computer simulation results and theoretic analysis show that the PSA mechanism has excellent performance in terms of the implementation complexity, fairness and delay properties.
ER -
English
