Oblivious network routing : algorithms and applications / S.S. Iyengar and Kianoosh G. Boroojeni.
Contributor(s): Iyengar, S. S. (Sundararaja S.)
| Boroojeni, Kianoosh G | IEEE Xplore (Online Service) [distributor.] | MIT Press [publisher.].
Material type: 
BookPublisher: Cambridge, Massachusetts : MIT Press, [2015]Distributor: [Piscataqay, New Jersey] : IEEE Xplore, [2015]Description: 1 PDF (xiii, 160 pages) : illustrations.Content type: text Media type: electronic Carrier type: online resourceISBN: 9780262328968.Subject(s): Adaptive routing (Computer network management) | Epitaxial layers | Excitons | Nitrogen | Radiative recombination | Silicon carbide | Temperature measurementGenre/Form: Electronic books.Additional physical formats: Print version: No titleDDC classification: 004.6 Online resources: Abstract with links to resource Also available in print.Summary: Our increasingly integrated world relies on networks both physical and virtual to transfer goods and information. The Internet is a network of networks that connects people around the world in a real-time manner, but it can be disrupted by massive data flows, diverse traffic patterns, inadequate infrastructure, and even natural disasters and political conflict. Similar challenges exist for transportation and energy distribution networks. There is an urgent need for intelligent and adaptable routing of network flows, and a rich literature has evolved that treats "oblivious network design." This book offers novel computational schemes for efficiently solving routing problems in unpredictable circumstances and proposes some real world applications for them. The versatile routing schemes mathematically guarantee long-term efficiency and are most appropriate for networks with non-deterministic (or oblivious) current and past states. After an introduction to network design and the importance of routing problems, the book presents mathematical tools needed to construct versatile routing schemes, emphasizing the role of linked hierarchical data structures, both top-down and bottom-up. It then describes two important applications of versatile routing schemes: a secure model for congestion-free content-centric networks (which will play a key role in the future of the Internet) and a novel approach for the distribution of green power resources on a smart electricity grid.
Includes bibliographical references (pages 153-155) and index.
Restricted to subscribers or individual electronic text purchasers.
Our increasingly integrated world relies on networks both physical and virtual to transfer goods and information. The Internet is a network of networks that connects people around the world in a real-time manner, but it can be disrupted by massive data flows, diverse traffic patterns, inadequate infrastructure, and even natural disasters and political conflict. Similar challenges exist for transportation and energy distribution networks. There is an urgent need for intelligent and adaptable routing of network flows, and a rich literature has evolved that treats "oblivious network design." This book offers novel computational schemes for efficiently solving routing problems in unpredictable circumstances and proposes some real world applications for them. The versatile routing schemes mathematically guarantee long-term efficiency and are most appropriate for networks with non-deterministic (or oblivious) current and past states. After an introduction to network design and the importance of routing problems, the book presents mathematical tools needed to construct versatile routing schemes, emphasizing the role of linked hierarchical data structures, both top-down and bottom-up. It then describes two important applications of versatile routing schemes: a secure model for congestion-free content-centric networks (which will play a key role in the future of the Internet) and a novel approach for the distribution of green power resources on a smart electricity grid.
Also available in print.
Mode of access: World Wide Web
Description based on PDF viewed 12/23/2015.
There are no comments for this item.