Achieving multipoint-to-multipoint fairness with RCNWA

Jung-Shian Li, Chuan Gang Liu, Cheng Y. Huang

Research output: Contribution to journalArticle

Abstract

In current Internet, applications employ lots of sessions with multiple connections between multiple senders and receivers. Sessions or users with more connections gain higher throughput. To obtain more network resource, applications tend to create more connections. It causes unfair bandwidth allocation by per-connection TCP rate allocation and the network suffers lots of TCP overheads. In this paper, we explore the issue on fair share allocation of bandwidth among sessions or users. Various fairness definitions are discussed in this study. Then, we propose a novel distributed scheme to achieve various fairness definitions. Simulation results show that our distributed scheme could achieve fair allocation according to each fairness definition.

Original languageEnglish
Pages (from-to)437-452
Number of pages16
JournalJournal of Systems Architecture
Volume53
Issue number7
DOIs
Publication statusPublished - 2007 Jul 1

Fingerprint

Frequency allocation
Throughput
Internet
Bandwidth

All Science Journal Classification (ASJC) codes

  • Hardware and Architecture
  • Software

Cite this

Li, Jung-Shian ; Liu, Chuan Gang ; Huang, Cheng Y. / Achieving multipoint-to-multipoint fairness with RCNWA. In: Journal of Systems Architecture. 2007 ; Vol. 53, No. 7. pp. 437-452.
@article{b9dbd354ddff4947a805ac72119684ba,
title = "Achieving multipoint-to-multipoint fairness with RCNWA",
abstract = "In current Internet, applications employ lots of sessions with multiple connections between multiple senders and receivers. Sessions or users with more connections gain higher throughput. To obtain more network resource, applications tend to create more connections. It causes unfair bandwidth allocation by per-connection TCP rate allocation and the network suffers lots of TCP overheads. In this paper, we explore the issue on fair share allocation of bandwidth among sessions or users. Various fairness definitions are discussed in this study. Then, we propose a novel distributed scheme to achieve various fairness definitions. Simulation results show that our distributed scheme could achieve fair allocation according to each fairness definition.",
author = "Jung-Shian Li and Liu, {Chuan Gang} and Huang, {Cheng Y.}",
year = "2007",
month = "7",
day = "1",
doi = "10.1016/j.sysarc.2006.12.003",
language = "English",
volume = "53",
pages = "437--452",
journal = "Journal of Systems Architecture",
issn = "1383-7621",
publisher = "Elsevier",
number = "7",

}

Achieving multipoint-to-multipoint fairness with RCNWA. / Li, Jung-Shian; Liu, Chuan Gang; Huang, Cheng Y.

In: Journal of Systems Architecture, Vol. 53, No. 7, 01.07.2007, p. 437-452.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Achieving multipoint-to-multipoint fairness with RCNWA

AU - Li, Jung-Shian

AU - Liu, Chuan Gang

AU - Huang, Cheng Y.

PY - 2007/7/1

Y1 - 2007/7/1

N2 - In current Internet, applications employ lots of sessions with multiple connections between multiple senders and receivers. Sessions or users with more connections gain higher throughput. To obtain more network resource, applications tend to create more connections. It causes unfair bandwidth allocation by per-connection TCP rate allocation and the network suffers lots of TCP overheads. In this paper, we explore the issue on fair share allocation of bandwidth among sessions or users. Various fairness definitions are discussed in this study. Then, we propose a novel distributed scheme to achieve various fairness definitions. Simulation results show that our distributed scheme could achieve fair allocation according to each fairness definition.

AB - In current Internet, applications employ lots of sessions with multiple connections between multiple senders and receivers. Sessions or users with more connections gain higher throughput. To obtain more network resource, applications tend to create more connections. It causes unfair bandwidth allocation by per-connection TCP rate allocation and the network suffers lots of TCP overheads. In this paper, we explore the issue on fair share allocation of bandwidth among sessions or users. Various fairness definitions are discussed in this study. Then, we propose a novel distributed scheme to achieve various fairness definitions. Simulation results show that our distributed scheme could achieve fair allocation according to each fairness definition.

UR - http://www.scopus.com/inward/record.url?scp=34248520664&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=34248520664&partnerID=8YFLogxK

U2 - 10.1016/j.sysarc.2006.12.003

DO - 10.1016/j.sysarc.2006.12.003

M3 - Article

VL - 53

SP - 437

EP - 452

JO - Journal of Systems Architecture

JF - Journal of Systems Architecture

SN - 1383-7621

IS - 7

ER -