A local search heuristic to solve the planning problem of 3G UMTS all-IP release 4 networks with realistic traffic.
Mohammad Reza PasandidehMarc St-HilairePublished in: Int. J. Auton. Adapt. Commun. Syst. (2014)
Keyphrases
- domain independent planning
- ip addresses
- search algorithm
- heterogeneous networks
- routing and wavelength assignment
- tabu search
- simulated annealing
- label switching
- wdm networks
- optimal solution
- cellular networks
- combinatorial optimization
- internet traffic
- planning problems
- job shop scheduling problem
- search procedure
- heuristic function
- packet forwarding
- telecommunication networks
- differentiated services
- network traffic
- heuristic search
- internet protocol
- traffic engineering
- neighborhood search
- social networks
- search space
- hill climbing
- classical planning
- computer networks
- mixed integer program
- search procedures
- mathematical programming
- genetic algorithm
- ip networks
- mixed integer programming model
- road network
- ad hoc networks
- search strategies
- vehicle routing problem
- stochastic local search
- ip address
- base station
- network resources
- network design
- network layer
- optimal planning
- transportation networks
- admissible heuristics