Abstract
This paper studies the problem of route scheduling under the telephone model of communication networks. Previous work in this model considered mostly the “broadcast” and “gossip” communication primitives. The approach studied here is that of devising simple, distributed universal schedules, that are efficient for wide families of routing instances, rather than attempting to solve individual instances separately. The paper concentrates on “traffic-light” type schedules for route scheduling on the two-dimensional grid.
In order to study the problem of scheduling given route instances, routes are classified according to the number of directions they use, and tight bounds are given on the time required for scheduling route instances in each class. For routes of length d or less, using only one direction, scheduling is shown to require d+O(1) time. For simple routes using only two or three directions, scheduling is shown to require 2d + 3 and 2d + 4 time, respectively. Finally, for arbitrary simple routes scheduling is shown to require 2d + ⊗(⇏d) time.
Supported in part by a Walter and Elise Haas Career Development Award and by a grant from the Israeli Basic Research Foundation.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
A.M. Farley and A. Proskurowski. Gossiping in grid graphs. Journal of Combinatorics information and system science, 15:161–162, 1980.
S. Hedetniemi, S. Hecletniemi, and A. Liestman. A survey of gossiping and broadcasting in communication networks. Networks, 18:319–349, 1988.
G. Kortsarz. Telephone routing. M.Sc. Thesis, 1990.
G. Kortsarz and D. Peleg. Traffic-light scheduling on the grid. Discrete Applied Mathematics, 1992. To appear.
A.L. Liestman and D. Richards. Network communication in edge-colored graphs. Unpublished Manuscript, 1991.
P.J. Slater, E.J. Cockayne, and T. Hedetniemi. Information dissemination in trees. SIAM J. on Comput., 10, 1981.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kortsarz, G., Peleg, D. (1992). Traffic-light scheduling on the grid. In: Segall, A., Zaks, S. (eds) Distributed Algorithms. WDAG 1992. Lecture Notes in Computer Science, vol 647. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56188-9_16
Download citation
DOI: https://doi.org/10.1007/3-540-56188-9_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56188-0
Online ISBN: 978-3-540-47484-5
eBook Packages: Springer Book Archive