New Scheduling Mechanisms for Achieving Fairness Criteria (MCR Plus Equal Share, Maximum of MCR or Max-Min Share)

Masayoshi NABESHIMA  Naoaki YAMANAKA  

Publication
IEICE TRANSACTIONS on Communications   Vol.E82-B   No.6   pp.962-966
Publication Date: 1999/06/25
Online ISSN: 
DOI: 
Print ISSN: 0916-8516
Type of Manuscript: LETTER
Category: Switching and Communication Processing
Keyword: 
scheduling mechanism,  fairness criteria,  bandwidth allocation,  

Full Text: PDF(509KB)
>>Buy this Article


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.