Improved fairness algorithms for rings with spatial reuse

Author

Cidon, Israel ; Georgiadis, Leonidas ; Guerin, Roch ; Shavitt, Yuvd

Author_Institution

Dept. of Electr. Eng., Technion-Israel Inst. of Technol., Haifa, Israel

Volume

5

Issue

2

fYear

1997

fDate

4/1/1997 12:00:00 AM

Firstpage

190

Lastpage

204

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 achieves fairness by allocating transmission quotas to nodes. For such policies, we provide mechanisms for improving delays and increasing overall throughput without compromising fairness

Keywords

channel capacity; delays; local area networks; metropolitan area networks; network topology; token networks; LAN; MAN; buffer insertion; buffer insertion ring; concurrent transmissions of messages; delays; fairness algorithms; mechanisms; network throughput; ring network architectures; rings; slotted rings; spatial reuse; starvation of nodes; transmission quotas allocation; Access control; Availability; Buffer storage; Computer science; Helium; Propagation delay; Proposals; Throughput;

fLanguage

English

Journal_Title

Networking, IEEE/ACM Transactions on

Publisher

ieee

ISSN

1063-6692

Type

jour

DOI

10.1109/90.588080

Filename

588080