Mathematical Aspects of Network Routing Optimization

Overview

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 arisingfrom the process of ...
See more details below
Hardcover (2011)
$113.10
BN.com price
(Save 4%)$119.00 List Price
Other sellers (Hardcover)
  • All (6) from $79.70   
  • New (4) from $79.70   
  • Used (2) from $113.09   
Sending request ...

Overview

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 arisingfrom 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 objectivein the text is to deriveefficient 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.
Read More Show Less

Editorial Reviews

From the Publisher

From the reviews:

“This book provides first an elementary introduction into algorithms for network routing. … In principle, the investigations of this book focus on two major types of problems, namely minimum cost routing and cache placement problems. … The book is well-written in an easily understanding form. … the book can be recommended to graduate students, researchers and professionals interested in routing in computer networks and network algorithms.” (Frank Werner, Zentralblatt MATH, Vol. 1225, 2012)

Read More Show Less

Product Details

Meet the Author

Carlos Oliveira obtained a PhD in Operations Research from the University of Florida, a Masters in Computer Science from Universidade Federal do Ceará, Brazil, and a B.Sc. in Computer Science from Universidade Estadual do Ceará, Brazil. Carlos has spent more than ten years working on combinatorial optimization problems in several areas, including telecommunications, computational biology, and logistics. He has written more than 20 papers on optimization aspects of these areas. He is an associate editor for J. of Global Optimization and Optimization Letters.

Carlos was assistant professor at Oklahoma State University from 2004 to 2006. Since then he has worked as a consultant in the areas of optimization and software engineering. He works in New York City and lives in New Jersey with his wife and son. Carlos Oliveira can be contacted at his web site http://coliveira.net.

Panos Pardalos is Distinguished Professor of Industrial and Systems Engineering at the University of Florida. He is also affiliated faculty member of the Computer Science Department, the Hellenic Studies Center, and the Biomedical Engineering Program. He is also the director of the Center for Applied Optimization.Dr. Pardalos obtained a PhD degree from the University of Minnesota in Computer and Information Sciences. Dr. Pardalos is a world leading expert in global and combinatorial optimization. He is the editor-in-chief of the Journal of Global Optimization, Journal of Optimization Letters, and Computational Management Science. In addition, he is the managing editor of several book series, and a member of the editorial board of several international journals. He is the author of 8 books and the editor of several books. He has written numerous articles and developed several well known software packages. His research is supported by National Science Foundation and other government organizations. His recent research interests include network design problems, optimization in telecommunications, e-commerce, data mining, biomedical applications, and massive computing.

Read More Show Less

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.

Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)