Survivability in time-varying networks
Name
Modiano_Survivability in time.pdf
Size
1.02 MB
Format
Adobe PDF
Checksum (MD5)
2811ccf6fe23828fd8405cefc66bd213
Author(s)
Liang, Qingkai
Modiano, Eytan H
Date Issued
July 2016
Journal
IEEE INFOCOM 2016 -IEEE INFOCOM 2016, The 35th Annual IEEE International Conference on Computer Communications
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Liang, Qingkai and Modiano, Eytan. “Survivability in Time-Varying Networks.” IEEE INFOCOM 2016,The 35th Annual IEEE International Conference on Computer Communications, April 10-14 2016, San Francisco, California, Institute of Electrical and Electronics Engineers (IEEE), July 2016
Version
Original manuscript
Abstract
Time-varying graphs are a useful model for networks with dynamic connectivity such as vehicular networks, yet, despite their great modeling power, many important features of time-varying graphs are still poorly understood. In this paper, we study the survivability properties of time-varying networks against unpredictable interruptions. We first show that the traditional definition of survivability is not effective in time-varying networks, and propose a new survivability framework. To evaluate the survivability of time-varying networks under the new framework, we propose two metrics that are analogous to MaxFlow and MinCut in static networks. We show that some fundamental survivability-related results such as Menger's Theorem only conditionally hold in time-varying networks. Then we analyze the complexity of computing the proposed metrics and develop approximation algorithms. Finally, we conduct trace-driven simulations to demonstrate the application of our survivability framework in the robust design of a real-world bus communication network.
MIT Department
Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
Massachusetts Institute of Technology. Laboratory for Information and Decision Systems
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/INFOCOM.2016.7524490
