By Topic

A minimax approach to a simple routing problem

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)
Cruz, R.L. ; Dept. of Electr. & Comput. Eng., California Univ., San Diego, La Jolla, CA, USA ; Chuah, M.C.

A simple routing problem is considered in which there are two service stations. Subject to burstiness constraints on the arrival of work, the worst-case delay performance of dynamic routing algorithms is studied. Under a light loading condition, it is found that the well-known `route-to-shortest' (RTS) rule is optimal in some sense. On the other, it is shown that under a heavy load condition, the RTS rule is not optimal. In addition, the performance of RTS routing is compared with fixed routing. Finally, the burstiness constraints are relaxed to obtain a result which bounds the average backlogs in the stations for the RTS rule under light loading

Published in:

Automatic Control, IEEE Transactions on  (Volume:36 ,  Issue: 12 )