Network Survivability: End-to-End Recovery Using Local Failure Information

José L. Marzo, Thomas Riis Stidsen, Sarah Renée Ruepp, Eusebi Calle, Janos Tapolcai, Juan Segovia

Research output: Chapter in Book/Report/Conference proceedingBook chapterResearchpeer-review


Algorithmic discrete mathematics plays a key role in the development of information and communication technologies, and methods that arise in computer science, mathematics and operations research – in particular in algorithms, computational complexity, distributed computing and optimization – are vital to modern services such as mobile telephony, online banking and VoIP. This book examines communication networking from a mathematical viewpoint. The contributing authors took part in the European COST action 293 – a four-year program of multidisciplinary research on this subject. In this book they offer introductory overviews and state-of-the-art assessments of current and future research in the fields of broadband, optical, wireless and ad hoc networks. Particular topics of interest are design, optimization, robustness and energy consumption. The book will be of interest to graduate students, researchers and practitioners in the areas of networking, theoretical computer science, operations research, distributed computing and mathematics.
Original languageEnglish
Title of host publicationGraphs and Algorithms in Communication Networks : Studies in Broadband, Optical, Wireless and Ad Hoc Networks
EditorsArie Koster, Xavier Muñoz
Number of pages426
Publication date2010
ISBN (Print)978-3-642-02249-4
Publication statusPublished - 2010
SeriesTexts in Theoretical Computer Science. An EATCS Series


  • Sensor networks
  • Distributed algorithms
  • Broadband networks
  • Communication networks
  • Wireless networks
  • Network design
  • Network optimization
  • Ad hoc networks
  • Telecommunication networks
  • Operations research
  • Network energy consumption
  • Discrete algorithms
  • Network robustness
  • Optical networks
  • Distributed computing

Cite this