Abstract
| Original language | English |
|---|---|
| Journal | International Journal of Simulation. Systems, Science and Technology |
| Volume | 16 |
| Issue number | 1 |
| Pages (from-to) | 57-63 |
| ISSN | 1473-8031 |
| DOIs | |
| Publication status | Published - 2015 |
Keywords
- Ranking
- Communication Networks
- Topology
Cite this
}
Topological Rankings in Communication Networks. / Aabrandt, Andreas; Hansen, Vagn Lundsgaard; Træholt, Chresten.
In: International Journal of Simulation. Systems, Science and Technology, Vol. 16, No. 1, 2015, p. 57-63.Research output: Contribution to journal › Journal article › Research › peer-review
TY - JOUR
T1 - Topological Rankings in Communication Networks
AU - Aabrandt, Andreas
AU - Hansen, Vagn Lundsgaard
AU - Træholt, Chresten
PY - 2015
Y1 - 2015
N2 - In the theory of communication the central problem is to study how agents exchange information. This problem may be studied using the theory of connected spaces in topology, since a communication network can be modelled as a topological space such that agents can communicate if and only if they belong to the same path connected component of that space. In order to study combinatorial properties of such a communication network, notions from algebraic topology are applied. This makes it possible to determine the shape of a network by concrete invariants, e.g. the number of connected components. Elements of a network may then be ranked according to how essential their positions are in the network by considering the effect of removing them. Defining a ranking of a network which takes the individual position of each entity into account has the purpose of assigning different roles to the entities, e.g. agents, in the network. In this paper it is shown that the topology of a given network induces a ranking of the entities in the network. Furthermore, it is demonstrated how to calculate this ranking and thus how to identify weak sub-networks in any given network.
AB - In the theory of communication the central problem is to study how agents exchange information. This problem may be studied using the theory of connected spaces in topology, since a communication network can be modelled as a topological space such that agents can communicate if and only if they belong to the same path connected component of that space. In order to study combinatorial properties of such a communication network, notions from algebraic topology are applied. This makes it possible to determine the shape of a network by concrete invariants, e.g. the number of connected components. Elements of a network may then be ranked according to how essential their positions are in the network by considering the effect of removing them. Defining a ranking of a network which takes the individual position of each entity into account has the purpose of assigning different roles to the entities, e.g. agents, in the network. In this paper it is shown that the topology of a given network induces a ranking of the entities in the network. Furthermore, it is demonstrated how to calculate this ranking and thus how to identify weak sub-networks in any given network.
KW - Ranking
KW - Communication Networks
KW - Topology
U2 - 10.5013/IJSSST.a.16.01.09
DO - 10.5013/IJSSST.a.16.01.09
M3 - Journal article
VL - 16
SP - 57
EP - 63
JO - International Journal of Simulation. Systems, Science and Technology
JF - International Journal of Simulation. Systems, Science and Technology
SN - 1473-8031
IS - 1
ER -