Mathematical Aspects of Network Routing Optimization [electronic resource] / by Carlos A.S. Oliveira, Panos M. Pardalos.
Contributor(s): Pardalos, Panos M [author.] | SpringerLink (Online service)Material type: TextSeries: Springer Optimization and Its Applications: 53Publisher: New York, NY : Springer New York : Imprint: Springer, 2011Description: XXIV, 208 p. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9781461403111Subject(s): Mathematics | Computer communication systems | Algorithms | Mathematical optimization | Mathematics | Optimization | Algorithms | Computer Communication Networks | Information Systems Applications (incl. Internet) | Algorithm Analysis and Problem ComplexityAdditional physical formats: Printed edition:: No titleDDC classification: 519.6 LOC classification: QA402.5-402.6Online resources: Click here to access online
|Item type||Current location||Collection||Call number||Status||Date due||Barcode||Item holds|
Preface -- 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.
Mathematical 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.