On-line routing of real-time messages

Joseph Y.T. Leung, Tommy W. Tam, Gilbert H. Young

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Whether it is possible to have an optimal online algorithm for unidirectional ring, out-tree, in-tree, bidirectional tree, and bidirectional ring networks is discussed. The problem is considered under various restrictions of four parameters--origin node, destination node, release time and deadline. For unidirectional ring, it is shown that no such algorithm can exist unless one of the four parameters is fixed. For out-tree, it is shown that no such algorithm can exist unless one of three parameters--origin node, destination node and release time--is fixed. For in-tree, it is shown that no such algorithm can exist unless one of three parameters--origin node, destination node and deadline--is fixed. For bidirectional tree, it is shown that no such algorithm can exist unless the origin node or the destination node is fixed. For bidirectional ring, it is shown that no such algorithm can exist unless the origin node and either the destination node or the release time are fixed.

Original languageEnglish (US)
Title of host publication90 Real-Time Syst. Symp.
PublisherPubl by IEEE
Pages126-135
Number of pages10
ISBN (Print)0818621125
StatePublished - Oct 1991
EventProceedings of the 11th Real-Time Systems Symposium - Lake Buena Vista, FL, USA
Duration: Dec 5 1990Dec 7 1990

Publication series

NameProceedings - Real-Time Systems Symposium

Other

OtherProceedings of the 11th Real-Time Systems Symposium
CityLake Buena Vista, FL, USA
Period12/5/9012/7/90

All Science Journal Classification (ASJC) codes

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Cite this