A traffic grooming problem considering hub location for synchronous optical network-wavelength division multiplexing networks

Authors:
Junghee Han
Affiliations:
College of Business Administration Kangwon National University, Hyoja-2Dong, 200-701, Chunchon-Shi, Kangwon-Do, Republic of Korea
Venue:
Computers and Industrial Engineering
Year:
2010

Citing 7
Cited 3

Practical genetic algorithms

Practical genetic algorithms
Cost-effective traffic grooming in WDM rings

IEEE/ACM Transactions on Networking (TON)
Enhanced Model Representations for an Intra-Ring Synchronous Optical Network Design Problem Allowing Demand Splitting

INFORMS Journal on Computing
Scatter Search: Methodology and Implementations in C

Scatter Search: Methodology and Implementations in C
SONET/SDH ring assignment with capacity constraints

Discrete Applied Mathematics - Special issue: Algorithmic aspects of communication
Improving Discrete Model Representations via Symmetry Considerations

Management Science
Comparing Metaheuristic Algorithms for Sonet Network Design Problems

Journal of Heuristics

A new multi-granularity grooming algorithm based on traffic partition in IP over WDM networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
An improved hybrid particle swarm optimization algorithm for fuzzy p-hub center problem

Computers and Industrial Engineering
Survey: Hub location problems: A review of models, classification, solution techniques, and applications

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we deal with a traffic demand clustering problem for designing SONET-WDM rings. The objective is to minimize the total cost of optical add-drop multiplexers (OADMs) and inter-ring hub equipments, while satisfying intra-ring and inter-ring capacities. Also, the minimum number of nodes, for example three, for each ring should be satisfied. We develop an integer programming (IP) formulation for the problem and develop some valid inequalities that provide a tight lower bound for the problem. Dealing with the inherent computational complexity of the problem, we also devise an effective tabu search procedure for finding a feasible solution of good quality within reasonable computing time. Computational results are provided to demonstrate the efficacy of the lower and upper bound procedures for solving the problem.