Bounds for two static optimization problems on routing and spectrum allocation of anycasting.
Yasutaka MiyagawaYosuke WatanabeMaiko ShigenoKiyo IshiiAtsuko TakefusaAkiko YoshisePublished in: Opt. Switch. Netw. (2019)
Keyphrases
- optimization problems
- dynamic routing
- evolutionary algorithm
- upper bound
- lower bound
- objective function
- cost function
- routing algorithm
- upper and lower bounds
- lower and upper bounds
- routing problem
- routing protocol
- division multiple access
- resource allocation
- metaheuristic
- optimal allocation
- average case
- combinatorial optimization
- power spectrum
- traveling salesman problem
- allocation policy
- inter domain
- allocation scheme
- wireless ad hoc networks
- worst case
- error bounds
- mobile ad hoc networks
- shortest path
- genetic algorithm
- service requests
- network topology
- data sets