Graphs and Algorithms in Communication Networks: Studies in Broadband, Optical, Wireless and Ad Hoc Networks

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

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.

Author(s): Arie M.C.A. Koster, Xavier Muñoz (eds.)
Series: Texts in Theoretical Computer Science. An EATCS Series
Publisher: Springer
Year: 2010

Language: English
Pages: 442
Tags: Algorithm Analysis and Problem Complexity; Computer Communication Networks; Communications Engineering, Networks; Operations Research, Mathematical Programming; Discrete Mathematics in Computer Science; Simulation and Modeling

Front Matter....Pages i-xxv
Graphs and Algorithms in Communication Networks on Seven League Boots....Pages 1-59
Front Matter....Pages 61-61
Traffic Grooming: Combinatorial Results and Practical Resolutions....Pages 63-94
Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems....Pages 95-118
Routing and Label Space Reduction in Label Switching Networks....Pages 119-136
Network Survivability: End-to-End Recovery Using Local Failure Information....Pages 137-161
Routing Optimization in Optical Burst Switching Networks: a Multi-path Routing Approach....Pages 163-178
Problems in Dynamic Bandwidth Allocation in Connection Oriented Networks....Pages 179-197
Optimization of OSPF Routing in IP Networks....Pages 199-240
Game-Theoretic Approaches to Optimization Problems in Communication Networks....Pages 241-263
Permutation Routing and ( ℓ , k )-Routing on Plane Grids....Pages 265-279
Front Matter....Pages 281-281
Mathematical Optimization Models for WLAN Planning....Pages 283-309
Time-Efficient Broadcast in Radio Networks....Pages 311-334
Energy Consumption Minimization in Ad Hoc Wireless and Multi-interface Networks....Pages 335-355
Data Gathering in Wireless Networks....Pages 357-377
Tournament Methods for WLAN: Analysis and Efficiency....Pages 379-400
Topology Control and Routing in Ad Hoc Networks....Pages 401-418
Back Matter....Pages 1-8