Least-cost network topology design for a new service

International Journal of Engineering Sciences & Research Technology, 2014

Network nodes to estimate and characterize the impact of traffic engineering and load balancing over centralized and decentralized networks. This considers the network maximum utilization with load balancing over different nodes and links. In order to improve the network utilization and performance, the source node analyzes the paths and its Tabu search flow splitting process. To overcome traffic allocation problem the system performs every transmissions analysis and experiment over each link. Each link must be estimated and relayed with that set of conditions and rules. In proposed system used in efficiently for evolutionary algorithm using tabu search. It presented methods for each network node to probabilistically characterize the local impact of a dynamic traffic allocation and for data sources to incorporate this information into the routing algorithm using a different protocol which is CA-FSP (cost aware- flow splitting protocol).

… of Combinatorial Optimization, Special issue on …, 1996

CiteSeerX - Document Details (Isaac Councill, Lee Giles): . This paper presents a computational study of a network design problem arising in the telecommunication industry. The objective can be formulated as that of finding an optimal degree constrained Steiner tree in a graph ...

Journal of …, 2000

This paper examines a network design problem that arises in the telecommunications industry. In this problem, communication between a gateway vertex and a number of demand vertices is achieved through a network of fiber optic cables. Since each cable has an associated capacity (bandwidth), enough capacity must be installed on the links of the network to satisfy the demand, using possibly different types of cables. Starting with a network with no capacity or some capacity already installed, a tabu search heuristic is designed to find a solution that minimizes the cost of installing any additional capacity on the network. This tabu search applies a k-shortest path algorithm to find alternative paths from the gateway to the demand vertices. Numerical results are presented on different types of networks with up to 200 vertices and 100 demand vertices.

2014

Abstract: The network topological design problem (NTDP) is a combinatorial optimization problem and it is NP-hard so that the solution time using classical enumeration-based methods grows exponentially with the network size. The problem considered in this study is to find the best layout of links between a given set of nodes, such that at least 2-connectivity is not violated, desired network reliability is satisfied and total cost is minimized. We discuss the development of a Tabu Search (TS) method for NTDP considering a short term memory structure. An experimental design analysis over networks of various sizes and configurations is made in order to choose the best values of the algorithm parameters. We establish the effectiveness of our approach by comparing its performance with regard to the number of solutions examined in the search space and the solution quality relative to Genetic algorithm (GA) heuristic and optimization method. The results show that, the TS approach is compu...

Handbook of Optimization in Telecommunications, 2006

Recent years have witnessed huge advances in computer technology and communication networks, entailing hard optimization problems in areas such as network design and routing. Metaheuristics are general high-level procedures that coordinate simple heuristics and rules to find good approximate solutions to computationally difficult combinatorial optimization problems. Among them, we find simulated annealing, tabu search, GRASP, VNS, genetic algorithms, and others. They are some of the most effective solution strategies for solving optimization problems in practice and have been applied to a very large variety of problems in telecommunications. In this chapter, we review the main components that are common to different metaheuristics. We also describe the main principles associated with several metaheuristics and we give templates for basic implementations of them. Finally, we present an account of some successful applications of metaheuristics to optimization problems in telecommunications.

Transportation Science, 2009

This paper focuses on a generic model for service network design, which includes asset positioning and utilization through constraints on asset availability at terminals. We denote these relations as "design-balance constraints" and focus on the design-balanced capacitated multi-commodity network design model, a generalization of the capacitated multi-commodity network design model generally used in service network design applications. Both arc and cycle-based formulations for the new model are presented. The paper also proposes a Tabu Search meta-heuristic framework for the arcbased formulation. Results on a wide range of network design problem instances from the literature indicate the proposed method behaves very well in terms of computational efficiency and solution quality.

Computers & Operations Research, 2012

In this paper, we propose an efficient Tabu Search procedure for solving the NP-hard network pricing problem. By exploiting the problem's features, the algorithm allows the near-optimal solution of problem instances that are out of reach of exact combinatorial methods.

Annals of Operations Research - Annals OR, 2001

We present a fast tabu search method for the design of access tree networks. We connect a population of users to a set of switches using a variety of SONET channels on fiber optics links and ADM equipment at the nodes. We specifically take into account the economies of scale provided by the transmission systems and the transmission hierarchy of SONET systems.

2005

Adequately supporting applications with Quality-of-service (QoS) requirements is a challenging task, particularly in the Internet. In great part, this is due to the fact that the provisioning of end-toend QoS to traffic that traverses multiple autonomous systems (ASes) requires a level of cooperation between ASes that is difficult to achieve in the current architecture. Recently, service overlay networks have been considered as an approach to QoS deployment that avoids these difficulties. In this study, the problem of the topological synthesis of a service overlay network is addressed. Endsystems and nodes of the overlay network are connected through ISPs that supports bandwidth reservations. The topology design problem is expressed as an optimization problem. Even though the design problem is related to the (in general NP-hard) quadratic assignment problem, it is shown that relatively simple heuristic algorithms can deliver results that are sometimes close to the optimal solution with little overhead.

Management Science, 1999

One of the private line network design problems in the telecommunications industry is to interconnect a set of customer locations through a ring of end o ces so as to minimize the total tari cost and provide reliability. We develop a Tabu Search method for the problem that incorporates long term memory, probabilistic move selections, hierarchical move evaluation, candidate list strategies and an elite solution recovery strategy. Computational results for test data show that the tabu search heuristic nds optimal solutions for all test problems that can be solved exactly by a branch-and-cut algorithm, while running about three orders of magnitude faster than the exact algorithm. In addition, for larger size problems that cannot be solved exactly , the tabu search algorithm outperforms the best local search heuristic currently available. The performance gap favoring tabu search increases signi cantly for more di cult problem instances.