Skip Navigation

The Computer Journal 1991 34(5):475-476; doi:10.1093/comjnl/34.5.475
© 1991 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (13)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Ruzicka, P.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Short Note

A Note on the Efficiency of an Interval Routing Algorithm

P. Ruzicka *

VUSEI-AR, Dubravska 3, 842 21 Bratislava, Czechoslovakia

An interval routing algorithm for general networks has been proposed separately by Santoro and Khatib and van Leeuwen and Tan. It works optimally for various regular networks, and for the non-regular case it never chooses a route longer than twice the diameter of the network. Van Leeuwen and Tan posed the fundamental question whether there is an optimal interval routing algorithm for any arbitrary network. In this paper we prove the lower-bound result that for certain networks the interval routing algorithm chooses a route which is half as long as the diameter of this network. This answers the question in a negative way.

Received July 1989. revised February 1990.

* VUSEI-AR, Dúbravská 3, 842 21 Bratislava, Czechoslovakia


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.