Skip to main content
SpringerLink
Log in

Robust Routing Made Easy

  • Conference paper
  • First Online:
Stabilization, Safety, and Security of Distributed Systems (SSS 2017)

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

Abstract

Designing routing schemes is a multidimensional and complex task that depends on the objective function, the computational model (centralized vs. distributed), and the amount of uncertainty (online vs. offline). We showcase simple and generic transformations that can be used as a blackbox to increase resilience against (independently distributed) faults. Given a network and a routing scheme, we determine a reinforced network and corresponding routing scheme that faithfully preserves the specification and behavior of the original scheme. We show that reasonably small constant overheads in terms of size of the new network compared to the old one are sufficient for substantially relaxing the reliability requirements on individual components. The main message in this paper is that the task of designing a robust routing scheme can be decoupled into (i) designing a routing scheme that meets the specification in a fault-free environment, (ii) ensuring that nodes correspond to fault-containment regions, i.e., fail (approximately) independently, and (iii) applying our transformation to obtain a reinforced network and a robust routing scheme that is fault-tolerant.

The full version of this extended abstract can be found in https://arxiv.org/abs/1705.04042.

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

Notes

  1. 1.

    Choosing concreteness over generality, we focus on the, in our view, most interesting case of constant \(\ell \). It is straightforward to generalize the analysis.

References

  1. Aiello, W., Kushilevitz, E., Ostrovsky, R., Rosén, A.: Dynamic routing on networks with fixed-size buffers. In: SODA, pp. 771–780 (2003)

    Google Scholar 

  2. Alon, N., Seymour, P., Thomas, R.: A separator theorem for graphs with an excluded minor and its applications. In: STOC, pp. 293–299. ACM (1990)

    Google Scholar 

  3. Angelov, S., Khanna, S., Kunal, K.: The network as a storage device: dynamic routing with bounded buffers. Algorithmica 55(1), 71–94 (2009)

    Article  MathSciNet  Google Scholar 

  4. Cho, H., Leem, L., Mitra, S.: ERSA: error resilient system architecture for probabilistic applications. Trans. Comput.-Aided Des. Integr. Circ. Syst. 31(4), 546–558 (2012)

    Article  Google Scholar 

  5. Dolev, D., Hoch, E.N.: Constant-space localized byzantine consensus. In: Taubenfeld, G. (ed.) DISC 2008. LNCS, vol. 5218, pp. 167–181. Springer, Heidelberg (2008). doi:10.1007/978-3-540-87779-0_12

    Chapter  Google Scholar 

  6. Even, G., Medina, M., Patt-Shamir, B.: Better deterministic online packet routing on grids. In: SPAA, pp. 284–293 (2015)

    Google Scholar 

  7. Even, G., Medina, M., Rosén, A.: A constant approximation algorithm for scheduling packets on line networks. In: ESA, pp. 40:1–40:16 (2016)

    Google Scholar 

  8. Fischer, M., Lynch, N., Paterson, N.: Impossibility of distributed consensus with one faulty process. J. ACM 32(2), 374–382 (1985)

    Article  MathSciNet  Google Scholar 

  9. Kang, Y.H., Kwon, T., Draper, J.: Fault-tolerant flow control in on-chip networks. In: NOCS, pp. 79–86 (2010)

    Google Scholar 

  10. Kopetz, H.: Fault containment and error detection in the time-triggered architecture. In: ISADS, pp. 139–146 (2003)

    Google Scholar 

  11. Levi, R., Ron, D.: A quasi-polynomial time partition oracle for graphs with an excluded minor. ACM Trans. Algorithms 11(3), 24:1–24:13 (2015)

    Article  MathSciNet  Google Scholar 

  12. Park, D., Nicopoulos, C., Kim, J., Vijaykrishnan, N., Das, C.R.: Exploring fault-tolerant network-on-chip architectures. In: DSN, pp. 93–104 (2006)

    Google Scholar 

  13. Pelc, A., Peleg, D.: Broadcasting with locally bounded byzantine faults. Inf. Process. Lett. 93(3), 109–115 (2005)

    Article  MathSciNet  Google Scholar 

  14. Räcke, H.: Survey on oblivious routing strategies. In: Ambos-Spies, K., Löwe, B., Merkle, W. (eds.) CiE 2009. LNCS, vol. 5635, pp. 419–429. Springer, Heidelberg (2009). doi:10.1007/978-3-642-03073-4_43

    Chapter  Google Scholar 

  15. Räcke, H., Rosén, A.: Approximation algorithms for time-constrained scheduling on line networks. Theory Comput. Syst. 49(4), 834–856 (2011)

    Article  MathSciNet  Google Scholar 

  16. Rotem-Gal-Oz, A.: Fallacies of Distributed Computing Explained. http://www.rgoarchitects.com/Files/fallacies.pdf

Download references

Author information

Authors and Affiliations

  1. MPII, Saarland Informatics Campus, Saarbrücken, Germany

    Christoph Lenzen & Moti Medina

Authors
  1. Christoph Lenzen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Moti Medina
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Moti Medina .

Editor information

Editors and Affiliations

  1. University of Liverpool, Liverpool, United Kingdom

    Paul Spirakis

  2. Chalmers University of Technology, Gothenburg, Sweden

    Philippas Tsigas

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Lenzen, C., Medina, M. (2017). Robust Routing Made Easy. In: Spirakis, P., Tsigas, P. (eds) Stabilization, Safety, and Security of Distributed Systems. SSS 2017. Lecture Notes in Computer Science(), vol 10616. Springer, Cham. https://doi.org/10.1007/978-3-319-69084-1_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-69084-1_13

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-69083-4

  • Online ISBN: 978-3-319-69084-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation