A minimax approach to a simple routing problem

Author

Cruz, Rene L. ; Chuah, M.C.

Author_Institution

Dept. of Electr. & Comput. Eng., California Univ., San Diego, La Jolla, CA, USA

Volume

36

Issue

12

fYear

1991

fDate

12/1/1991 12:00:00 AM

Firstpage

1424

Lastpage

1435

Abstract

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

Keywords

minimax techniques; queueing theory; average backlogs; burstiness constraints; dynamic routing algorithms; fixed routing; heavy load condition; light loading condition; minimax approach; queueing theory; route-to-shortest rule; routing problem; worst-case delay performance; Delay; Heuristic algorithms; Minimax techniques; Particle measurements; Routing; Time measurement;

fLanguage

English

Journal_Title

Automatic Control, IEEE Transactions on

Publisher

ieee

ISSN

0018-9286

Type

jour

DOI

10.1109/9.106158

Filename

106158