Graphs and Algorithms in Communication Networks
Springer Berlin (Verlag)
978-3-642-26163-3 (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.
Part I, Introduction: Mathematical Preliminaries.- Part II, Studies in Broadband and Optical Networks: Introduction to Broadband and Optical Networks.- Selfish Routing.- Graph Models for Grooming, Routing and Traffic Engineering.- Traffic Grooming: Combinatorial Results.- Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems.- Shortest-Path Routing.- Network Design with Stepwise Cost Functions.- Label Space Reduction.- Problems in Dynamic Bandwidth Allocation in Connection-Oriented Networks.- Optimization of Routing in Optical Burst Switching Networks: A Multipath Routing Approach.- Network Survivability: Evaluation of the Network Survivability Level.- Part III, Studies in Wireless and Ad Hoc Networks: Introduction to Wireless and Ad Hoc Networks.- Energy Consumption Minimization in Wireless, Ad Hoc and Multi-interference Networks.- Time-Efficient Broadcast.- Data Aggregation in Sensor Networks.- Topology Control in Ad Hoc Networks.- Mathematical Optimization Models for WLAN Planning.- Tournament Methods for WLAN: Analysis and Efficiency.- Planning Problems in Telecommunication Networks Under Uncertainty: Frequency Assignment and Collaborative Provision of Services.- Online Management of Frequency Spectrum in Wireless Cellular Networks.
| Erscheint lt. Verlag | 14.3.2012 |
|---|---|
| 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 | 685 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-26163-9 / 3642261639 |
| ISBN-13 | 978-3-642-26163-3 / 9783642261633 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
