Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
2 Author(s)
Bellur, B.R. ; Dept. of Electr. & Comput. Eng., Texas Univ., Austin, TX, USA ; Sasaki, G.H.

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

Published in:

Networking, IEEE/ACM Transactions on  (Volume:5 ,  Issue: 3 )