Skip to main content
SpringerLink
Log in

Minimum-delay schedules in layered networks

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

In this paper, we consider the following problem: given a layered network including a set of messages, each of which must be transmitted from a source to a sink node, what is the sequence of moves from one node to another which minimizes the total completion time? We first show that the general problem is NP-complete for both fixed and variable path routing (thus the scheduling problem for more realistic networks with cycles must be considered computationally intractable). We then consider several restrictions which admit polynomia time algorithms.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Blazewicz, J.: Selected topics in scheduling theory. Ann. Discr. Math.31, 1–60 (1987)

    Google Scholar 

  2. Coffman, E.G. Jr. (ed.): Computer & job/Shop scheduling theory. New York: Wiley 1976

    Google Scholar 

  3. Coffman, E.G. Jr., Garey, M.R., Johnson, D.S., Lapaugh, A.S.: Scheduling File Transfers. SIAM J. Comput.14 (3), 744–780 (1985)

    Google Scholar 

  4. Garey, M.R., Johnson, D.S.: Computers and intractability: A guide to the theory of NP-completeness. San Francisco: Freeman 1979

    Google Scholar 

  5. Gerla, M., Kleinrock, L.: Flow control: A comparative survey. IEEE Trans. Commun.28(4), 553–574 (1980)

    Google Scholar 

  6. Petreschi, R., Simeone, B.: A switching algorithm for the solution of quadratic Boolean equations. Info. Process. Lett.11 (4), 193–198 (1980)

    Google Scholar 

  7. Tannenbaum, A.S.: Computer networks. New Jersey: Prentice-Hall 1981

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Rome “La Sapienza”, Piazzale Aldo Moro 2, I-00185, Rome, Italy

    Daniel P. Bovet

  2. Department of Mathematics, University of L'Aquila, Via Vetoio, I-67010, Coppito, L'Aquila, Italy

    Pierluigi Crescenzi

Authors
  1. Daniel P. Bovet
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pierluigi Crescenzi
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Most of this work was done while this author was at the Department of Mathematics, University of Rome “La Sapienza”

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bovet, D.P., Crescenzi, P. Minimum-delay schedules in layered networks. Acta Informatica 28, 453–461 (1991). https://doi.org/10.1007/BF01178583

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01178583

Keywords

Search

Navigation