The minimum cost D-geodiverse anycast routing with optimal selection of anycast nodes
Consider a geographical network with associated link costs. In anycast routing, network nodes are partitioned into two sets - the source nodes and the anycast (destination) nodes - and the traffic of each source node is routed towards the anycast node providing the minimum routing cost path. By cons...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | conferenceObject |
| Language: | eng |
| Published: |
2019
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10773/26204 |
| Country: | Portugal |
| Oai: | oai:ria.ua.pt:10773/26204 |