Elsevier

Journal of Algorithms

Volume 6, Issue 3, September 1985, Pages 409-429
Journal of Algorithms

Scheduling transmissions in a network

https://doi.org/10.1016/0196-6774(85)90010-0Get rights and content

Abstract

Consider k stations wishing to transmit messages over a network of channels to a common receiver. The capacity of a channel is the maximum amount of data which can be transmitted in a time unit. In addition to the transmission stations, the network contains switching nodes. Given that the jth station has σj messages (j = 1,…, k) to transmit, it is desired to find a schedule with minimum completion time T. The amount of data sent over a channel may vary in time. A schedule is stationary if the amount of data sent in a time unit is constant throughout the schedule. It is first shown that for every schedule there exists a stationary schedule with the same completion time. Thus, the search for an optimum schedule is confined to stationary schedules. The problem of finding an optimum stationary schedule is formulated as a multisource single-sink network flow problem, in which the net amount of outgoing flow from each source (transmission station) within one time unit is σjT. An O(k|E||V|2) time algorithm to find the minimum T similar to Dinic's flow algorithm is suggested. Using Sleator and Tarjan's techniques an O(k2|E||V|log|V|) algorithm is derived. The running time of both algorithms is independent of the σj's and the capacities.

References (10)

  • Z Galil et al.

    An O(EV log2V) algorithm for the maximal flow problem

    J. Comput. System Sci.

    (1980)
  • A Aho et al.

    The Design and Analysis of Computer Algorithms

    (1974)
  • E.A Dinic

    Algorithm for solution of a problem of maximum flow in a network with power estimation

    Soviet Math. Dokl.

    (1970)
  • S Even

    Graph Algorithms

    (1979)
  • J Edmonds et al.

    Theoretical improvements in algorithm efficiency for network flow problems

    J. Assoc. Comput. Mach

    (1972)
There are more references available in the full text version of this article.

Cited by (0)

View full text