Worst case analysis of a simple routing problem

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-short...

Full description

Saved in:
Bibliographic Details
Published in:Proceedings of the 28th IEEE Conference on Decision and Control pp. 2560 - 2566 vol.3
Main Authors: Cruz, R.L., Chuah, M.C.
Format: Conference Proceeding
Language:English
Published: IEEE 1989
Subjects:
Algorithm design and analysis
Communication networks
Communication system control
Computer aided software engineering
Context
Delay effects
Heuristic algorithms
Routing
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.< >
DOI:10.1109/CDC.1989.70639