A SAT-based network access scheme for fairness in high speed networks

Author

Bellur, Bhargav R. ; Sasaki, Galen H.

Author_Institution

Dept. of Electr. & Comput. Eng., Texas Univ., Austin, TX, USA

Volume

5

Issue

3

fYear

1997

fDate

6/1/1997 12:00:00 AM

Firstpage

371

Lastpage

381

Abstract

This paper presents a fair network access scheme called MultiSAT which can be seen as a generalization of two access schemes proposed by Ofek and Yung (see IEEE/ACM Trans. Networking, vol.3, no.4, p.169-80, 1995) and Ngai and Seitz (1989). An upper bound on the delay before a node can inject a packet into the network is given which is valid when packet routes have no cyclic dependencies, backpressure flow control is used, and the processing and propagation delays are negligible. Upper bounds on packet injection delay are also given for ring networks employing shortest path routing for the case of negligible processing and propagation delays, and for the case of the MetaRing network when link propagation delays are significant

Keywords

computer networks; delays; network topology; packet switching; performance evaluation; telecommunication congestion control; telecommunication network routing; MetaRing network; MultiSAT; SAT based network access; backpressure flow control; fair network acces; fairness; high speed networks; link propagation delays; multicomputer network; network performance; packet injection delay; packet routes; processing delay; propagation delay; ring networks; shortest path routing; upper bounds; Associate members; Distributed algorithms; High-speed networks; Intelligent networks; Network topology; Propagation delay; Proposals; Routing; Switches; Upper bound;

fLanguage

English

Journal_Title

Networking, IEEE/ACM Transactions on

Publisher

ieee

ISSN

1063-6692

Type

jour

DOI

10.1109/90.611102

Filename

611102