| Autor: |
Arjona‐Villicaña, Pedro David, Constantinou, Costas C, Stepanenko, Alexander S, Acosta‐Elías, Jesús |
| Zdroj: |
IET Networks (Wiley-Blackwell); Jan2018, Vol. 7 Issue 1, p23-32, 10p |
| Abstrakt: |
Complete orders, also called chains, are transitive acyclic digraphs which can be employed as a topological unit to model, abstract and exploit the Internet's path diversity. The main objective behind this work is to demonstrate why complete orders are well suited in abstracting routing information at the interdomain level. In order to abstract a network's topological information, it becomes necessary to introduce another mathematical structure called virtual arc, which allows to define complete orders where these cannot be formed directly. An algorithm, called chain routing, that employs virtual arcs to define chains in a network is described and tested. Further analysis of the chain routing algorithm leads to the conclusion that this is an NP‐complete problem; however, by limiting the size of the complete orders to be used, it is possible to provide an upper bound to the computational task needed to discover these structures in the Internet. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
Plný text