Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Oblivious network routing : algorithms and applications
Iyengar S., Boroojeni K., The MIT Press, Cambridge, MA, 2015. 176 pp.  Type: Book (978-0-262029-15-5)
Date Reviewed: Mar 21 2016

This short book is the outcome of many years of research on oblivious network routing. The project was partially funded by a National Science Foundation (NSF) grant. The book shows mathematical tools and models, as well as their application, to describe currently important aspects of networks. The authors found a way to show routing basics and to include their own research in one book.

Routing problems are not trivial. There are two main approaches to present them. One is from the side of network protocols, which is enhanced by simulations evaluating performance. The other, presented here, requires mathematical background and focuses on models that simplify reality. This approach is not easy, yet the authors managed to deliver superbly. Experience allowed them to present a complicated topic in a comprehensible way, which is the most valuable asset of the book.

This short book comprises five chapters. The first chapter introduces the reader to issues related to network design. Mathematical symbols, nomenclature, and definitions are presented here. Also, the term “oblivious routing” is defined.

Chapters 2 and 3 constitute the mathematical foundation part of the book. The former describes hierarchical routing tools and data structures, thereby presenting instruments to describe routing in general. The latter is focused directly at oblivious routing and shows particular problem specification and routing schemes.

The last two chapters, 4 and 5, present two uses of the models previously introduced. The first is for congestion-free content-centric networks and the second shows a new approach for the distribution of green energy on a smart electric grid. Both applications are currently important topics, which makes the book even more interesting.

Both authors have academic backgrounds and the book is targeted to academics. Its value for engineers is limited, as it does not explain how routing works. Instead, it shows how routing can be modeled and evaluated. Therefore, the book perfectly suits PhD students who want to learn routing and use the models for research. It is also useful for academics who need or want to change a field of expertise.

The previously mentioned quality of presenting a difficult topic in a way that is easy to understand needs to be underlined. The language is clear and accurate. There are numerous examples that further facilitate the reception. The authors present analogies between routing and other areas, for example, vehicular transport. Each chapter ends with exercises and suggested further reading. Exercises are great for readers to check whether they fully understand a covered topic; however, no answers are presented. This is probably the most significant drawback.

Overall, I would recommend this book to graduate students on a PhD track who want to enter the world of network routing or extend their knowledge and skills.

Reviewer:  Robert Wojcik Review #: CR144245 (1607-0451)
Bookmark and Share
  Editor Recommended
 
 
Routing Protocols (C.2.2 ... )
 
 
Data Communications (C.2.0 ... )
 
 
Network Management (C.2.3 ... )
 
Would you recommend this review?
yes
no
Other reviews under "Routing Protocols": Date
Traffic load balancing schemes for devolved controllers in mega data centers
Gao X., Kong L., Li W., Liang W., Chen Y., Chen G.  IEEE Transactions on Parallel and Distributed Systems 28(2): 572-585, 2017. Type: Article
Jun 7 2017
Optimal routing with scheduling and channel assignment in multi-power multi-radio wireless sensor networks
Li J., Guo X., Guo L., Ji S., Han M., Cai Z.  Ad Hoc Networks 31(C): 45-62, 2015. Type: Article
May 20 2016
Towards fast rerouting-based energy efficient routing
Yang Y., Xu M., Li Q.  Computer Networks 701-15, 2014. Type: Article
Feb 6 2015
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright © 2000-2017 ThinkLoud, Inc.
Terms of Use
| Privacy Policy