Improved fairness algorithms for rings with spatial reuse

I. Cidon, L. Georgiadis, R. Guerin, Y. Shavitt

Research output: Contribution to journalConference articlepeer-review

Abstract

Ring network architectures that employ spatial reuse permit concurrent transmissions of messages over different links. While spatial reuse increases network throughput, it may also cause starvation of nodes. To alleviate this problem, various policies have been suggested in the literature. In this paper we concentrate on a class of such policies that achieve fairness by allocating transmission quotas to nodes. For such policies, we provide mechanisms for improving delays and increasing overall throughput without compromising fairness.

Original languageEnglish
Pages (from-to)1103-1111
Number of pages9
JournalProceedings - IEEE INFOCOM
Volume3
StatePublished - 1994
Externally publishedYes
EventProceedings of the IEEE INFOCOM'94. Part 2 (of 3) - Toronto, Ont, Can
Duration: 12 Jun 199416 Jun 1994

Fingerprint

Dive into the research topics of 'Improved fairness algorithms for rings with spatial reuse'. Together they form a unique fingerprint.

Cite this