| 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 |
Info
Synergy of peer-to-peer networks and mobile ad-hoc networks [[electronic resource] ] : bootstrapping and routing / / Wei Ding
