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
Externally publishedYes

Fingerprint

Scheduling
Bandwidth
Automatic teller machines

Keywords

  • Bandwidth allocation
  • Fairness criteria
  • Scheduling mechanism

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Networks and Communications

Cite this

New scheduling mechanisms for achieving fairness criteria (MCR plus equal share, maximum of MCR or Max-Min share). / Nabeshima, Masayoshi; Yamanaka, Naoaki.

In: IEICE Transactions on Communications, Vol. E82-B, No. 6, 1999, p. 962-966.

Research output: Contribution to journalArticle

@article{f977fb0236ea4e179efa70db976a1164,
title = "New scheduling mechanisms for achieving fairness criteria (MCR plus equal share, maximum of MCR or Max-Min share)",
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 = "Bandwidth allocation, Fairness criteria, Scheduling mechanism",
author = "Masayoshi Nabeshima and Naoaki Yamanaka",
year = "1999",
language = "English",
volume = "E82-B",
pages = "962--966",
journal = "IEICE Transactions on Communications",
issn = "0916-8516",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "6",

}

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

Y1 - 1999

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

VL - E82-B

SP - 962

EP - 966

JO - IEICE Transactions on Communications

JF - IEICE Transactions on Communications

SN - 0916-8516

IS - 6

ER -