TY - JOUR
T1 - New scheduling mechanisms for achieving fairness criteria (MCR plus equal share, maximum of MCR or Max-Min share)
AU - Nabeshima, Masayoshi
AU - Yamanaka, Naoaki
PY - 1999/1/1
Y1 - 1999/1/1
N2 - 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.
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.
KW - Bandwidth allocation
KW - Fairness criteria
KW - Scheduling mechanism
UR - http://www.scopus.com/inward/record.url?scp=0032659027&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0032659027&partnerID=8YFLogxK
M3 - Article
AN - SCOPUS:0032659027
SN - 0916-8516
VL - E82-B
SP - 962
EP - 966
JO - IEICE Transactions on Communications
JF - IEICE Transactions on Communications
IS - 6
ER -