The Minimum Cost D-Geodiverse Anycast Routing with Optimal Selection of Anycast Nodes.
Amaro de SousaDorabella SantosPublished in: DRCN (2019)
Keyphrases
- minimum cost
- optimal selection
- packet switching
- np hard
- load balancing
- network flow
- spanning tree
- approximation algorithms
- dynamic routing
- network flow problem
- undirected graph
- capacity constraints
- network simplex algorithm
- routing problem
- ad hoc networks
- quality of service
- minimum cost flow
- routing protocol
- shortest path
- special case
- optimal solution
- similarity measure