Name
Abstract | ||
|---|---|---|
This paper proposes an algorithm to determine a controller location on a given network considering burdens of all communication nodes. The burden is defined by extending stress centrality, which indicates a load of each node based on the number of edge disjoint paths. In order to analyze characteristics of the proposed placement algorithm, our simulations compare it with other placement algorithms and the theoretically optimum values in terms of node burdens, latency, survivability and path stability. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1109/ICCNC.2016.7440618 | 2016 International Conference on Computing, Networking and Communications (ICNC) |
Keywords | Field | DocType |
controller placement,centrality,graph theory | Graph theory,Path stability,Control theory,Survivability,Disjoint sets,Latency (engineering),Computer science,Algorithm,Centrality,Software-defined networking,Distributed computing | Conference |
Citations | PageRank | References |
2 | 0.37 | 15 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Genya Ishigaki | 1 | 46 | 7.69 |
| Norihiko Shinomiya | 2 | 50 | 19.15 |