Name
Title | ||
|---|---|---|
On Composing A Resilient Tree In A Network With Intermittent Links Based On Stress Centrality |
Abstract | ||
|---|---|---|
This paper discusses a composition problem of a resilient tree on a graph modeling a communication network whose links are intermittent. The resiliency of a tree is defined exploiting the binary relation on two kinds of edge weights: availability and commonality. Availability represents a probabilistic stability of a communication link corresponding to an edge, and commonality indicates the influence of an edge based on relative locations of edges on a tree. Our simulation analyzes that the trees satisfying the proposed ordering property on the binary relation provide more stable connections among communication nodes. |
Year | Venue | Keywords |
|---|---|---|
2016 | 2016 IEEE SYMPOSIUM ON COMPUTERS AND COMMUNICATION (ISCC) | tree, reliability, ordered set, graph theory |
Field | DocType | Citations |
Graph theory,Tree traversal,Telecommunications network,Computer science,Binary relation,Tree (data structure),Centrality,Theoretical computer science,Network topology,Hypertree network | Conference | 0 |
PageRank | References | Authors |
0.34 | 4 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Genya Ishigaki | 1 | 46 | 7.69 |
| Norihiko Shinomiya | 2 | 50 | 19.15 |