Limit search to available items
Book Cover
E-book
Author Ding, Wei, 1964-

Title Synergy of peer-to-peer networks and mobile ad-hoc networks : boot strapping and routing / Wei Ding
Published New York : Nova Science, ©2010

Copies

Description 1 online resource (ix, 223 pages) : illustrations (some color)
Contents SYNERGY OF PEER-TO-PEER SYSTEMS AND MOBILE AD-HOC NETWORKS:; BOOTSTRAPPING AND ROUTING; CONTENTS; PREFACE; 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; 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 API2.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; 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
BOOTSTRAPPING P2P SYSTEMS IN WIRED NETWORKS4.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
BOOTSTRAPPING SYNERGISED SYSTEMS5.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; 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 Pattern6.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; 6.4.2. Virtual Centralized Exhaustive Pattern; 6.4.2.1. Message Format; 6.4.2.2. Algorithm; 6.4.3. Virtual Centralized Exhaustive Pattern with Multicast Option; 6.4.3.1. Message Format; 6.4.3.2. Algorithm; 6.4.4. Random Pattern; 6.4.4.1. Discussion about Random Pattern; 6.4.4.2. Random Pattern Message Format
Bibliography Includes bibliographical references and index
Notes Print version record
Subject Ad hoc networks (Computer networks)
Peer-to-peer architecture (Computer networks)
Routing (Computer network management)
COMPUTERS -- Networking -- General.
Ad hoc networks (Computer networks)
Peer-to-peer architecture (Computer networks)
Routing (Computer network management)
Form Electronic book
ISBN 9781613241301
1613241305