Graphs and Algorithms in Communication Networks

Studies in Broadband, Optical, Wireless and Ad Hoc Networks

By Arie Koster , Xavier Muñoz

Graphs and Algorithms in Communication Networks Cover Image

Examining communication networks from a mathematical perspective, this volume offers an introductory overview of broadband, optical, wireless and ad hoc networks. Particular topics of interest are design, optimization, robustness and energy consumption.

Full Description

  • ISBN13: 978-3-6420-2249-4
  • 456 Pages
  • User Level: Science
  • Publication Date: December 1, 2009
  • Available eBook Formats: PDF
  • eBook Price: $159.00
Buy eBook Buy Print Book Add to Wishlist
Full Description
Algorithmic discrete mathematics plays a key role in the development of information and communication technologies, and methods that arise in computer science, mathematics and operations research – in particular in algorithms, computational complexity, distributed computing and optimization – are vital to modern services such as mobile telephony, online banking and VoIP. This book examines communication networking from a mathematical viewpoint. The contributing authors took part in the European COST action 293 – a four-year program of multidisciplinary research on this subject. In this book they offer introductory overviews and state-of-the-art assessments of current and future research in the fields of broadband, optical, wireless and ad hoc networks. Particular topics of interest are design, optimization, robustness and energy consumption. The book will be of interest to graduate students, researchers and practitioners in the areas of networking, theoretical computer science, operations research, distributed computing and mathematics.
Table of Contents

Table of Contents

  1. Part I, Introduction: Mathematical Preliminaries.
  2. Part II, Studies in Broadband and Optical Networks: Introduction to Broadband and Optical Networks.
  3. Selfish Routing.
  4. Graph Models for Grooming, Routing and Traffic Engineering.
  5. Traffic Grooming: Combinatorial Results.
  6. Branch
  7. and
  8. Cut Techniques for Solving Realistic Two
  9. Layer Network Design Problems.
  10. Shortest
  11. Path Routing.
  12. Network Design with Stepwise Cost Functions.
  13. Label Space Reduction.
  14. Problems in Dynamic Bandwidth Allocation in Connection
  15. Oriented Networks.
  16. Optimization of Routing in Optical Burst Switching Networks: A Multipath Routing Approach.
  17. Network Survivability: Evaluation of the Network Survivability Level.
  18. Part III, Studies in Wireless and Ad Hoc Networks: Introduction to Wireless and Ad Hoc Networks.
  19. Energy Consumption Minimization in Wireless, Ad Hoc and Multi
  20. interference Networks.
  21. Time
  22. Efficient Broadcast.
  23. Data Aggregation in Sensor Networks.
  24. Topology Control in Ad Hoc Networks.
  25. Mathematical Optimization Models for WLAN Planning.
  26. Tournament Methods for WLAN: Analysis and Efficiency.
  27. Planning Problems in Telecommunication Networks Under Uncertainty: Frequency Assignment and Collaborative Provision of Services.
  28. Online Management of Frequency Spectrum in Wireless Cellular Networks.
Errata

Please Login to submit errata.

No errata are currently published