|
|
|
|
| LEADER |
00000cam a2200000 a 4500 |
| 001 |
ocn729253181 |
| 003 |
OCoLC |
| 005 |
20240809213013.0 |
| 006 |
m o d |
| 007 |
cr cnu---unuuu |
| 008 |
110606s2010 nyua ob 001 0 eng d |
| 040 |
|
|
|a N$T
|b eng
|e pn
|c N$T
|d OCLCQ
|d YDXCP
|d E7B
|d OCLCF
|d OCLCQ
|d NLGGC
|d EBLCP
|d OCLCQ
|d DEBSZ
|d OCLCQ
|d AZK
|d MERUC
|d AGLDB
|d ICA
|d MOR
|d PIFAG
|d ZCU
|d OCLCQ
|d U3W
|d D6H
|d STF
|d WRM
|d VTS
|d NRAMU
|d ICG
|d INT
|d AU@
|d OCLCQ
|d DKC
|d OCLCQ
|d M8D
|d OCLCQ
|d UKCRE
|d AJS
|d OCLCQ
|d OCLCO
|d OCLCQ
|d OCLCO
|d OCLCL
|
| 019 |
|
|
|a 961549960
|a 962685248
|a 988417519
|a 991920438
|a 1037931910
|a 1038632214
|a 1045500530
|a 1153466985
|
| 020 |
|
|
|a 9781613241301
|q (electronic bk.)
|
| 020 |
|
|
|a 1613241305
|q (electronic bk.)
|
| 020 |
|
|
|z 9781608769513
|
| 020 |
|
|
|z 1608769518
|
| 035 |
|
|
|a (OCoLC)729253181
|z (OCoLC)961549960
|z (OCoLC)962685248
|z (OCoLC)988417519
|z (OCoLC)991920438
|z (OCoLC)1037931910
|z (OCoLC)1038632214
|z (OCoLC)1045500530
|z (OCoLC)1153466985
|
| 050 |
|
4 |
|a TK5105.77
|b .D558 2010eb
|
| 072 |
|
7 |
|a COM
|x 043000
|2 bisacsh
|
| 049 |
|
|
|a HCDD
|
| 100 |
1 |
|
|a Ding, Wei,
|d 1964-
|1 https://id.oclc.org/worldcat/entity/E39PCjvGR4fYVjg4qWvTJWDwmd
|
| 245 |
1 |
0 |
|a Synergy of peer-to-peer networks and mobile ad-hoc networks :
|b boot strapping and routing /
|c Wei Ding.
|
| 260 |
|
|
|a New York :
|b Nova Science,
|c ©2010.
|
| 300 |
|
|
|a 1 online resource (ix, 223 pages) :
|b illustrations (some color)
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 504 |
|
|
|a Includes bibliographical references and index.
|
| 588 |
0 |
|
|a Print version record.
|
| 505 |
0 |
|
|a 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.
|
| 505 |
8 |
|
|a 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.
|
| 505 |
8 |
|
|a 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.
|
| 505 |
8 |
|
|a 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.
|
| 505 |
8 |
|
|a 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.
|
| 650 |
|
0 |
|a Ad hoc networks (Computer networks)
|
| 650 |
|
0 |
|a Peer-to-peer architecture (Computer networks)
|
| 650 |
|
0 |
|a Routing (Computer network management)
|
| 650 |
|
7 |
|a COMPUTERS
|x Networking
|x General.
|2 bisacsh
|
| 650 |
|
7 |
|a Ad hoc networks (Computer networks)
|2 fast
|
| 650 |
|
7 |
|a Peer-to-peer architecture (Computer networks)
|2 fast
|
| 650 |
|
7 |
|a Routing (Computer network management)
|2 fast
|
| 776 |
0 |
8 |
|i Print version:
|a Ding, Wei, 1964-
|t Synergy of peer-to-peer networks and mobile ad-hoc networks.
|d New York : Nova Science, ©2010
|z 9781608769513
|w (DLC) 2010001179
|w (OCoLC)496955221
|
| 856 |
4 |
0 |
|u https://ebookcentral.proquest.com/lib/holycrosscollege-ebooks/detail.action?docID=3019710
|y Click for online access
|
| 903 |
|
|
|a EBC-AC
|
| 994 |
|
|
|a 92
|b HCD
|