DocumentCode
1809893
Title
Diverse routing for survivability in a fiber-based sparse network
Author
Medhi, Deepankar
Author_Institution
Comput. Sci. Telecommun. Program, Missouri Univ., Kansas City, MO, USA
fYear
1991
fDate
23-26 Jun 1991
Firstpage
672
Abstract
The problem of obtaining optimal pairs of diverse routes to minimize cost for given demand, capacity, and bound requirements is addressed. The mathematical formulation of this problem yields a mixed-integer, multicommodity flow model which can be solved by a Lagrangian relaxation-based algorithm exploiting the structure of the problem. A preliminary study shows improvement in worst case network survivability with diverse routing
Keywords
optical fibres; optical links; telecommunication traffic; Lagrangian relaxation-based algorithm; bound; capacity; cost; demand; diverse routing; mathematical formulation; mixed integer flow model; multicommodity flow model; network survivability; optical links; Cities and towns; Computer science; Cost function; Intelligent networks; Lagrangian functions; Mathematical model; Optical fibers; Routing; Spine; Telecommunication traffic;
fLanguage
English
Publisher
ieee
Conference_Titel
Communications, 1991. ICC '91, Conference Record. IEEE International Conference on
Conference_Location
Denver, CO
Print_ISBN
0-7803-0006-8
Type
conf
DOI
10.1109/ICC.1991.162447
Filename
162447
Link To Document