By Topic

Priority scheduling algorithm for ATM wireless network access

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
$33 $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

4 Author(s)
J. Meierhofer ; Commun. Technol. Lab., Fed. Inst. of Technol., Zurich, Switzerland ; U. P. Bernhard ; P. Balmelli ; D. Bernasconi

This paper discusses medium access issues for wireless asynchronous transfer mode (ATM) networks. In particular, a priority scheduling algorithm for a centralized access scheme has been analyzed using the Markov chain theory and the OPNET simulation package. The scheduler allocates resources to the terminals according to their priority class. Different algorithms (first-come first-serve, round robin, select largest queue) are proposed for scheduling the ATM traffic within the same priority class. The performance measures are cell delay, queue length, and cell loss ratio (CLR). It turns out that the scheduler algorithm strongly influences the cell delay which is most important for delay sensitive services. The CLR due to buffer overflows can be kept very low in general except for very bursty sources

Published in:

Universal Personal Communications Record, 1997. Conference Record., 1997 IEEE 6th International Conference on

Date of Conference:

12-16 Oct 1997