000			01878cam a2200229 a 4500
005			20250629141334.0
008			980921s1999 maua b 001 0 eng
020			_a0792383818 _qhbk
082	0	0	_a004.6 _bBHA
100	1		_aBhandari, Ramesh
245	1	0	_aSurvivable Networks _b: algorithms for diverse routing _cby Ramesh Bhandari
260			_aBoston _bKluwer Academic Publishers _cc1999
300			_axii, 200 p. _bill. _c25 cm.
504			_aBib and Ref
520			_aSurvivable Networks: Algorithms for Diverse Routing provides algorithms for diverse routing to enhance the survivability of a network. It considers the common mesh-type network and describes in detail the construction of physically disjoint paths algorithms for diverse routing. The algorithms are developed in a systematic manner, starting with shortest path algorithms appropriate for disjoint paths construction. Key features of the algorithms are optimality and simplicity. Although the algorithms have been developed for survivability of communication networks, they are in a generic form, and thus applicable in other scientific and technical disciplines to problems that can be modeled as a network. A notable highlight of this book is the consideration of real-life telecommunication networks in detail. Such networks are described not only by nodes and links, but also by the actual physical elements, called span nodes and spans. The sharing of spans (the actual physical links) by the network (logical) links complicates the network, requiring new algorithms. This book is the first one to provide algorithms for such networks.
650		0	_aComputer networks
650		0	_aTelecommunication
650		0	_aAlgorithms.
856	4	2	_uhttp://www.loc.gov/catdir/enhancements/fy0813/98045585-d.html
856	4	1	_uhttp://www.loc.gov/catdir/enhancements/fy0813/98045585-t.html
942			_cREF
999			_c574268 _d574268