By Topic

Universal stability results for low rate adversaries in packet switched 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

3 Author(s)
Echague, J. ; Univ. Jaume, Castello De La Plana, Spain ; Cholvi, V. ; Fernandez, A.

In this work, we consider a generalized version of the adversarial model and study the universal stability (stability in any network) of scheduling policies under low load rates. We show that any work-conserving policy is universally stable at any load rate r<(1/d), where d is the largest number of links crossed by any packet. We also show that system-wide time priority policies are universally stable at any load rate r<(1/(d-1)).

Published in:

Communications Letters, IEEE  (Volume:7 ,  Issue: 12 )