The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
ATM 포럼은 몇 가지 공정성 기준을 지정하므로 스케줄링 메커니즘은 이러한 공정성 기준 중 하나를 달성하기 위해 각 연결에 충분한 대역폭을 할당해야 합니다. 그러나 두 가지 공정성 기준(MCR + 균등 공유, 최대 MCR 또는 Max-Min 공유)은 기존 스케줄링 메커니즘으로는 달성할 수 없습니다. 이 편지에서 우리는 이러한 공정성 기준을 달성하는 새로운 일정 메커니즘을 개발했습니다. 또한 우리의 메커니즘이 대역폭을 공정하게 할당할 수 있음을 보여주기 위해 시뮬레이션 결과를 제시합니다.
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.
부
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
부
@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},}
부
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 -