By Topic

A distributed scheduling algorithm for quality of service support in multiaccess 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.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Barrack, C. ; Vertex Networks, Irvine, CA, USA ; Siu, K.-Y.

This paper presents a distributed scheduling algorithm for the support of QoS in multiaccess networks. Unlike most contention-based multiaccess protocols which offer no QoS guarantee and suffer the problems of fairness and low throughput at high load, our algorithm provides fairness and bandwidth reservation in an integrated services environment and at the same time achieves high throughput. Moreover, while most reservation-based multiaccess protocols require a centralized scheduler and a separate channel for arbitration, our algorithm is truly distributed in the sense that network nodes coordinate their transmissions only via headers in the packets. We derive theoretical bounds illustrating how our distributed algorithm approximates the optimal centralized algorithm. Simulation results are also presented to justify our claims.

Published in:

Network Protocols, 1999. (ICNP '99) Proceedings. Seventh International Conference on

Date of Conference:

31 Oct.-3 Nov. 1999