A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Traffic-light scheduling on the grid
[chapter]
1992
Lecture Notes in Computer Science
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-fight" type schedules for route scheduling on
doi:10.1007/3-540-56188-9_16
fatcat:5wk3gevmivggzp2qcvxz4bm6qu