000			03620nam a22005295i 4500
001			978-1-4614-0311-1
003			DE-He213
005			20140220083732.0
007			cr nn 008mamaa
008			110824s2011 xxu| s |||| 0|eng d
020			_a9781461403111 _9978-1-4614-0311-1
024	7		_a10.1007/978-1-4614-0311-1 _2doi
050		4	_aQA402.5-402.6
072		7	_aPBU _2bicssc
072		7	_aMAT003000 _2bisacsh
082	0	4	_a519.6 _223
100	1		_aOliveira, Carlos A.S. _eauthor.
245	1	0	_aMathematical Aspects of Network Routing Optimization _h[electronic resource] / _cby Carlos A.S. Oliveira, Panos M. Pardalos.
264		1	_aNew York, NY : _bSpringer New York : _bImprint: Springer, _c2011.
300			_aXXIV, 208 p. _bonline resource.
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
347			_atext file _bPDF _2rda
490	1		_aSpringer Optimization and Its Applications, _x1931-6828 ; _v53
505	0		_aPreface -- 1. Unicast Routing Algorithms -- 2. Multicast Routing -- 3. Steiner Trees and Multicast -- 4. Online Multicast Routing -- 5. Distributed Algorithms for Multicast Routing -- 6. Center-Based Trees and Multicast Packing -- 7. Metaheuristics for Multicast Routing -- 8. The Point-to-Point Connection Problem -- 9. Streaming Cache Placement -- 10. Algorithms for Cache Placement -- 11. Distributed Routing on Ad Hoc Networks -- 12. Power-Aware Routing in MANETs -- Appendix -- References -- Index.
520			_aMathematical Aspects of Network Routing Optimization provides a thorough introduction to the subject of algorithms for network routing and focuses on multicast and wireless ad hoc systems. The modern world is connected through large-scale, computational networked systems such as the Internet and because of the ever-advancing technology of networking, efficient algorithms have become increasingly necessary to solve some of the problems developing in this area.   This work focuses on computational issues arising from the process of optimizing network routes, such as the quality of resulting links and their reliability. Algorithms are key to understanding the protocols underlying multicast routing. The main objective in the text is to derive efficient algorithms, with or without the guarantee of approximation, that can be applied to address these problems. Notes have been provided for basic topics such as graph theory and linear programming to assist those who are not fully acquainted with the mathematical topics presented throughout the book.   This book is designed for graduate students, researchers, and professionals interested in understanding the algorithmic and mathematical ideas behind routing in computer networks and network algorithms.
650		0	_aMathematics.
650		0	_aComputer Communication Networks.
650		0	_aComputer software.
650		0	_aAlgorithms.
650		0	_aMathematical optimization.
650	1	4	_aMathematics.
650	2	4	_aOptimization.
650	2	4	_aAlgorithms.
650	2	4	_aComputer Communication Networks.
650	2	4	_aInformation Systems Applications (incl. Internet).
650	2	4	_aAlgorithm Analysis and Problem Complexity.
700	1		_aPardalos, Panos M. _eauthor.
710	2		_aSpringerLink (Online service)
773	0		_tSpringer eBooks
776	0	8	_iPrinted edition: _z9781461403104
830		0	_aSpringer Optimization and Its Applications, _x1931-6828 ; _v53
856	4	0	_uhttp://dx.doi.org/10.1007/978-1-4614-0311-1
912			_aZDB-2-SMA
999			_c106235 _d106235