Analysis of Multi-Server Round Robin Scheduling Disciplines
Summary :
With the need and adoption of link aggregation where multiple links exist between two adjacent nodes in order to increase transmission capacity between them, there arise the problems of service guarantee and fair sharing of multiple servers. Although a lot of significant work has been done for single-server scheduling disciplines in the past years, not much work is available for multi-server scheduling disciplines. In this paper, we present and investigate two round robin based multi-server scheduling disciplines, which are Multi-Server Uniform Round Robin (MS-URR) and Multi-Server Deficit Round Robin (MS-DRR). In particular, we analyze their service guarantees and fairness bounds. In addition, we discuss the misordering problem with MS-DRR and present a bound for its misordering probability.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E87-B No.12 pp.3593-3602
- Publication Date
- 2004/12/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- PAPER
- Category
- Switching for Communications
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
Haiming XIAO, Yuming JIANG, "Analysis of Multi-Server Round Robin Scheduling Disciplines" in IEICE TRANSACTIONS on Communications,
vol. E87-B, no. 12, pp. 3593-3602, December 2004, doi: .
Abstract: With the need and adoption of link aggregation where multiple links exist between two adjacent nodes in order to increase transmission capacity between them, there arise the problems of service guarantee and fair sharing of multiple servers. Although a lot of significant work has been done for single-server scheduling disciplines in the past years, not much work is available for multi-server scheduling disciplines. In this paper, we present and investigate two round robin based multi-server scheduling disciplines, which are Multi-Server Uniform Round Robin (MS-URR) and Multi-Server Deficit Round Robin (MS-DRR). In particular, we analyze their service guarantees and fairness bounds. In addition, we discuss the misordering problem with MS-DRR and present a bound for its misordering probability.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e87-b_12_3593/_p
Copy
@ARTICLE{e87-b_12_3593,
author={Haiming XIAO, Yuming JIANG, },
journal={IEICE TRANSACTIONS on Communications},
title={Analysis of Multi-Server Round Robin Scheduling Disciplines},
year={2004},
volume={E87-B},
number={12},
pages={3593-3602},
abstract={With the need and adoption of link aggregation where multiple links exist between two adjacent nodes in order to increase transmission capacity between them, there arise the problems of service guarantee and fair sharing of multiple servers. Although a lot of significant work has been done for single-server scheduling disciplines in the past years, not much work is available for multi-server scheduling disciplines. In this paper, we present and investigate two round robin based multi-server scheduling disciplines, which are Multi-Server Uniform Round Robin (MS-URR) and Multi-Server Deficit Round Robin (MS-DRR). In particular, we analyze their service guarantees and fairness bounds. In addition, we discuss the misordering problem with MS-DRR and present a bound for its misordering probability.},
keywords={},
doi={},
ISSN={},
month={December},}
Copy
TY - JOUR
TI - Analysis of Multi-Server Round Robin Scheduling Disciplines
T2 - IEICE TRANSACTIONS on Communications
SP - 3593
EP - 3602
AU - Haiming XIAO
AU - Yuming JIANG
PY - 2004
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E87-B
IS - 12
JA - IEICE TRANSACTIONS on Communications
Y1 - December 2004
AB - With the need and adoption of link aggregation where multiple links exist between two adjacent nodes in order to increase transmission capacity between them, there arise the problems of service guarantee and fair sharing of multiple servers. Although a lot of significant work has been done for single-server scheduling disciplines in the past years, not much work is available for multi-server scheduling disciplines. In this paper, we present and investigate two round robin based multi-server scheduling disciplines, which are Multi-Server Uniform Round Robin (MS-URR) and Multi-Server Deficit Round Robin (MS-DRR). In particular, we analyze their service guarantees and fairness bounds. In addition, we discuss the misordering problem with MS-DRR and present a bound for its misordering probability.
ER -
English
