IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications 2016
DOI: 10.1109/infocom.2016.7524490
|View full text |Cite
|
Sign up to set email alerts
|

Survivability in time-varying networks

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 timevarying networks, and propose a new survivability framework. To evaluate the survivability… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
9
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
3
3
2

Relationship

0
8

Authors

Journals

citations
Cited by 14 publications
(9 citation statements)
references
References 34 publications
0
9
0
Order By: Relevance
“…We lift the algebraic methods for walk counting to counting temporal walks by means of the directed line graph expansion. Variants of directed line graph expansions have been previously used for survivability and reliability analysis [21,26], and for graph kernels [36]. These variants support only strict temporal walks.…”
Section: Directed Line Graph Expansionmentioning
confidence: 99%
“…We lift the algebraic methods for walk counting to counting temporal walks by means of the directed line graph expansion. Variants of directed line graph expansions have been previously used for survivability and reliability analysis [21,26], and for graph kernels [36]. These variants support only strict temporal walks.…”
Section: Directed Line Graph Expansionmentioning
confidence: 99%
“…Temporal graphs are well-established in the literature and are also referred to as time-varying [29] and evolving [17] graphs, temporal networks [26,27,32], link streams [28,38], multidimensional G 1 :…”
Section: Introductionmentioning
confidence: 99%
“…On the other hand, a growing number of positive results has been developed in recent years for various problems in temporal graphs [1,4,6,7,9,12].…”
Section: Introductionmentioning
confidence: 99%