A Near-Optimal Solution Approach for the Multi-hop Traffic Grooming Problem (original) (raw)
Related papers
Modelling, simulation and optimisation of network planning methods
In this paper, three iterative improvement methods, simulated annealing, genetic algorithm and tabu search, are proposed to search for solutions to network planning problems. Then, a brief summary of the heuristic methods, single-stage optimization methods, time-phased optimization methods, artificial intelligence techniques and iterative improvement methods are presented. Finally, the performance of each of the techniques is studied and the results compared with those from conventional methods. Also, some of the important characteristics of network planning methods and their strengths and weaknesses are identified and compared.
Telecommunication Systems, 1999
In this paper, we consider solution approaches to a multihour combined capacity design and routing problem which arises in the design of dynamically reconfigurable broadband communication networks that uses the virtual path concept. We present a comparative evaluation of four approaches, namely: a genetic algorithm, a Lagrangian relaxation based subgradient optimization method, a generalized proximal point algorithm with subgradient optimization, and, finally, a hybrid approach where the subgradient based method is combined with a genetic algorithm. Our computational experience on a set of test problems of varying network sizes services) shows that the hybrid approach often is the desirable choice in obtaining the minimum cost network while the genetic algorithm based approach has the most difficulty in solving large scale problems.
A heuristic approach for combined equipment-planning and routing in multi-layer SDH/WDM networks
European Journal of Operational Research, 2006
The paper deals with a multi-layer network design problem for a high-speed telecommunication network based on Synchronous Digital Hierarchy (SDH) and Wavelength Division Multiplex (WDM) technology. The network has to carry a certain set of demands with the objective of minimizing the investment in the equipment. The different layers are the fiber-layer, 2.5 Gbit/s-, 10 Gbit/s-and WDM-systems. Several variations of the problem including pathprotected demands and specific types of cross-connect equipment are considered. The problem is described as a mixed integer linear programming model and some results for small networks are presented. Two greedy heuristics, a random start heuristic and a GRASP-like approach are implemented to solve large real world problems.
Optimization Problems in High-Speed Networks
2002
Abstract: The main goal of this project is to develop fundamental algorithmic techniques that can be applied to problems that arise in the context of high-speed communication networks. The explosion in the size and complexity of networks, together with QoS requirements ...
Networks, 2019
In this paper we study a network design problem arising in the management of a carrier network. The aim is to route a traffic matrix, minimizing a measure of the network congestion while guaranteeing a prescribed quality of service. We formulate the problem, devise presolve procedures to reduce the size of the corresponding mixed-integer programming formulation and show that the proposed approach can efficiently solve some real-life problems, leading to an improvement with respect to the current practice in a real case study. KEYWORDS congestion, mixed-integer model, preprocessing, routing † The author is a member of INdAM Corrections added on 14-March 2019; after first publication.
Grooming telecommunications networks: Optimization models and methods
2005
Grooming has emerged as an active area of research within the operations research and telecommunications fields and concerns the optimization of network transmissions that span multiple distinct transmission channels, protocols, or technologies. This study explores the meaning of grooming, the technical context in which it can be applied, and example situations. A new taxonomy captures key aspects of grooming problems and is used to summarize over 50 key publications on this important traffic-engineering and optimization problem class.
Throughput Optimization and Traffic Engineering in WDM Networks Considering Multiple Metrics
2010
Throughput optimization and traffic engineering in Wavelength-Division Multiplexing (WDM) networks are usually treated as mono-objective optimization problems. In this paper, we provide a multi-objective Integer Linear Program (ILP) for the joint throughput optimization and traffic engineering problem. By simultaneously i) maximizing the throughput, ii) minimizing the resource consumption, and iii) balancing the traffic load, we demonstrate that better solutions than those of mono-objective approaches are obtained. We also present a distributed heuristic algorithm, which upper-bounds the per-route resource consumption and maximizes the throughput. Simulation results validate the proposed model and heuristic algorithm. Additionally, we present an ILP formulation for another well-known problem such as routing and wavelength assignment (RWA), and discuss the impact of modeling it as a multi-objective problem.
Discrete Optimization The multi-layered network design problem
2007
We address the problem of designing a network built on several layers. This problem occurs in practical applications but has not been studied extensively from the point of view of global optimisation, since the problem of designing a singlelayered network is complex. An example of an application is the design of a virtual network (Internet Protocol) built on a sparse optical transport network. We suggest a mathematical formulation without any flow variables or path variables, based on metric inequalities. We give numerical results for two-layered network instances obtained with a global method giving optimal solutions and we compare them with approximate results obtained by solving the problem in two steps. � 2006 Elsevier B.V. All rights reserved.
Algorithmic aspects of optical network design
Optical network design problems fall in the broad category of network optimization problems. We give a short introduction on network optimization and general algorithmic techniques that can be used to solve complex and difficult network design problems. We apply these techniques to address the static Routing and Wavelength Assignment problem that is related to planning phase of a WDM optical network. We present simulation result to evaluate the performance of the proposed algorithmic solution.
About Network Optimization Problems
2008
Abstract: ATM network optimization problems defined as combinatorial optimization problems are considered. Several approximate algorithms for solving such problems are developed. Results of their comparison by experiments on a set of problems with random input data are presented.