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

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Proceedings of the 28th IEEE Conference on Decision and Control S. 2560 - 2566 vol.3
Hauptverfasser:	Cruz, R.L., Chuah, M.C.
Format:	Tagungsbericht
Sprache:	Englisch
Veröffentlicht:	IEEE 1989
Schlagworte:	Algorithm design and analysis Communication networks Communication system control Computer aided software engineering Context Delay effects Heuristic algorithms Routing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!