Survivability of time-varying networks
Thesis: S.M., Massachusetts Institute of Technology, Department of Aeronautics and Astronautics, 2015.
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Language: | eng |
| Published: |
Massachusetts Institute of Technology
2015
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1721.1/98694 |
| _version_ | 1811085666992259072 |
|---|---|
| author | Liang, Qingkai |
| author2 | Eytan Modiano. |
| author_facet | Eytan Modiano. Liang, Qingkai |
| author_sort | Liang, Qingkai |
| collection | MIT |
| description | Thesis: S.M., Massachusetts Institute of Technology, Department of Aeronautics and Astronautics, 2015. |
| first_indexed | 2024-09-23T13:13:22Z |
| format | Thesis |
| id | mit-1721.1/98694 |
| institution | Massachusetts Institute of Technology |
| language | eng |
| last_indexed | 2024-09-23T13:13:22Z |
| publishDate | 2015 |
| publisher | Massachusetts Institute of Technology |
| record_format | dspace |
| spelling | mit-1721.1/986942019-04-11T12:58:58Z Survivability of time-varying networks Liang, Qingkai Eytan Modiano. Massachusetts Institute of Technology. Department of Aeronautics and Astronautics. Massachusetts Institute of Technology. Department of Aeronautics and Astronautics. Aeronautics and Astronautics. Thesis: S.M., Massachusetts Institute of Technology, Department of Aeronautics and Astronautics, 2015. Cataloged from PDF version of thesis. Includes bibliographical references (pages 81-83). Time-varying graphs are a useful model for networks with dynamic connectivity such as mmWave networks and vehicular networks, yet, despite their great modeling power, many important features of time-varying graphs are still poorly understood. In this thesis, 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 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 timevarying networks. Then we analyze the complexity of computing the proposed metrics and develop several 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. by Qingkai Liang. S.M. 2015-09-17T19:05:23Z 2015-09-17T19:05:23Z 2015 2015 Thesis http://hdl.handle.net/1721.1/98694 920688303 eng M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission. http://dspace.mit.edu/handle/1721.1/7582 83 pages application/pdf Massachusetts Institute of Technology |
| spellingShingle | Aeronautics and Astronautics. Liang, Qingkai Survivability of time-varying networks |
| title | Survivability of time-varying networks |
| title_full | Survivability of time-varying networks |
| title_fullStr | Survivability of time-varying networks |
| title_full_unstemmed | Survivability of time-varying networks |
| title_short | Survivability of time-varying networks |
| title_sort | survivability of time varying networks |
| topic | Aeronautics and Astronautics. |
| url | http://hdl.handle.net/1721.1/98694 |
| work_keys_str_mv | AT liangqingkai survivabilityoftimevaryingnetworks |