New scheduling mechanisms for achieving fairness criteria (MCR plus equal share, maximum of MCR or Max-Min share)

Masayoshi Nabeshima, Naoaki Yamanaka

Research output: Contribution to journalArticle

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.

Original languageEnglish
Pages (from-to)962-966
Number of pages5
JournalIEICE Transactions on Communications
VolumeE82-B
Issue number6
Publication statusPublished - 1999 Jan 1
Externally publishedYes

Keywords

  • Bandwidth allocation
  • Fairness criteria
  • Scheduling mechanism

ASJC Scopus subject areas

  • Software
  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'New scheduling mechanisms for achieving fairness criteria (MCR plus equal share, maximum of MCR or Max-Min share)'. Together they form a unique fingerprint.

  • Cite this