2020
DOI: 10.1109/tnet.2020.3030819
|View full text |Cite
|
Sign up to set email alerts
|

Maximizing k-Terminal Network Reliability in Some Sparse Graphs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 10 publications
(2 citation statements)
references
References 25 publications
0
2
0
Order By: Relevance
“…Traditionally, the literature on networked data systems has focused on maximizing link-level reliability to ensure the best possible service for connected devices (see references [7], [8], and [9]). Most research on network-wide reliability has consisted of evaluating graphbased connectivity metrics in light of possible failures that may occur in the network (e.g., k-terminal network reliability, as described in reference [10]). However, there has recently been a shift towards strict network-level reliability that takes into account user data traffic demand, particularly for nextgeneration cellular networks.…”
Section: Introductionmentioning
confidence: 99%
“…Traditionally, the literature on networked data systems has focused on maximizing link-level reliability to ensure the best possible service for connected devices (see references [7], [8], and [9]). Most research on network-wide reliability has consisted of evaluating graphbased connectivity metrics in light of possible failures that may occur in the network (e.g., k-terminal network reliability, as described in reference [10]). However, there has recently been a shift towards strict network-level reliability that takes into account user data traffic demand, particularly for nextgeneration cellular networks.…”
Section: Introductionmentioning
confidence: 99%
“…For example, Horner and Widener [34] simulated the failure of partial road network and test how these damages affect the victims' access to relief goods. Zhang et al [35] studied the optimal distribution of k terminal vertices to maximize k terminal network reliability in sparse graphs, in which the edges are subject to failure. In these studies which consider edge failure, many authors assume that the network links have homogeneous or heterogeneous failure probabilities and this kind of assumptions implies that the interruption of the link is caused by its own failure [36].…”
Section: Introductionmentioning
confidence: 99%