Mathematical aspects of network routing optimization
Author(s)
Bibliographic Information
Mathematical aspects of network routing optimization
(Springer optimization and its applications, 53)
Springer, c2011
- : hbk
- : pbk
Available at 4 libraries
  Aomori
  Iwate
  Miyagi
  Akita
  Yamagata
  Fukushima
  Ibaraki
  Tochigi
  Gunma
  Saitama
  Chiba
  Tokyo
  Kanagawa
  Niigata
  Toyama
  Ishikawa
  Fukui
  Yamanashi
  Nagano
  Gifu
  Shizuoka
  Aichi
  Mie
  Shiga
  Kyoto
  Osaka
  Hyogo
  Nara
  Wakayama
  Tottori
  Shimane
  Okayama
  Hiroshima
  Yamaguchi
  Tokushima
  Kagawa
  Ehime
  Kochi
  Fukuoka
  Saga
  Nagasaki
  Kumamoto
  Oita
  Miyazaki
  Kagoshima
  Okinawa
  Korea
  China
  Thailand
  United Kingdom
  Germany
  Switzerland
  France
  Belgium
  Netherlands
  Sweden
  Norway
  United States of America
Description and Table of Contents
Description
Before the appearance of broadband links and wireless systems, networks have been used to connect people in new ways. Now, the modern world is connected through large-scale, computational networked systems such as the Internet. Because of the ever-advancing technology of networking, efficient algorithms have become increasingly necessary to solve some of the problems developing in this area.
"Mathematical Aspects of Network Routing Optimization" focuses on computational issues arising from the process of optimizing network routes, such as quality of the resulting links and their reliability. Algorithms are a cornerstone for the understanding of the protocols underlying multicast routing. The main objective in the text is to derive efficient algorithms, with or without guarantee of approximation. 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.
"Mathematical Aspects of Network Routing Optimization" provides a thorough introduction to the subject of algorithms for network routing, and focuses especially on multicast and wireless ad hoc systems. This book is designed for graduate students, researchers, and professionals interested in understanding the algorithmic and mathematical ideas behind routing in computer networks. It is suitable for advanced undergraduate students, graduate students, and researchers in the area of network algorithms.
Table of Contents
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.
by "Nielsen BookData"