Title :
Worst case analysis of a simple routing problem
Author :
Cruz, R.L. ; Chuah, M.C.
Author_Institution :
Dept. of Electr. & Comput. Eng., California Univ., San Diego, CA, USA
Abstract :
A simple routing problem in which there are two service stations is considered. Subject to burstiness constraints on the arrival of work, a study is made of the worst-case delay performance of dynamic routing algorithms. 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 hand, it is shown that under a heavy loading condition, the RTS is not optimal. The performance of RTS routing is compared with that of fixed routing, and other heuristic dynamic routing rules are considered
Keywords :
minimisation; queueing theory; telecommunication networks; burstiness constraints; dynamic routing algorithms; fixed routing; heuristic routing; route to shortest rule; worst-case delay performance; Algorithm design and analysis; Communication networks; Communication system control; Computer aided software engineering; Context; Delay effects; Heuristic algorithms; Routing;
Conference_Titel :
Decision and Control, 1989., Proceedings of the 28th IEEE Conference on
Conference_Location :
Tampa, FL
DOI :
10.1109/CDC.1989.70639
