TY - GEN
T1 - On-line routing of real-time messages
AU - Leung, Joseph Y.T.
AU - Tam, Tommy W.
AU - Young, Gilbert H.
N1 - Funding Information:
1Research supported in part by ONR Grant N00014-87-K-0833 and in part by a grant from Texas Instruments, Inc.
Funding Information:
2Research supported by CUHK Grant 220500610. Gilbert Young is with Department of Computer Science & Engineering, the Chinese University of Hong Kong, Shatin, Hong Kong.
PY - 1991/10
Y1 - 1991/10
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=0026238465&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0026238465&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:0026238465
SN - 0818621125
T3 - Proceedings - Real-Time Systems Symposium
SP - 126
EP - 135
BT - 90 Real-Time Syst. Symp.
PB - Publ by IEEE
T2 - Proceedings of the 11th Real-Time Systems Symposium
Y2 - 5 December 1990 through 7 December 1990
ER -