Graphs and Algorithms in Communication Networks Studies in Broadband, Optical, Wireless and Ad Hoc Networks
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 vi...
Saved in:
| Main Authors | , |
|---|---|
| Format | eBook Book |
| Language | English |
| Published |
Berlin, Heidelberg
Springer Nature
2009
Springer-Verlag Springer Springer Berlin / Heidelberg Springer Berlin Heidelberg |
| Edition | 1. Aufl. |
| Series | Texts in Theoretical Computer Science. An EATCS Series |
| Subjects | |
| Online Access | Get full text |
Cover
Loading…
| Abstract | 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. |
|---|---|
| AbstractList | 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. 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. 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 | Koster, Arie Muñoz, Xavier |
| Author_xml | – sequence: 1 fullname: Koster, Arie – sequence: 2 fullname: Muñoz, Xavier |
| BackLink | https://cir.nii.ac.jp/crid/1130000794735185792$$DView record in CiNii |
| BookMark | eNpdkctOwzAQRY0oiAL9AHYRQkgsQv12sixVeUgINoit5SR2a5rYJU5B_D1OwwLwwtZcnbmauT4GI-edBuAMwWsEoZjmIktJyilOIcYMpnAPTKJGorIT4P6_egTGKOM4pTTPD8GYcUEYQQwdgUkIbzAewhhDbAymd63arEKiXJXM6qVvbbdqQmJdMvdNs3W2VJ31LnnS3adv1-EUHBhVBz35eU_A6-3iZX6fPj7fPcxnj6migmc8xdgQVZAMF0VWKs1pxbiiBmemMByJUuUIVkYRromGCBsRJzWEVdxUBdRlRk7A1WCswlp_hpWvuyA_al14vw7yz7aRnQ5s2LTWLXUrBwpB2efX05LIyMtdg-w7LoeOTevftzp0cmdcate1qpaLmzlDMMcighcD6KyVpe1vhEifoMhpTBVlTOQ4YucDVtqYpJdxjka1X3IoMcMc578gFVQdvWTjnV_uPkAySgVCjHwDWN2MMA |
| ContentType | eBook Book |
| Copyright | Springer-Verlag Berlin Heidelberg 2010 |
| Copyright_xml | – notice: Springer-Verlag Berlin Heidelberg 2010 |
| DBID | I4C 08O RYH |
| DEWEY | 005 |
| DOI | 10.1007/978-3-642-02250-0 |
| DatabaseName | Casalini Torrossa eBooks Institutional Catalogue ciando eBooks CiNii Complete |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science |
| EISBN | 9783642022500 3642022502 |
| Edition | 1. Aufl. 1 1st ed. |
| Editor | Koster, Arie Muñoz, Xavier |
| Editor_xml | – sequence: 1 fullname: Koster, Arie – sequence: 2 fullname: Muñoz, Xavier |
| ExternalDocumentID | 9783642022500 183385 EBC510927 BB00511645 ciando252629 5447115 |
| GroupedDBID | -T. 089 0D6 0DA 0E8 20A 38. 4UP 4V3 92K A4J AABBV AAFYB ABMKK ABMNI ACBCY ACBPT ACWCF ACZTO ADVHH AEKFX AEOKE AETDV AEZAY AHSMR ALMA_UNASSIGNED_HOLDINGS AZZ BBABE CZZ E6I I4C IEZ MYL NUC SAO SBO TBMHI TPJZQ UR4 Z7R Z7X Z7Z Z81 Z83 Z88 08O KC AAJYQ AATVQ ABBUY ABCYT ACDTA ACDUY AEHEY AEJLV AHNNE ATJMZ RYH Z7U Z84 Z7Y |
| ID | FETCH-LOGICAL-a47686-22f3ab382bb8cae64d56a4f28fbf617ca910dfa36e3e012f7499f35d6fdb0ec83 |
| ISBN | 9783642022500 3642022502 9783642022494 3642022499 |
| ISSN | 1862-4499 |
| IngestDate | Tue Mar 25 07:04:34 EDT 2025 Tue Jul 29 20:16:32 EDT 2025 Fri May 30 21:43:06 EDT 2025 Fri Jun 27 01:01:14 EDT 2025 Tue Jan 05 19:17:37 EST 2021 Tue Nov 14 23:02:16 EST 2023 |
| IsPeerReviewed | false |
| IsScholarly | false |
| Keywords | Computer Informatik |
| LCCallNum_Ident | Q |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-a47686-22f3ab382bb8cae64d56a4f28fbf617ca910dfa36e3e012f7499f35d6fdb0ec83 |
| Notes | Includes bibliographical references and index |
| OCLC | 567353151 |
| PQID | EBC510927 |
| PageCount | 441 |
| ParticipantIDs | askewsholts_vlebooks_9783642022500 springer_books_10_1007_978_3_642_02250_0 proquest_ebookcentral_EBC510927 nii_cinii_1130000794735185792 ciando_primary_ciando252629 casalini_monographs_5447115 |
| PublicationCentury | 2000 |
| PublicationDate | 2009 2010 c2010 2009-11-25 |
| PublicationDateYYYYMMDD | 2009-01-01 2010-01-01 2009-11-25 |
| PublicationDate_xml | – year: 2009 text: 2009 |
| PublicationDecade | 2000 2010 |
| PublicationPlace | Berlin, Heidelberg |
| PublicationPlace_xml | – name: Netherlands – name: Berlin – name: Berlin, Heidelberg |
| PublicationSeriesTitle | Texts in Theoretical Computer Science. An EATCS Series |
| PublicationSeriesTitleAlternate | Texts in Theoret.Computer Science |
| PublicationYear | 2009 2010 |
| Publisher | Springer Nature Springer-Verlag Springer Springer Berlin / Heidelberg Springer Berlin Heidelberg |
| Publisher_xml | – name: Springer Nature – name: Springer-Verlag – name: Springer – name: Springer Berlin / Heidelberg – name: Springer Berlin Heidelberg |
| SSID | ssj0000355515 ssib002802077 |
| Score | 1.9030534 |
| Snippet | Algorithmic discrete mathematics plays a key role in the development of information and communication technologies, and methods that arise in computer science,... Examining communication networks from a mathematical perspective, this volume offers an introductory overview of broadband, optical, wireless and ad hoc... |
| SourceID | askewsholts springer proquest nii ciando casalini |
| SourceType | Aggregation Database Publisher |
| SubjectTerms | Algorithm Analysis and Problem Complexity Communications Engineering, Networks Computer Communication Networks Computer networks Computer programming, programs, data Computer Science Computer Systems Organization and Communication Networks Data Structures Graph algorithms Operations research Operations Research, Management Science |
| Subtitle | Studies in Broadband, Optical, Wireless and Ad Hoc Networks |
| TableOfContents | Online Algorithms Multi-commodity Connectivity (MCC) -- Complexity of the Multi-commodity Connectivity Problem -- The SPH Approach -- ILP of the Multi-commodity Connectivity Problem -- Examples -- Case Studies -- First Case Study: Shortcut Span Protection -- The Shortcut Span Protection Model -- Results -- Second Case Study: Connection Availability Under Path Protection -- References -- Routing Optimization in Optical Burst Switching Networks: a Multi-path Routing Approach -- Mirosław Klinkowski, Marian Marciniak, and Michał Pióro -- Introduction -- OBS Technology -- Routing Methods -- Network Modeling -- Link Loss Calculation -- Network Loss Calculation -- Multi-path Source Routing -- Resolution Methods and Numerical Examples -- Formulation of the Optimization Problem -- Calculation of Partial Derivatives -- Numerical Results -- Discussion -- Accuracy of Loss Models -- Properties of the Objective Function -- Computational Effort -- Conclusions -- References -- Problems in Dynamic Bandwidth Allocation in Connection Oriented Networks -- Xavier Hesselbach, Christos Kolias, Ramón Fabregat, Mónica Huerta, and Yezid Donoso -- Introduction -- Technological Perspective and Challenges -- Definitions and Concepts Overview -- Node Model for Packet Networks with Traffic Prioritization -- QoS in IP/DiffServ/MPLS and in OBS Networks -- Optical Burst Switching Using MPLS -- Load Balancing Strategies in a Multi-path Scenario -- Load Balancing in Packet Networks in Multicast Multi-path Scenarios -- Model for Traffic Partitioning -- Intelligent Bandwidth Allocation Algorithms for Multilayer Traffic Mapping with Priority Provision -- QoS Algorithms for OBS -- Conclusions -- References -- Optimization of OSPF Routing in IP Networks -- Andreas Bley, Bernard Fortz, Eric Gourdin, Kaj Holmberg, Olivier Klopfenstein, Michał Pióro, Artur Tomaszewski, and Hakan Ümit -- Introduction Problem Description -- Basic Notions and Notations -- Informal Formulation -- Discussion -- Integer Programming Approach -- Optimizing the Routing Paths -- Finding Compatible Routing Weights -- Shortest Path Routing Inequalities -- Combinatorial Cuts -- Valid Cycles -- General Inequalities -- Heuristic Methods -- Local Search -- Other Algorithms -- Effectiveness Issues -- Numerical Results -- Integer Programming Approach -- Heuristic Methods -- Selected Extensions -- General MIP Formulation -- Additional Routing Constraints and Other Objective Functions -- Resource Dimensioning -- Resilient Routing -- Historical and Literature Notes -- Concluding Remarks -- References -- Game-Theoretic Approaches to Optimization Problems in Communication Networks -- Vittorio Bilò, Ioannis Caragiannis, Angelo Fanelli, Michele Flammini, Christos Kaklamanis, Gianpiero Monaco, and Luca Moscardelli -- Introduction -- Preliminary Notions -- Congestion Games -- Multicast Cost Sharing Games -- Communication Games in All-Optical Networks -- Beyond Nash Equilibria: An Alternative Solution Concept for Non-cooperative Games -- Coping with Incomplete Information -- Open Problems and Future Research -- References -- Permutation Routing and (,k)-Routing on Plane Grids -- Ignasi Sau and Janez Žerovnik -- Introduction -- General Results on Packet Routing -- Routing Problems -- Topologies -- Optimal Permutation Routing Algorithm -- Preliminaries -- Description of the Algorithm for Hexagonal Networks -- Correctness, Running Time and Optimality -- Extensions and Open Problems -- References -- Part II Studies in Wireless and Ad Hoc Networks -- Mathematical Optimization Models for WLAN Planning -- Sandro Bosio, Andreas Eisenblätter, Hans-Florian Geerdes, Iana Siomina, and Di Yuan -- Introduction -- Technical Background -- Physical Layer -- Architecture -- Medium Access Control Intro -- COST -- Preface -- Contents -- List of Contributors -- Graphs and Algorithms in Communication Networks on Seven League Boots -- Arie M. C. A. Koster and Xavier Muñoz -- Introduction -- Mathematical Modeling -- Sets and Parameters -- Graphs and Networks -- Mathematical Problems -- Distributed Problems -- Online Decision Problems -- Computational Complexity -- Combinatorial Optimization Methods -- Linear-Programming-Based Methods -- Graph Theory -- Combinatorial Algorithms -- Approximation Algorithms -- Heuristics Without Solution Guarantee -- Nonlinear Programming -- Selected Classical Applications in Communication Networks -- Design of Network Topologies -- Network Routing Problems -- Network Planning Problems -- A Randomized Cost Smoothing Approach for Optical Network Design -- Wireless Networking -- Emerging Applications in Communication Networks -- Broadband and Optical Networks -- Wireless and Ad Hoc Networks -- References -- Part I Studies in Broadband and Optical Networks -- Traffic Grooming: Combinatorial Results and Practical Resolutions -- Tibor Cinkler, David Coudert, Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Xavier Muñoz, Ignasi Sau, Mordechai Shalom, and Shmuel Zaks -- Introduction -- Problem Definition and Examples -- Minimizing the Usage of Light Termination Equipment -- Path -- Ring -- General Topology -- Online Traffic -- Price of Anarchy -- Minimizing the Number of Add/Drop Multiplexers -- Complexity and Inapproximability Results -- Approximation Results -- Specific Constructions -- A Priori Placement of the Equipment -- Multilayer Traffic Grooming for General Networks -- Multilayer Mesh Networks -- On Grooming in Multilayer Mesh Networks -- Graph Models for Multilayer Grooming -- Conclusion -- References -- Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems Planning Tasks and Performance Aspects -- Related Work -- Notation and Definitions -- AP Location Optimization -- Minimum-Overlap Channel Assignment -- Maximum-Efficiency Channel Assignment -- A Hyperbolic Model and Linear Reformulations -- An Enumerative Integer Linear Model -- Integrated Planning of AP Locationand Channel Assignment -- AP Location and Minimum-Overlap Channel Assignment -- AP Location and Maximum-Efficiency Channel Assignment -- Experimental Results -- Conclusions and Perspectives -- References -- Time-Efficient Broadcast in Radio Networks -- David Peleg and Tomasz Radzik -- Introduction -- The Problem -- Model Parameters -- Efficient Schedules and Bounds on b(G) and (n,D) -- Distributed Broadcasting Algorithms -- Deterministic Distributed Algorithms -- Randomized Distributed Algorithms -- Randomized Broadcasting: Main Techniques -- Using Selective Families in Deterministic Distributed Broadcasting -- Other Variants -- Directed Graphs -- Unit Disk Graphs -- Related Work -- References -- Energy Consumption Minimization in Ad Hoc Wireless and Multi-interface Networks -- Alfredo Navarra, Ioannis Caragiannis, Michele Flammini, Christos Kaklamanis, and Ralf Klasing -- Introduction -- Minimum Energy Broadcast Routing -- Definitions and Notation -- The Geometric Version of MEBR -- An 8-Approximation Upper Boundfor the MST Heuristic -- Experimental Studies with the MST Heuristic -- Solving More General Instances of MEBR -- Cost Minimization in Multi-interface Networks -- Definitions and Notation -- Results for k-CMI -- Results for CMI -- Conclusion and Future Work -- References -- Data Gathering in Wireless Networks -- Vincenzo Bonifaci, Ralf Klasing, Peter Korteweg, Leen Stougie, and Alberto Marchetti-Spaccamela -- Introduction -- The Mathematical Model -- Complexity and Lower Bounds -- Minimizing Makespan -- Minimizing Flow Times Sebastian Orlowski, Christian Raack, Arie M. C. A. Koster, Georg Baier, Thomas Engel, and Pietro Belotti -- Introduction -- Mathematical Model -- Mixed-Integer Programming Model -- Preprocessing -- MIP-Based Heuristics Within Branch-and-Cut -- Computing Capacities over a Given Flow -- Rerouting Flow to Reduce Capacities -- Cutting Planes -- Cutting Planes on the Logical Layer -- Cutting Planes on the Physical Layer -- Computational Results -- Test Instances and Settings -- Unprotected Demands -- Protected Demands -- Preprocessing and Heuristics -- Conclusions -- References -- Routing and Label Space Reduction in Label Switching Networks -- Fernando Solano, Luis Fernando Caro, Thomas Stidsen, and Dimitri Papadimitriou -- Introduction to Label Switching -- Functional Description of the Technologies -- Multi-protocol Label Switching Traffic Engineering (MPLS-TE) -- All-Optical Label Switching (AOLS) -- Ethernet VLAN-Label Switching (ELS) -- Methods for Scaling the Usage of the Label Space -- Label Merging -- Label Stacking -- Considering Routing -- Generic Model -- Parameters and Variables -- Integer Linear Program for the NetworkDesign Problem -- Traffic Engineering Formulation -- No Label Stacking -- Simulation Results -- MPLS-TE -- AOLS -- ELS -- Conclusions and Future Work -- References -- Network Survivability: End-to-End Recovery Using Local Failure Information -- José L. Marzo, Thomas Stidsen, Sarah Ruepp, Eusebi Calle, Janos Tapolcai, and Juan Segovia -- Basic Concepts on Network Survivability -- Protection and Restoration -- The Scope of Backup Paths -- Shareability of Protection Resources -- The Failure-Dependent Path Protection Method -- Recovery Based on the Failure Scenario -- Path Assignment Approaches -- General Shared Risk Groups (SRG) -- The Input of the Problem -- Two-Step Approaches -- Joint Optimization: The Greedy Approach |
| Title | Graphs and Algorithms in Communication Networks |
| URI | http://digital.casalini.it/9783642022500 http://ebooks.ciando.com/book/index.cfm/bok_id/252629 https://cir.nii.ac.jp/crid/1130000794735185792 https://ebookcentral.proquest.com/lib/[SITE_ID]/detail.action?docID=510927 http://link.springer.com/10.1007/978-3-642-02250-0 https://www.vlebooks.com/vleweb/product/openreader?id=none&isbn=9783642022500&uid=none |
| Volume | 3214 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3Pb9MwFLZYudALMECUMbAQB6QtKHHi_OC2TkXTBJzG1Jtlxw6r6JKp6Tjw1_OeHSfpQEJwsRLHta18jd_3nt97JuStZonKQekKEqmKIDGpDIrU5EGWV0anoVZK4o7u5y_p2dfkfMmXwxlFNrpkq96XP_8YV_I_qEId4IpRsv-AbN8pVMA14AslIAzlHfLb33aZ-jHNtMuuLNffGlDwr66tY2s5jvc4qp2Pd2v1_tZ5DGIrtWmkVp1LY3Njzdl4iXmL17j02Y710VVT9n30K3Pjz_I42awGx9lb3HGfR421Ry8lStuxQcH6pY0NCt6guKNoxqCmoLR3BxL_tuyOPS2gZQBNOfQ7yJje828-x2UAdDS-R_ayDNah-yeL80-XvV0sBAIEHAvDcPyYhUuUNMzB7053CYJ3xpySqWy_g4AA4bFtkW3IVmKQKVAMtBPpBlhEvVrtaBR3NsEtt7h4RCYYb_KY3DP1PnnoT9mg3aK7T6ajlJFPyLWDnsIQdICermq6Az31sNEPtAMe2_TAH9MO9mPqQXddagqg979-Si4_Li5Oz4LuyIxAJqA4pgFjVSxVnDOl8lKaNNE8lUnF8kpVQFZLCfRQVzJOTWyAm1QZvN4q5jqttApNmcfPyKRuavOc0CgqctCfJRBoleQSeGGmgN4nXDMDHZYz8mb0psWPtd3eb8UAFQ_DGTnwAAj4-lwa9lbwBEhRxPGpxUTcuNwqwt0yzlJWzMghAAVVWEa47wqIF3hWNiYwK9iMvPYQCjt2588sFvNTEDUFy2bknUdWuMn5LN0wSRELmKaw8xThi78MdkAeDB_LSzLZbm7NIfDRrXrV_YV_AbPaf2s |
| linkProvider | Library Specific Holdings |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.title=Graphs+and+algorithms+in+communication+networks+%3A+studies+in+broadband%2C+optical%2C+wireless+and+ad+hoc+networks&rft.au=Koster%2C+Arie&rft.au=Mu%C3%B1oz%2C+Xavier&rft.date=2010-01-01&rft.pub=Springer&rft.isbn=9783642022494&rft_id=info:doi/10.1007%2F978-3-642-02250-0&rft.externalDocID=BB00511645 |
| thumbnail_m | http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=https%3A%2F%2Fvle.dmmserver.com%2Fmedia%2F640%2F97836420%2F9783642022500.jpg |
| thumbnail_s | http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=https%3A%2F%2Fmedia.springernature.com%2Fw306%2Fspringer-static%2Fcover-hires%2Fbook%2F978-3-642-02250-0 |