© 1987 by British Computer Society
Interval Routing
1 Department of Computer Science, University of Utrecht, P.O. Box 80.012, 3508 TA, Utrecht, Netherlands, 2 Department of Computer Science, University of Sciences and Arts of Oklahoma, Chickasha, OK 73018, USA
An interval routing scheme is a general method of routing messages in a distributive network using compact routing tables. In this paper, concepts related to optimal interval routing schemes are introduced and explored. Several problems concerning the insertion of nodes and joining of separate networks by a new link to form larger ones are considered. Various applications to distributed computing are given. In particular, leader-finding and generation of spanning trees in arbitrary networks are shown to require at most O(N+E) messages when a suitable interval routing scheme is available.
Received November 1985.
* Address: Department of Computer Science, Universityof Sciences and Arts of Oklahoma, Chihkasha, OK 73018, U.S.A.
Department of Computer Science, University of Utrecht, P.O. Box 80.012, 3508 TA, Utrecht, Netherlands
¶ This work was carried out while the second author visited the University of Utrecht, supported by a grant of the Netherlands Organization for the Advancement ofPure Research (ZWO).