Scheduling file transfers under port and channel constraints

  • Shin-ichi Nakano
  • Takao Nishizeki
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 557)


The file transfer scheduling problem was introduced and studied by Coffman, Garey, Johnson and LaPaugh. The problem is to schedule transfers of a large collection of files between various nodes of a network under port constraint so as to minimize overall finishing time. This paper extends their model to include communication channel constraint in addition to port constraint. We formulate the problem with both port and channel constraints as a new type of edge-coloring of multigraphs, called an fg-edge-coloring, and give an efficient approximation algorithm with absolute worst-case ratio 3/2.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [CH]
    H. A. Choi, S. L. Hakimi, “Scheduling file transfers for trees and odd cycles,” SIAM J. on Comput., 16, pp. 162–168 (1987).Google Scholar
  2. [CG]
    E. G. Coffman, Jr, M. R. Garey, D. S. Johnson and A. S. LaPaugh: “Scheduling file transfers,” SIAM J. Comput, 14, 3, pp. 744–780 (1985).Google Scholar
  3. [GJ]
    M. R. Garey and D. S. Johnson: “Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., New York (1979).Google Scholar
  4. [G]
    M. K. Goldberg: “Edge-colorings of multigraphs: recoloring techniques,” Journal of Graph Theory, 8, 1, pp. 122–136 (1984).Google Scholar
  5. [H]
    S. L. Hakimi: “Further results on a generalization of edge-coloring,” in Graph Theory with Applications to Algorithms and Computer Science, ed. Y. Alavi et al., pp. 371–389, John Wiley & Sons, New York (1985).Google Scholar
  6. [HK]
    S. L. Hakimi and O. Kariv: “On a generalization of edge-coloring in graphs,” Journal of Graph Theory, 10, pp. 139–154 (1986).Google Scholar
  7. [HNS]
    D. S. Hochbaum, T. Nishizeki and D. B. Shmoys: “A better than “best possible” algorithm to edge color multigraphs,” Journal of Algorithms, 7, 1, pp. 79–104 (1986).Google Scholar
  8. [H]
    I. J. Holyer: “The NP-completeness of edge colourings,” SIAM J. Comput., 10, pp. 718–720 (1980).Google Scholar
  9. [NNS]
    S. Nakano, T. Nishizeki and N. Saito “On the f-coloring of multigraphs,” IEEE Trans., Circuit and Syst., CAS-35, 3, pp. 345–353 (1988).Google Scholar
  10. [NK]
    T. Nishizeki and K. Kashiwagi: “On the 1.1 edge-coloring of multigraphs,”, SIAM J. Disc. Math., 3, 3, (1990).Google Scholar
  11. [S]
    C. E. Shannon: “A theorem on coloring the lines of a network,” J. Math. Phys., 28, pp. 148–151 (1949).Google Scholar
  12. [V1]
    V. G. Vizing: “On an estimate of the chromatic class of a p-graph,” Discret Analiz, 3, pp. 25–30 (in Russian) (1964).Google Scholar
  13. [V2]
    V. G. Vizing: “The chromatic class of a multigraph,” Kibernetica(Kief), 3, pp. 29–39 (1965); Cybernatics, 3, pp. 32–41 (1965).Google Scholar
  14. [W]
    J. Whitehead “The complexity of file transfer scheduling with forwarding,” SIAM J. on Comput., 19, 2, pp. 222–245 (1990).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Shin-ichi Nakano
    • 1
  • Takao Nishizeki
    • 1
  1. 1.Department of Information Engineering Faculty of EngineeringTohoku UniversitySendai-shiJapan

Personalised recommendations