Skip to main content
Springer Nature Link
Log in

Real-Time Message Routing and Scheduling

  • Conference paper
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX 2009, RANDOM 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5687))

  • 1958 Accesses

Abstract

Exchanging messages between nodes of a network (e.g., embedded computers) is a fundamental issue in real-time systems involving critical routing and scheduling decisions. In order for messages to arrive on time, one has to determine a suitable (short) origin-destination path for each message and resolve conflicts between messages whose paths share a communication link of the network. We provide efficient routing strategies yielding origin-destination paths of bounded dilation and congestion. In particular, we can give good a priori guarantees on the time required to send a given set of messages which, under certain reasonable conditions, implies that all messages can be scheduled to reach their destination on time. Our algorithm uses a path-based LP-relaxation and iterative rounding. Finally, for message routing along a directed path (which is already \(\mathcal{NP}\)-hard), we identify a natural class of instances for which a simple scheduling heuristic yields provably optimal solutions.

This work was partially supported by Berlin Mathematical School, by DFG research center Matheon and by the DFG Focus Program 1307 within the project “Algorithm Engineering for Real-time Scheduling and Routing”.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Leung, J.Y.T., Tam, T.W., Wong, C.S., Young, G.H.: Routing messages with release time and deadline constraints. Journal of Parallel and Distributed Computing 31, 65–76 (1995)

    Article  Google Scholar 

  2. Leung, J.Y.T., Tam, T.W., Wong, C.S., Young, G.H.: Online routing of real-time messages. Journal of Parallel and Distributed Computing 34, 211–217 (1996)

    Article  Google Scholar 

  3. Leung, J.Y.-T.: Handbook of Scheduling: Algorithms, Models and Performance Analysis. Chapman and Hall/CRC, Boca Raton (2004)

    Google Scholar 

  4. Leighton, F.: Methods for message routing in parallel machines. In: Proceedings of the ACM Symposium on the Theory of Computing, pp. 77–96 (1992)

    Google Scholar 

  5. Hall, A., Hippler, S., Skutella, M.: Multicommodity flows over time: Efficient algorithms and complexity. Theoretical Computer Science 379, 387–404 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  6. Williamson, D.P., Hall, L.A., Hoogeveen, J.A., Hurkens, C.A.J., Lenstra, J.K., Sevast’janov, A.V., Shmoys, D.B.: Short shop schedules. Operations Research 45, 288–294 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  7. Feige, U., Scheideler, C.: Improved bounds for acyclic job shop scheduling. Combinatorica 3(22), 361–399 (2002)

    Article  MathSciNet  Google Scholar 

  8. Czumaj, A., Scheideler, C.: A new algorithmic approach to the general Lovász Local Lemma with applications to scheduling and satisfiability problems. In: Proc. of the thirty-second annual ACM symposium on Theory of computing, Portland, USA, pp. 38–47 (2000)

    Google Scholar 

  9. Leigthon, F.T., Maggs, B.M., Rao, S.B.: Packet routing and job shop scheduling in O(congestion+dilation) steps. Combinatorica 14, 167–186 (1994)

    Article  MathSciNet  Google Scholar 

  10. Leigthon, F.T., Maggs, B.M., Richa, A.: Fast algorithms for finding O(congestion+dilation) packet routing schedules. Combinatorica 19, 375–401 (1999)

    Article  MathSciNet  Google Scholar 

  11. Busch, C., Magdon-Ismail, M., Mavronicolas, M.: Universal bufferless packet switching. SIAM Journal on Computing 37, 1139–1162 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  12. Srinivasan, A., Teo, C.-P.: A constant-factor approximation algorithm for packet routing and balancing local vs. global criteria. SIAM Journal on Computing 30(6), 2051–2068 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  13. Fleischer, L., Skutella, M.: Quickest flows over time. SIAM Journal on Computing 36, 1600–1630 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  14. Garey, M.R., Johnson, D.S.: Computers and Intractability. W. H. Freeman and Co., New York (1979)

    MATH  Google Scholar 

  15. Grtschel, M., Lovsz, L., Schrijver, A.: The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1(2), 169–197 (1981)

    Article  MathSciNet  Google Scholar 

  16. Karp, R.M., Leigthon, F.T., Rivest, R.L., Thompson, C.D., Vazirani, U.V., Vazirani, V.V.: Global wire routing in two-dimensional arrays. Algorithmica 2, 113–129 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  17. Hassin, R.: Approximation schemes for the restricted shortest path problem. Math. Oper. Research 17, 36–42 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  18. Lorenz, D.H., Raz, D.: A simple efficient approximation scheme for the restricted shortest path problem. Oper. Res. Letters 28, 213–219 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  19. Phillips, C.A.: The network inhibition problem. In: Proc. of the 25th Annual ACM Symposium on the Theory of Computing, San Diego, CA, pp. 776–785 (1993)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Mathematik, TU Berlin, Straße des 17. Juni 136, 10623, Berlin, Germany

    Ronald Koch, Britta Peis, Martin Skutella & Andreas Wiese

Authors
  1. Ronald Koch
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Britta Peis
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Martin Skutella
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Andreas Wiese
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Applied Math and Computer Science, The Weizmann Institute of Science, 76100, Rehovot, Israel

    Irit Dinur

  2. Institute for Computer Science and Applied Mathematics, University of Kiel, Olshausenstr. 40, 24098, Kiel, Germany

    Klaus Jansen

  3. Technion, Computer Science Department, 32000, Haifa, Israel

    Joseph Naor

  4. University of Geneva, Centre Universitaire d’Informatique, Battelle Bat. A, 7 rte de Drize, 1227, Carouge, Switzerland

    José Rolim

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Koch, R., Peis, B., Skutella, M., Wiese, A. (2009). Real-Time Message Routing and Scheduling. In: Dinur, I., Jansen, K., Naor, J., Rolim, J. (eds) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. APPROX RANDOM 2009 2009. Lecture Notes in Computer Science, vol 5687. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03685-9_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-03685-9_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-03684-2

  • Online ISBN: 978-3-642-03685-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics