00000cmm a22000004i 4500 UP-1685594773860283681 Buklod 20241105152258.0 a r |||| u| ta 241105s2011 nyua grb 001 0 engdu 9781461403104 9781461403111 (eBook) 1461403111 (eBook) (iLib)UPD-00516573062 DLC DIM rda eng DMLUC TK 5105.543 O45 2011 Oliveira, Carlos A. S. author Mathematical aspects of network routing optimization Carlos A.S. Oliveira, Panos M. Pardalos. New York Springer c2011 xxiii, 206 pages illustrations 24 cm text rdacontent unmediated rdamedia volume rdacarrier Springer optimization and its applications v. 53 College of Science Library has electronic copy. Kindly send us a message through cslib@science.upd.edu.ph using your UP mail for the copy of this material Includes bibliographical references (p. 191-199) and index. 1. Unicast routing algorithms 2. Multicast routing 3. Steiner trees and multicast 4. Online multicast 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 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. Routing (Computer network management) Mathematics. Routing (Computer network management) Equipment and supplies. Routers (Computer networks) Multicasting (Computer networks) Ad hoc networks (Computer networks) Algorithms. Metaheuristics. Combinatorial optimization. Pardalos, P. M. (Panos M.) 1954-. FO UPD DIM TK 5105.543 O55 2011 Book