By Topic

A deadline and minimal overhead scheduling algorithm for the WiMax logical scheduler (invited paper)

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

1 Author(s)
Mandelbrod, M. ; Runcom Technol. Ltd., Rishon Lezion, Israel

We present an algorithm for scheduling of packets according to deadline. The algorithm minimizes the total long-run overhead by clustering packets from the same Connection, under the constraint of minimal packet lost. We specify the core algorithm, as well as a number of additional requirements. We outline possible ways of integrating these requirements into the core algorithm. We present some statistical results derived from simulations, and compare the performance of the proposed algorithm to a standard EDF algorithm. We conclude by describing future issues pertaining to the scheduling problem.

Published in:

Wireless Conference (EW), 2010 European

Date of Conference:

12-15 April 2010