By Topic

End-to-end delay guarantees for multiple-channel schedulers

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)
Cobb, J.A. ; Dept. of Comput. Sci., Texas Univ. at Dallas, Richardson, TX, USA ; Miaohua Lin

Consider a network in which adjacent nodes exchange messages via multiple communication channels. Multiple channels between adjacent nodes are desirable due to their cost effectiveness and improved fault-tolerance. We consider the problem of providing deterministic quality of service guarantees in this network. We show that any scheduling protocol designed for a single channel can be converted into a multiple-channel scheduling protocol without significantly increasing the delay at the scheduling node. However, because there are multiple channels between adjacent nodes, the packets of a flow may be reordered. This in turn significantly increases the upper bound on the end-to-end delay of the flow. We show how this increase in delay can be avoided through the use of efficient sorting techniques.

Published in:

Quality of Service, 2002. Tenth IEEE International Workshop on

Date of Conference:

2002