Graphs and Algorithms in Communication Networks
Springer Berlin (Verlag)
978-3-642-02249-4 (ISBN)
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.
Graphs and Algorithms in Communication Networks on Seven League Boots.- Studies in Broadband and Optical Networks.- Traffic Grooming: Combinatorial Results and Practical Resolutions.- Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems.- Routing and Label Space Reduction in Label Switching Networks.- Network Survivability: End-to-End Recovery Using Local Failure Information.- Routing Optimization in Optical Burst Switching Networks: a Multi-path Routing Approach.- Problems in Dynamic Bandwidth Allocation in Connection Oriented Networks.- Optimization of OSPF Routing in IP Networks.- Game-Theoretic Approaches to Optimization Problems in Communication Networks.- Permutation Routing and (, )-Routing on Plane Grids.- Studies inWireless and Ad Hoc Networks.- Mathematical Optimization Models for WLAN Planning.- Time-Efficient Broadcast in Radio Networks.- Energy Consumption Minimization in Ad Hoc Wireless and Multi-interface Networks.- Data Gathering in Wireless Networks.- Tournament Methods for WLAN: Analysis and Efficiency.- Topology Control and Routing in Ad Hoc Networks.
| Erscheint lt. Verlag | 30.11.2009 |
|---|---|
| Reihe/Serie | Texts in Theoretical Computer Science. An EATCS Series |
| Zusatzinfo | XXVIII, 426 p. |
| Verlagsort | Berlin |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Gewicht | 932 g |
| Themenwelt | Mathematik / Informatik ► Informatik ► Netzwerke |
| Informatik ► Weitere Themen ► Hardware | |
| Schlagworte | ad hoc networks • Algorithm analysis and problem complexity • Algorithmen • algorithms • Broadband • broadband networks • broadcast • Communication • Communication Networks • Complexity • data structures • discrete algorithms • distributed algorithms • Distributed Computing • Graphen • Graphenalgorithmen • Information • Interference • Kommunikationsnetz • LA • network design • Network energy consumption • Network Optimization • network robustness • Online • Operations Research • Optical networks • OSPF • Routing • selfish routing • sensor networks • Switching • Telecommunication networks • Traffic Engineering • wireless networks • WLAN |
| ISBN-10 | 3-642-02249-9 / 3642022499 |
| ISBN-13 | 978-3-642-02249-4 / 9783642022494 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
