top

  Info

  • Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.

  Info

  • Utilizzare questo link per rimuovere la selezione effettuata.

Biblioteca

MARC Lista (tabellare)
Network routing : fundamentals, applications and emerging technologies / / Sudip Misra, Sumit Goswami
Network routing : fundamentals, applications and emerging technologies / / Sudip Misra, Sumit Goswami
Autore Misra Sudip
Pubbl/distr/stampa Chichester, West Sussex, England : , : Wiley, , 2017
Descrizione fisica 1 online resource (451 pages)
Disciplina 004.6
Collana New York Academy of Sciences
Soggetto topico Routing (Computer network management)
ISBN 1-119-02939-2
1-119-02938-4
1-119-11486-1
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto -- About the Authors xiii -- Foreword xv -- Preface xvii -- About the Companion Website xxi -- Part I Fundamental Concepts 1 -- 1 Introduction to Network Routing 3 -- 1.1 Introduction to Networks 3 -- 1.2 Network Architecture and Standards 6 -- 1.3 Glimpse at the Network Layer 13 -- 1.4 Addressing in TCP/IP Networks 16 -- 1.5 Overview of Routing 20 -- 1.6 Delivery, Forwarding, Routing, and Switching 21 -- 1.7 Routing Taxonomy 23 -- 1.8 Host Mobility and Routing 26 -- References 27 -- Abbreviations/Terminologies 28 -- Questions 30 -- Exercises 32 -- 2 Basic Routing Algorithms 35 -- 2.1 Introduction to Routing Algorithms 35 -- 2.2 Routing Strategies 40 -- 2.2.1 Non?]Adaptive Algorithms 43 -- 2.2.2 Adaptive Algorithms 44 -- 2.2.3 Flooding 44 -- 2.3 Static Shortest Path Routing Algorithms 47 -- 2.4 Dynamic Shortest Path Routing Algorithms 50 -- 2.5 Stochastic Routing Algorithms 53 -- References 55 -- Abbreviations/Terminologies 55 -- Questions 56 -- Exercises 57 -- 3 Fundamental Routing Protocols 59 -- 3.1 Routing Protocols 59 -- 3.2 Distance Vector Routing 61 -- 3.2.1 Working of the Protocol 61 -- 3.2.2 Convergence of Distance Vector Table 62 -- 3.2.3 Issues in Distance Vector Routing 63 -- 3.2.4 Improvements in Distance Vector Routing 67 -- 3.2.5 Advantages and Disadvantages 68 -- 3.3 Link State Routing 68 -- 3.3.1 Working of the Protocol 68 -- 3.3.2 Routing Tables 70 -- 3.4 Path Vector Routing 71 -- 3.4.1 Working of the Protocol 72 -- 3.4.2 Advantages and Disadvantages 74 -- 3.5 Unicast, Multicast, and Broadcast Routing 77 -- References 82 -- Abbreviations/Terminologies 83 -- Questions 83 -- Exercises 84 -- Part II Routing with Quality?]of?]Service and Traffic Engineering 89 -- 4 Quality?]of?]Service Routing 91 -- 4.1 Introduction 91 -- 4.2 QoS Measures 95 -- 4.3 Differentiated and Integrated Services 97 -- 4.4 QoS Routing Algorithms 103 -- 4.5 QoS Unicast Routing Protocols 106 -- 4.6 QoS Multicast Routing Protocols 108 -- 4.7 QoS Best?]Effort Routing 112 -- References 113.
Abbreviations/Terminologies 116 -- Questions 117 -- 5 Routing and MPLS Traffic Engineering 119 -- 5.1 MPLS Fundamentals 119 -- 5.2 Traffic Engineering Routing Algorithms 120 -- 5.3 Minimum Interference Routing Algorithm 121 -- 5.3.1 The Algorithm 122 -- 5.3.2 Limitations of MIRA 123 -- 5.4 Profile?]Based Routing Algorithm 124 -- 5.5 Dynamic Online Routing Algorithm 125 -- 5.6 Wang et al.'s Algorithm 126 -- 5.7 Random Races Algorithm 126 -- References 127 -- Abbreviations/Terminologies 128 -- Questions 128 -- Exercises 129 -- Part III Routing on the Internet 131 -- 6 Interior Gateway Protocols 133 -- 6.1 Introduction 133 -- 6.2 Distance Vector Protocols 135 -- 6.2.1 Routing Information Protocol 137 -- 6.2.2 Interior Gateway Routing Protocol 141 -- 6.3 Link State Protocols 143 -- 6.3.1 Open Shortest Path First Protocol 144 -- 6.3.2 Intermediate System to Intermediate System Protocol 148 -- References 152 -- Abbreviations/Terminologies 152 -- Questions 153 -- Exercises 155 -- 7 Exterior Gateway Protocol 159 -- 7.1 Introduction 159 -- 7.1.1 Hosts vs Gateways 161 -- 7.1.2 Gateway?]to?]Gateway Protocol 162 -- 7.1.3 Autonomous System 163 -- 7.1.4 Characteristics of EGP 165 -- 7.2 Exterior Gateway Protocol 166 -- 7.2.1 Evolution of EGP Standards 166 -- 7.2.2 EGP Terminology and Topology 166 -- 7.2.3 EGP Operation Model 167 -- 7.3 Border Gateway Protocol 169 -- 7.3.1 Router Connectivity and Terminology 169 -- 7.3.2 Routing Information Base 181 -- 7.3.3 BGP Operation 182 -- 7.3.4 Decision Process 184 -- 7.3.5 Route Selection Process 185 -- References 188 -- Abbreviations/Terminologies 189 -- Questions 190 -- Exercises 191 -- Part IV Other Routing Contexts 195 -- 8 Routing in ATM Networks 197 -- 8.1 Introduction 197 -- 8.1.1 ATM Frames 199 -- 8.1.2 ATM Connection 199 -- 8.1.3 ATM Architecture 203 -- 8.1.4 Service Categories 204 -- 8.2 PNNI Routing 206 -- 8.2.1 PNNI Interface 207 -- 8.2.2 PNNI Hierarchy 207 -- 8.2.3 Building the Network Topology 209 -- 8.2.4 Peer Group Leader 210.
8.2.5 Advertizing Topology 211 -- 8.2.6 Setting up Connection 212 -- References 213 -- Abbreviations/Terminologies 213 -- Questions 214 -- Exercises 216 -- 9 Routing in Cellular Wireless Networks 219 -- 9.1 Introduction 219 -- 9.2 Basics of Cellular Wireless Networks 220 -- 9.3 Resource Allocation 229 -- 9.4 Routing in GSM Networks 231 -- 9.4.1 Architecture 232 -- 9.4.2 Call Routing 234 -- 9.5 Challenges in Mobile Computing 235 -- References 238 -- Abbreviations/Terminologies 240 -- Questions 241 -- Exercises 242 -- 10 Routing in Wireless Ad Hoc Networks 245 -- 10.1 Introduction 245 -- 10.1.1 Basics of Wireless Ad Hoc Networks 248 -- 10.1.2 Issues with Existing Protocols 256 -- 10.2 Table?]Driven (Proactive) Routing Protocols 258 -- 10.3 On?]Demand (Reactive) Routing Protocols 260 -- 10.4 Hybrid Routing Protocols 266 -- 10.5 Hierarchical Routing Protocols 267 -- 10.6 Geographic Routing Protocols 268 -- 10.7 Power?]Aware Routing Protocols 274 -- References 276 -- Abbreviations/Terminologies 278 -- Questions 280 -- Exercises 281 -- 11 Routing in Wireless Sensor Networks 285 -- 11.1 Basics of Wireless Sensor Networks 285 -- 11.1.1 Hardware Architecture of Sensor Node 287 -- 11.1.2 Network Topology 289 -- 11.1.3 Design Factors 290 -- 11.1.4 Classification of Routing Protocol 292 -- 11.2 Routing Challenges in Wireless Sensor Networks 293 -- 11.2.1 Self?]Healing Networks 295 -- 11.2.2 Security Threats 296 -- 11.3 Flat Routing Protocols 297 -- 11.4 Hierarchical Routing Protocols 303 -- 11.5 Location?]Based Routing Protocols 308 -- 11.6 Multipath Routing Protocols 310 -- 11.7 Query?]Based Routing Protocols 312 -- 11.8 Negotiation?]Based Routing Protocols 314 -- 11.9 QoS Routing Protocols 315 -- 11.9.1 Challenges 316 -- 11.9.2 Approach to QoS Routing 316 -- 11.9.3 Protocols 317 -- References 317 -- Abbreviations/Terminologies 321 -- Questions 322 -- Exercises 324 -- 12 Routing in 6LoWPAN 327 -- 12.1 Introduction 327 -- 12.1.1 IP for Smart Objects 328 -- 12.1.2 6LoWPAN 329.
12.1.3 ZigBee 330 -- 12.1.4 ZigBee vs 6LoWPAN 330 -- 12.2 6LoWPAN Fundamentals 331 -- 12.2.1 Architecture 332 -- 12.2.2 Header Format and Compression 332 -- 12.2.3 Network Topology 335 -- 12.2.4 Neighbor Discovery 335 -- 12.2.5 Routing 336 -- 12.3 Interoperability of 6LoWPAN 337 -- 12.4 Applications 338 -- 12.5 Security Considerations and Research Areas 341 -- References 342 -- Abbreviations/Terminologies 345 -- Questions 346 -- Exercises 348 -- Part V Advanced Concepts 349 -- 13 Security in Routing 351 -- 13.1 Introduction 351 -- 13.1.1 Network Sniffer 353 -- 13.1.2 Denial of Service Attack 357 -- 13.1.3 Social Engineering 358 -- 13.1.4 Packet Filtering 359 -- 13.2 Attack Surface 360 -- 13.2.1 Types of Attack Surface 361 -- 13.2.2 Attack Surface and System Resources 361 -- 13.2.3 Attack Surface Metric 362 -- 13.2.4 Reduction in Attack Surface 362 -- 13.3 Networked Battlefield 363 -- 13.4 Mobile Agents 365 -- 13.4.1 Architecture and Framework 368 -- 13.4.2 Life Cycle 369 -- 13.4.3 Challenges 370 -- 13.5 Cognitive Security 370 -- 13.5.1 Solution Concept 371 -- 13.5.2 Cognitive Capabilities 372 -- 13.5.3 General Capabilities 373 -- References 373 -- Abbreviations/Terminologies 374 -- Questions 375 -- Exercises 376 -- 14 Reliability and Fault?]Tolerant and Delay?]Tolerant Routing 377 -- 14.1 Fundamentals of Network Reliability 377 -- 14.1.1 Importance of Reliability Calculation 378 -- 14.1.2 Methods to Calculate the Reliability of a Network 379 -- 14.2 Fault Tolerance 390 -- 14.2.1 Fault?]Tolerant Network 394 -- 14.2.2 Autonomic Network 394 -- 14.3 Network Management for Fault Detection 398 -- 14.3.1 Traditional Network Management 399 -- 14.3.2 Mobile Agent 400 -- 14.3.3 Policy?]Based Network Management 401 -- 14.4 Wireless Tactical Networks 402 -- 14.5 Routing in Delay?]Tolerant Networks 403 -- 14.5.1 Applications 404 -- 14.5.2 Routing Protocols 404 -- References 405 -- Abbreviations/Terminologies 407 -- Questions 408 -- Exercises 409 -- Index 411.
Record Nr. UNINA-9910794774103321
Misra Sudip  
Chichester, West Sussex, England : , : Wiley, , 2017
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Network routing : fundamentals, applications and emerging technologies / / Sudip Misra, Sumit Goswami
Network routing : fundamentals, applications and emerging technologies / / Sudip Misra, Sumit Goswami
Autore Misra Sudip
Pubbl/distr/stampa Chichester, West Sussex, England : , : Wiley, , 2017
Descrizione fisica 1 online resource (451 pages)
Disciplina 004.6
Collana New York Academy of Sciences
Soggetto topico Routing (Computer network management)
ISBN 1-119-02939-2
1-119-02938-4
1-119-11486-1
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto -- About the Authors xiii -- Foreword xv -- Preface xvii -- About the Companion Website xxi -- Part I Fundamental Concepts 1 -- 1 Introduction to Network Routing 3 -- 1.1 Introduction to Networks 3 -- 1.2 Network Architecture and Standards 6 -- 1.3 Glimpse at the Network Layer 13 -- 1.4 Addressing in TCP/IP Networks 16 -- 1.5 Overview of Routing 20 -- 1.6 Delivery, Forwarding, Routing, and Switching 21 -- 1.7 Routing Taxonomy 23 -- 1.8 Host Mobility and Routing 26 -- References 27 -- Abbreviations/Terminologies 28 -- Questions 30 -- Exercises 32 -- 2 Basic Routing Algorithms 35 -- 2.1 Introduction to Routing Algorithms 35 -- 2.2 Routing Strategies 40 -- 2.2.1 Non?]Adaptive Algorithms 43 -- 2.2.2 Adaptive Algorithms 44 -- 2.2.3 Flooding 44 -- 2.3 Static Shortest Path Routing Algorithms 47 -- 2.4 Dynamic Shortest Path Routing Algorithms 50 -- 2.5 Stochastic Routing Algorithms 53 -- References 55 -- Abbreviations/Terminologies 55 -- Questions 56 -- Exercises 57 -- 3 Fundamental Routing Protocols 59 -- 3.1 Routing Protocols 59 -- 3.2 Distance Vector Routing 61 -- 3.2.1 Working of the Protocol 61 -- 3.2.2 Convergence of Distance Vector Table 62 -- 3.2.3 Issues in Distance Vector Routing 63 -- 3.2.4 Improvements in Distance Vector Routing 67 -- 3.2.5 Advantages and Disadvantages 68 -- 3.3 Link State Routing 68 -- 3.3.1 Working of the Protocol 68 -- 3.3.2 Routing Tables 70 -- 3.4 Path Vector Routing 71 -- 3.4.1 Working of the Protocol 72 -- 3.4.2 Advantages and Disadvantages 74 -- 3.5 Unicast, Multicast, and Broadcast Routing 77 -- References 82 -- Abbreviations/Terminologies 83 -- Questions 83 -- Exercises 84 -- Part II Routing with Quality?]of?]Service and Traffic Engineering 89 -- 4 Quality?]of?]Service Routing 91 -- 4.1 Introduction 91 -- 4.2 QoS Measures 95 -- 4.3 Differentiated and Integrated Services 97 -- 4.4 QoS Routing Algorithms 103 -- 4.5 QoS Unicast Routing Protocols 106 -- 4.6 QoS Multicast Routing Protocols 108 -- 4.7 QoS Best?]Effort Routing 112 -- References 113.
Abbreviations/Terminologies 116 -- Questions 117 -- 5 Routing and MPLS Traffic Engineering 119 -- 5.1 MPLS Fundamentals 119 -- 5.2 Traffic Engineering Routing Algorithms 120 -- 5.3 Minimum Interference Routing Algorithm 121 -- 5.3.1 The Algorithm 122 -- 5.3.2 Limitations of MIRA 123 -- 5.4 Profile?]Based Routing Algorithm 124 -- 5.5 Dynamic Online Routing Algorithm 125 -- 5.6 Wang et al.'s Algorithm 126 -- 5.7 Random Races Algorithm 126 -- References 127 -- Abbreviations/Terminologies 128 -- Questions 128 -- Exercises 129 -- Part III Routing on the Internet 131 -- 6 Interior Gateway Protocols 133 -- 6.1 Introduction 133 -- 6.2 Distance Vector Protocols 135 -- 6.2.1 Routing Information Protocol 137 -- 6.2.2 Interior Gateway Routing Protocol 141 -- 6.3 Link State Protocols 143 -- 6.3.1 Open Shortest Path First Protocol 144 -- 6.3.2 Intermediate System to Intermediate System Protocol 148 -- References 152 -- Abbreviations/Terminologies 152 -- Questions 153 -- Exercises 155 -- 7 Exterior Gateway Protocol 159 -- 7.1 Introduction 159 -- 7.1.1 Hosts vs Gateways 161 -- 7.1.2 Gateway?]to?]Gateway Protocol 162 -- 7.1.3 Autonomous System 163 -- 7.1.4 Characteristics of EGP 165 -- 7.2 Exterior Gateway Protocol 166 -- 7.2.1 Evolution of EGP Standards 166 -- 7.2.2 EGP Terminology and Topology 166 -- 7.2.3 EGP Operation Model 167 -- 7.3 Border Gateway Protocol 169 -- 7.3.1 Router Connectivity and Terminology 169 -- 7.3.2 Routing Information Base 181 -- 7.3.3 BGP Operation 182 -- 7.3.4 Decision Process 184 -- 7.3.5 Route Selection Process 185 -- References 188 -- Abbreviations/Terminologies 189 -- Questions 190 -- Exercises 191 -- Part IV Other Routing Contexts 195 -- 8 Routing in ATM Networks 197 -- 8.1 Introduction 197 -- 8.1.1 ATM Frames 199 -- 8.1.2 ATM Connection 199 -- 8.1.3 ATM Architecture 203 -- 8.1.4 Service Categories 204 -- 8.2 PNNI Routing 206 -- 8.2.1 PNNI Interface 207 -- 8.2.2 PNNI Hierarchy 207 -- 8.2.3 Building the Network Topology 209 -- 8.2.4 Peer Group Leader 210.
8.2.5 Advertizing Topology 211 -- 8.2.6 Setting up Connection 212 -- References 213 -- Abbreviations/Terminologies 213 -- Questions 214 -- Exercises 216 -- 9 Routing in Cellular Wireless Networks 219 -- 9.1 Introduction 219 -- 9.2 Basics of Cellular Wireless Networks 220 -- 9.3 Resource Allocation 229 -- 9.4 Routing in GSM Networks 231 -- 9.4.1 Architecture 232 -- 9.4.2 Call Routing 234 -- 9.5 Challenges in Mobile Computing 235 -- References 238 -- Abbreviations/Terminologies 240 -- Questions 241 -- Exercises 242 -- 10 Routing in Wireless Ad Hoc Networks 245 -- 10.1 Introduction 245 -- 10.1.1 Basics of Wireless Ad Hoc Networks 248 -- 10.1.2 Issues with Existing Protocols 256 -- 10.2 Table?]Driven (Proactive) Routing Protocols 258 -- 10.3 On?]Demand (Reactive) Routing Protocols 260 -- 10.4 Hybrid Routing Protocols 266 -- 10.5 Hierarchical Routing Protocols 267 -- 10.6 Geographic Routing Protocols 268 -- 10.7 Power?]Aware Routing Protocols 274 -- References 276 -- Abbreviations/Terminologies 278 -- Questions 280 -- Exercises 281 -- 11 Routing in Wireless Sensor Networks 285 -- 11.1 Basics of Wireless Sensor Networks 285 -- 11.1.1 Hardware Architecture of Sensor Node 287 -- 11.1.2 Network Topology 289 -- 11.1.3 Design Factors 290 -- 11.1.4 Classification of Routing Protocol 292 -- 11.2 Routing Challenges in Wireless Sensor Networks 293 -- 11.2.1 Self?]Healing Networks 295 -- 11.2.2 Security Threats 296 -- 11.3 Flat Routing Protocols 297 -- 11.4 Hierarchical Routing Protocols 303 -- 11.5 Location?]Based Routing Protocols 308 -- 11.6 Multipath Routing Protocols 310 -- 11.7 Query?]Based Routing Protocols 312 -- 11.8 Negotiation?]Based Routing Protocols 314 -- 11.9 QoS Routing Protocols 315 -- 11.9.1 Challenges 316 -- 11.9.2 Approach to QoS Routing 316 -- 11.9.3 Protocols 317 -- References 317 -- Abbreviations/Terminologies 321 -- Questions 322 -- Exercises 324 -- 12 Routing in 6LoWPAN 327 -- 12.1 Introduction 327 -- 12.1.1 IP for Smart Objects 328 -- 12.1.2 6LoWPAN 329.
12.1.3 ZigBee 330 -- 12.1.4 ZigBee vs 6LoWPAN 330 -- 12.2 6LoWPAN Fundamentals 331 -- 12.2.1 Architecture 332 -- 12.2.2 Header Format and Compression 332 -- 12.2.3 Network Topology 335 -- 12.2.4 Neighbor Discovery 335 -- 12.2.5 Routing 336 -- 12.3 Interoperability of 6LoWPAN 337 -- 12.4 Applications 338 -- 12.5 Security Considerations and Research Areas 341 -- References 342 -- Abbreviations/Terminologies 345 -- Questions 346 -- Exercises 348 -- Part V Advanced Concepts 349 -- 13 Security in Routing 351 -- 13.1 Introduction 351 -- 13.1.1 Network Sniffer 353 -- 13.1.2 Denial of Service Attack 357 -- 13.1.3 Social Engineering 358 -- 13.1.4 Packet Filtering 359 -- 13.2 Attack Surface 360 -- 13.2.1 Types of Attack Surface 361 -- 13.2.2 Attack Surface and System Resources 361 -- 13.2.3 Attack Surface Metric 362 -- 13.2.4 Reduction in Attack Surface 362 -- 13.3 Networked Battlefield 363 -- 13.4 Mobile Agents 365 -- 13.4.1 Architecture and Framework 368 -- 13.4.2 Life Cycle 369 -- 13.4.3 Challenges 370 -- 13.5 Cognitive Security 370 -- 13.5.1 Solution Concept 371 -- 13.5.2 Cognitive Capabilities 372 -- 13.5.3 General Capabilities 373 -- References 373 -- Abbreviations/Terminologies 374 -- Questions 375 -- Exercises 376 -- 14 Reliability and Fault?]Tolerant and Delay?]Tolerant Routing 377 -- 14.1 Fundamentals of Network Reliability 377 -- 14.1.1 Importance of Reliability Calculation 378 -- 14.1.2 Methods to Calculate the Reliability of a Network 379 -- 14.2 Fault Tolerance 390 -- 14.2.1 Fault?]Tolerant Network 394 -- 14.2.2 Autonomic Network 394 -- 14.3 Network Management for Fault Detection 398 -- 14.3.1 Traditional Network Management 399 -- 14.3.2 Mobile Agent 400 -- 14.3.3 Policy?]Based Network Management 401 -- 14.4 Wireless Tactical Networks 402 -- 14.5 Routing in Delay?]Tolerant Networks 403 -- 14.5.1 Applications 404 -- 14.5.2 Routing Protocols 404 -- References 405 -- Abbreviations/Terminologies 407 -- Questions 408 -- Exercises 409 -- Index 411.
Record Nr. UNINA-9910820909503321
Misra Sudip  
Chichester, West Sussex, England : , : Wiley, , 2017
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
NSX-T logical routing : fortify your understanding to amplify your success / / Shashank Mohan
NSX-T logical routing : fortify your understanding to amplify your success / / Shashank Mohan
Autore Mohan Shashank
Pubbl/distr/stampa Berkeley, CA : , : Apress, , [2022]
Descrizione fisica 1 online resource (311 pages)
Disciplina 005.43
Soggetto topico Virtual computer systems
Routing (Computer network management)
ISBN 1-4842-7458-X
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Chapter 1: Introduction -- Chapter 2: Tunnel Endpoints -- Chapter 3: Remote Tunnel Endpoints -- Chapter 4: Logical Routing -- Chapter 5: Data Plane Availability -- Chapter 6: Datacenter Routing.
Record Nr. UNINA-9910522963803321
Mohan Shashank  
Berkeley, CA : , : Apress, , [2022]
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Path routing in mesh optical networks / / Eric Bouillet ... [et al.]
Path routing in mesh optical networks / / Eric Bouillet ... [et al.]
Pubbl/distr/stampa Chichester, England ; , : John Wiley & Sons, , c2007
Descrizione fisica 1 online resource (299 p.)
Disciplina 621.382
621.382/7
621.3827
Altri autori (Persone) BouilletEric
Soggetto topico Optical communications
Routing (Computer network management)
ISBN 1-281-13523-2
9786611135232
0-470-03298-7
0-470-03297-9
Classificazione 54.32
ZN 6291
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Optical networking -- Recovery in optical networks -- Mesh routing and recovery framework -- Path routing and protection -- Path routing, part I : Complexity -- Path routing, part II : Heuristics -- Enhanced routing model for SBPP services -- Controlling sharing for SBPP services -- Path computation with partial information -- Path reoptimization -- Dimensioning of path-protected mesh networks -- Service availability in path-protected mesh networks.
Record Nr. UNINA-9910144586503321
Chichester, England ; , : John Wiley & Sons, , c2007
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Path routing in mesh optical networks / / Eric Bouillet ... [et al.]
Path routing in mesh optical networks / / Eric Bouillet ... [et al.]
Pubbl/distr/stampa Chichester, England ; , : John Wiley & Sons, , c2007
Descrizione fisica 1 online resource (299 p.)
Disciplina 621.382
621.382/7
621.3827
Altri autori (Persone) BouilletEric
Soggetto topico Optical communications
Routing (Computer network management)
ISBN 1-281-13523-2
9786611135232
0-470-03298-7
0-470-03297-9
Classificazione 54.32
ZN 6291
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Optical networking -- Recovery in optical networks -- Mesh routing and recovery framework -- Path routing and protection -- Path routing, part I : Complexity -- Path routing, part II : Heuristics -- Enhanced routing model for SBPP services -- Controlling sharing for SBPP services -- Path computation with partial information -- Path reoptimization -- Dimensioning of path-protected mesh networks -- Service availability in path-protected mesh networks.
Record Nr. UNINA-9910830273003321
Chichester, England ; , : John Wiley & Sons, , c2007
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Path routing in mesh optical networks / / Eric Bouillet ... [et al.]
Path routing in mesh optical networks / / Eric Bouillet ... [et al.]
Pubbl/distr/stampa Chichester, England ; ; Hoboken, NJ, : John Wiley & Sons, c2007
Descrizione fisica 1 online resource (299 p.)
Disciplina 621.382
621.382/7
621.3827
Altri autori (Persone) BouilletEric
Soggetto topico Optical communications
Routing (Computer network management)
ISBN 1-281-13523-2
9786611135232
0-470-03298-7
0-470-03297-9
Classificazione 54.32
ZN 6291
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Optical networking -- Recovery in optical networks -- Mesh routing and recovery framework -- Path routing and protection -- Path routing, part I : Complexity -- Path routing, part II : Heuristics -- Enhanced routing model for SBPP services -- Controlling sharing for SBPP services -- Path computation with partial information -- Path reoptimization -- Dimensioning of path-protected mesh networks -- Service availability in path-protected mesh networks.
Record Nr. UNINA-9910876621703321
Chichester, England ; ; Hoboken, NJ, : John Wiley & Sons, c2007
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Synergy of peer-to-peer networks and mobile ad-hoc networks [[electronic resource] ] : bootstrapping and routing / / Wei Ding
Synergy of peer-to-peer networks and mobile ad-hoc networks [[electronic resource] ] : bootstrapping and routing / / Wei Ding
Autore Ding Wei <1964->
Pubbl/distr/stampa New York, : Nova Science Publishers, 2010
Descrizione fisica 1 online resource (235 p.)
Disciplina 004.6/52
Soggetto topico Ad hoc networks (Computer networks)
Peer-to-peer architecture (Computer networks)
Routing (Computer network management)
Soggetto genere / forma Electronic books.
ISBN 1-61324-130-5
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNINA-9910461607703321
Ding Wei <1964->  
New York, : Nova Science Publishers, 2010
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Synergy of peer-to-peer networks and mobile ad-hoc networks [[electronic resource] ] : bootstrapping and routing / / Wei Ding
Synergy of peer-to-peer networks and mobile ad-hoc networks [[electronic resource] ] : bootstrapping and routing / / Wei Ding
Autore Ding Wei <1964->
Pubbl/distr/stampa New York, : Nova Science Publishers, 2010
Descrizione fisica 1 online resource (235 p.)
Disciplina 004.6/52
Soggetto topico Ad hoc networks (Computer networks)
Peer-to-peer architecture (Computer networks)
Routing (Computer network management)
ISBN 1-61324-130-5
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Record Nr. UNINA-9910789441603321
Ding Wei <1964->  
New York, : Nova Science Publishers, 2010
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui
Synergy of peer-to-peer networks and mobile ad-hoc networks [[electronic resource] ] : bootstrapping and routing / / Wei Ding
Synergy of peer-to-peer networks and mobile ad-hoc networks [[electronic resource] ] : bootstrapping and routing / / Wei Ding
Autore Ding Wei <1964->
Edizione [1st ed.]
Pubbl/distr/stampa New York, : Nova Science Publishers, 2010
Descrizione fisica 1 online resource (235 p.)
Disciplina 004.6/52
Soggetto topico Ad hoc networks (Computer networks)
Peer-to-peer architecture (Computer networks)
Routing (Computer network management)
ISBN 1-61324-130-5
Formato Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione eng
Nota di contenuto Intro -- SYNERGY OF PEER-TO-PEER SYSTEMS AND MOBILE AD-HOC NETWORKS: BOOTSTRAPPING AND ROUTING -- SYNERGY OF PEER-TO-PEER SYSTEMS AND MOBILE AD-HOC NETWORKS: BOOTSTRAPPING AND ROUTING -- CONTENTS -- PREFACE -- Chapter 1 INTRODUCTION -- 1.1. BACKGROUND -- 1.1.1. P2P Systems -- 1.1.2. Distributed Hash Table -- 1.1.3. Mobile Ad-Hoc -- 1.2. SYNERGIZED P2P SYSTEMS OVER MANETS -- 1.2.1. Bootstrapping -- 1.2.2. Routing -- Chapter 2 PEER-TO-PEER SYSTEMS -- 2.1. P2P MODEL -- 2.2. CLASSIFICATION -- 2.3. UNSTRUCTURED P2P SYSTEMS -- 2.3.1. Centralized Systems -- 2.3.2. Decentralized Systems -- 2.3.3. Semi-decentralized Systems -- 2.4. STRUCTURED P2P SYSTEMS -- 2.4.1. Summary -- 2.4.2. Chord -- 2.4.2.1 Consistent Hashing -- 2.4.2.2 Routing in Chord -- 2.4.2.3 Chord Algorithm and API -- 2.4.3. Pastry -- 2.4.3.1. Pastry Routing Table -- 2.4.3.2. Pastry Routing Protocol -- 2.4.3.3. Node Joining -- 2.4.3.4. Node Failure and Departure -- 2.4.3.5. Locality Properties of Pastry -- 2.4.4. CAN -- 2.4.4.1. Data Structure in CAN -- 2.4.4.2. Routing of CAN -- 2.4.4.3. Fault Tolerance Enhancement -- 2.4.4.4. Bootstrapping of CAN -- 2.4.5. BitTorrent -- Chapter 3 MOBILE AD HOC NETWORKS -- 3.1. DEFINITION AND EVOLUTION -- 3.2. MANETS PROTOCOL STACK -- 3.3. ROUTING IN MANETS -- 3.3.1. Proactive Protocols -- 3.3.2. Reactive Protocols -- 3.3.3. DSR Protocol -- 3.4. BOOTSTRAPPING IN MANETS -- Chapter 4 BOOTSTRAPPING P2P SYSTEMS IN WIRED NETWORKS -- 4.1. T-MAN ⎯ A GOSSIP-BASED APPROACH -- 4.1.1. Gossip Protocol -- 4.1.2. Ranking Function -- 4.1.3. T-Man Protocol -- Initialization -- Active Thread -- Passive Thread -- 4.1.4 The Problem of T-Man -- 4.2. T-CHORD ⎯ AN APPLICATION OF T-MAN -- 4.2.1. Advantages of T-Chord -- 4.2.2. T-Chord Protocol -- 4.2.3. Deficiencies of T-Chord -- 4.3. RING NETWORK -- 4.3.1. Features of Ring Network -- 4.3.2. RN Protocol.
4.3.2.1. Closer Peer Search -- 4.3.2.2. Search Monitor -- 4.3.2.3. Neighbor Update -- 4.3.3. AP Notation -- 4.3.4. RN Algorithm -- 4.3.5. Problems with RN -- Chapter 5 BOOTSTRAPPING SYNERGISED SYSTEMS -- 5.1. INTRODUCTION -- 5.1.1. Fundamentality of Overlay Topology -- 5.1.2. Current Status -- 5.2. PREVIOUS WORKS ON STRUCTURED P2P SYSTEMS OVER MANETS -- 5.3. SPECIAL ISSUES ON P2P SYSTEMS OVER MANETS -- 5.3.1. Neighbor Relation -- 5.3.2. Substituent of IP Address -- 5.3.3. Connected Component -- 5.3.4. Proximity -- 5.3.5. Comprehensiveness -- Chapter 6 RAN PROTOCOL -- 6.1. RAN ⎯ AN OPTIMAL AND REALISTIC APPROACH -- 6.1.1. Design Goals and Assumptions -- 6.1.2. Component Tree -- 6.2. THREE PATTERNS -- 6.2.1. Distributed Exhaustive Pattern -- Theorem 6.1. -- Theorem 6.2. -- Theorem 6.3. -- 6.2.2. Virtual Centralized Exhaustive Pattern -- 6.2.3. Random Pattern -- Theorem 6.4. -- 6.3. TWO OPTIONS -- 6.3.1. Approximation Option -- 6.3.2. Multicast Option -- 6.4. RAN ALGORITHMS -- 6.4.1. Distributed Exhaustive Pattern -- 6.4.1.1. Message Format -- 6.4.1.2. Algorithm -- Library Function -- Action -- 6.4.2. Virtual Centralized Exhaustive Pattern -- 6.4.2.1. Message Format -- 6.4.2.2. Algorithm -- Library Function -- Action -- 6.4.3. Virtual Centralized Exhaustive Pattern with Multicast Option -- 6.4.3.1. Message Format -- 6.4.3.2. Algorithm -- Library Function -- Action -- 6.4.4. Random Pattern -- 6.4.4.1. Discussion about Random Pattern -- 6.4.4.2. Random Pattern Message Format -- 6.4.4.3. Random Pattern Algorithm -- Library Function -- Action -- 6.5. SIMULATION -- 6.5.1. Completeness -- 6.5.2. Time -- 6.5.3. Message Complexity -- 6.5.4. Analysis of Simulation Results -- Chapter 7 MRAN PROTOCOL -- 7.1. DISTURBANCE FROM MOBILITY -- 7.1.1. Lost Branch -- 7.1.2. Hidden Parents -- 7.1.3. Definitely Lost Nodes -- 7.2. POSSIBLE SOLUTIONS.
7.3. MRAN DATA STRUCTURE -- 7.4. MRAN ALGORITHM -- 7.5. SIMULATION -- Chapter 8 DYNAMIC P2P SOURCE ROUTING -- 8.1. INTRODUCTION -- 8.2. DPSR DESIGN -- 8.3. ROUTING IN DPSR -- 8.4. NODE JOINING, DEPARTURE, AND FAILURE IN DPSR -- 8.5. OPTIMIZATION -- 8.6. POSSIBLE IMPROVEMENT TO PASTRY ALGORITHMS -- 8.7. SCALABILITY -- Chapter 9 EKTA -- 9.1. TWO DESIGN APPROACHES TO OVERLAY A DHT -- 9.2. ROUTING IN EKTA -- 9.3. EKTA IMPLEMENTATION -- 9.3.1. Packet Structure -- 9.3.2. Routing Algorithm -- 9.4. SIMULATION: INTEGRATION VS. LAYERED APPROACH -- 9.4.1. Setting of Simulation -- 9.4.2. Ekta vs. Layered-Path -- 9.4.3 Ekta vs. Layered-Link -- 9.5. APPLICATION LAYER SIMULATION: RESOURCE DISCOVERY -- 9.5.1. Design Options -- 9.5.2. Analysis -- 9.5.3. Evaluation -- 9.5.4. Effects of Request Rates and Mobility -- 9.5.5. Effects of Network Size -- Chapter 10 VIRTUAL RING ROUTING -- 10.1. INTRODUCTION -- 10.2 RELATED WORKS -- 10.2.1. Classification -- 10.2.2. In Lines of DHT-based Routing Protocols -- 10.2.3. In Lines of Wireless Networks -- 10.3. VRR OVERVIEW -- 10.4. ROUTING IN VRR -- 10.4.1. Routing States and Forwarding -- 10.4.2. Node Joining -- 10.4.3. Node and Link Failures -- 10.4.3.1. Failure Detection -- 10.4.3.2. Recovery from Node Failures -- 10.4.3.3. Recovery from Link Failures -- 10.4.4. Network Partitions -- 10.5. SIMULATION -- 10.5.1. Setup Simulator -- 10.5.2. Performance with Increasing Traffic -- 10.5.3. Performance with Increasing Network Size -- 10.5.4. Performance with Short-Lived Flows -- 10.5.4. Performance with Short-Lived Flows -- 10.5.5. Locality and Stretch -- 10.6. SENSOR NETWORK TESTBED -- 10.6.1. Beacon Vector Routing -- 10.6.2. Setup -- 10.6.3. Performance -- 10.7. WLAN TESTBED -- 10.7.1. Setup -- 10.7.2. Performance -- Chapter 11 PEERNET: A LOCALIZATION BASED APPROACH -- 11.1. OVERVIEW -- 11.2. NETWORK LAYER IN PEERNET.
11.3. BINARY ADDRESS TREE -- 11.4. ADDRESS ALLOCATION -- 11.5. ROUTING -- 11.6. NODE LOOKUP SERVICE -- 11.6.1. Mapping Entries to Nodes -- 11.6.2. Disturbance from Mobility -- 11.6.3. Solutions to Mobility Problem -- 11.6.4. PeerNet for Multicasting -- 11.7. UNSOLVED ISSUES -- Chapter 12 HIERARCHICAL APPROACHES - SAFARI ARCHITECTURE -- 12.1. INTRODUCTION -- 12.2. HIERARCHICAL ROUTING -- 12.3. SAFARI ARCHITECTURE -- 12.4. DESIGN ROADMAP OF MASAI -- 12.4.1. Cell Membership Algorithm -- 12.4.2. Beaconing Protocol -- 12.4.3. Drum Level Selection Algorithm -- 12.4.4. Scalable Routing Protocol -- 12.4.4.1. Inter-Cell Routing -- 12.4.4.2. An Example of Inter-Cell Routing -- 12.4.4.3. Route Repair -- 12.4.4.4. Intra-Cell Routing -- 12.4.5. Merge of Networks -- 12.5. PERFORMANCE COMPARISON -- 12.5.1. Configuration of Simulation -- 12.5.2. Scalability Performance -- 12.5.2.1. Delivery Latency -- 12.5.2.2. Routing Overhead -- 12.5.2.3. PDR -- 12.5.2.4. Average Path Length -- 12.5.3. Simulation on Mobility -- 12.5.4. Simulation on Traffic Load -- 12.5.5. Simulation on Bootstrapping -- INDEX -- BIBLIOGRAPHY -- Blank Page.
Record Nr. UNINA-9910818120303321
Ding Wei <1964->  
New York, : Nova Science Publishers, 2010
Materiale a stampa
Lo trovi qui: Univ. Federico II
Opac: Controlla la disponibilità qui