Network Synthesis Problems

This monograph is concerned with network restoration problems to ensure telecommunication network survivability. More precisely, the author studies the problems of determining minimum cost link capacities in order to satisfy a given set of requirements, that is the network synthesis problem, restoration of which is a special application. In this monograph, the author illustrates the role that combinatorial optimization techniques can play in the solutions of various classes of synthesis problem encountered in telecommunication planning. The author presents a literature review, mathematical formulations, and a complexity analysis. Lower bounds, and exact solutions for some classes of this problem are provided. Furthermore, she develops a tabu search heuristic for finding good approximate solutions for real size instances. The monograph also provides an introduction to SDH/SONET telecommunication networks and to various survivability techniques. Audience: The book will be of interest to researchers and professionals working in mathematics, operations research, and engineering economics, particularly when related to the telecommunications industry.

שנה

2001

שפה

English

סדרה

Combinatorial Optimization -- 8

הוצאה

Springer US

מהדורות

1

עמודים

207

ISBN

9781441948434

מקור הנתונים: Wikidata