Mathematical aspects of network routing optimization.

DOI10.1007/978-1-4614-0311-1MaRDI QIDQ549117zbMATH OpenOpenAlexFDO

Authors Carlos A. S. Oliveira, Panos M. Pardalos

Publication date 7 July 2011

Published in Springer Optimization and Its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-1-4614-0311-1

zbMATH Keywords

metaheuristicsnetworksinteger programmingapproximation algorithmsdistributed algorithmsSteiner treesonline routingmulticast routingcache placement problemminimum cost routingpoint-to-point connection problemunicast routingwireless ad hoc systems

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Approximation methods and heuristics in mathematical programming (90C59) Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Integer programming (90C10) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10)

Recommendations

• Multi-objective optimization in computer networks using metaheuristics.
• Optimization problems in multicast tree construction
• A distributed dual ascent algorithm for Steiner problems in multicast routing
• Ad hoc networks: optimization problems and solution methods
• A note on distributed multicast routing in point-to-point networks

Cited in

(19)

• Sufficient conditions for protection routing in IP networks
• Evolutionary algorithms for mobile ad hoc networks
• Multicast routing under quality of service constraints for vehicular ad hoc networks: mathematical formulation and a relax‐and‐fix heuristic
• Routing optimization in communication networks
• Ad hoc networks: optimization problems and solution methods
• Optimal placement of ad hoc devices under a VCG-style routing protocol
• Optimal-constrained multicast sub-graph over coded packet networks
• Dissemination of information in optical networks: From technology to algorithms. In cooperation with Ralf Klasing.
• An interactive approach for solving the multiobjective minimum cost flow problem in the fuzzy environment
• Modeling and optimization of cloud-ready and content-oriented networks
• Topology design for on-demand dual-path routing in wireless networks
• Oblivious network routing. Algorithms and applications
• Mathematical and algorithmic foundations of the internet.
• Genetic algorithm and tabu search algorithm for solving the static manycast RWA problem in optical networks
• Optimization problems in multicast tree construction
• Multi-objective optimization in computer networks using metaheuristics.
• Evaluation performance of genetic algorithm and tabu search algorithm for solving the MAX-RWA problem in all-optical networks
• A robust optimization approach for multicast network coding under uncertain link costs
• Reliability evaluation of a multicast over coded packet networks

This page was built for publication: Mathematical aspects of network routing optimization.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q549117)