New Scheduling Mechanisms for Achieving Fairness Criteria (MCR Plus Equal Share, Maximum of MCR or Max-Min Share)
Summary :
The ATM Forum specifies several fairness criteria, thus the scheduling mechanisms should allocate enough bandwidth to each connection to achieve one of such fairness criteria. However, two fairness criteria (MCR plus equal share, maximum of MCR or Max-Min share) cannot be achieved by conventional scheduling mechanisms. In this letter, we have developed new scheduling mechanisms that achieve these fairness criteria. We also present simulation results to show that our mechanisms can allocate bandwidth fairly.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E82-B No.6 pp.962-966
- Publication Date
- 1999/06/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- LETTER
- Category
- Switching and Communication Processing
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
Masayoshi NABESHIMA, Naoaki YAMANAKA, "New Scheduling Mechanisms for Achieving Fairness Criteria (MCR Plus Equal Share, Maximum of MCR or Max-Min Share)" in IEICE TRANSACTIONS on Communications,
vol. E82-B, no. 6, pp. 962-966, June 1999, doi: .
Abstract: The ATM Forum specifies several fairness criteria, thus the scheduling mechanisms should allocate enough bandwidth to each connection to achieve one of such fairness criteria. However, two fairness criteria (MCR plus equal share, maximum of MCR or Max-Min share) cannot be achieved by conventional scheduling mechanisms. In this letter, we have developed new scheduling mechanisms that achieve these fairness criteria. We also present simulation results to show that our mechanisms can allocate bandwidth fairly.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e82-b_6_962/_p
Copy
@ARTICLE{e82-b_6_962,
author={Masayoshi NABESHIMA, Naoaki YAMANAKA, },
journal={IEICE TRANSACTIONS on Communications},
title={New Scheduling Mechanisms for Achieving Fairness Criteria (MCR Plus Equal Share, Maximum of MCR or Max-Min Share)},
year={1999},
volume={E82-B},
number={6},
pages={962-966},
abstract={The ATM Forum specifies several fairness criteria, thus the scheduling mechanisms should allocate enough bandwidth to each connection to achieve one of such fairness criteria. However, two fairness criteria (MCR plus equal share, maximum of MCR or Max-Min share) cannot be achieved by conventional scheduling mechanisms. In this letter, we have developed new scheduling mechanisms that achieve these fairness criteria. We also present simulation results to show that our mechanisms can allocate bandwidth fairly.},
keywords={},
doi={},
ISSN={},
month={June},}
Copy
TY - JOUR
TI - New Scheduling Mechanisms for Achieving Fairness Criteria (MCR Plus Equal Share, Maximum of MCR or Max-Min Share)
T2 - IEICE TRANSACTIONS on Communications
SP - 962
EP - 966
AU - Masayoshi NABESHIMA
AU - Naoaki YAMANAKA
PY - 1999
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E82-B
IS - 6
JA - IEICE TRANSACTIONS on Communications
Y1 - June 1999
AB - The ATM Forum specifies several fairness criteria, thus the scheduling mechanisms should allocate enough bandwidth to each connection to achieve one of such fairness criteria. However, two fairness criteria (MCR plus equal share, maximum of MCR or Max-Min share) cannot be achieved by conventional scheduling mechanisms. In this letter, we have developed new scheduling mechanisms that achieve these fairness criteria. We also present simulation results to show that our mechanisms can allocate bandwidth fairly.
ER -
English
