Synergy of peer-to-peer networks and mobile ad-hoc networks :: boot strapping and routing /
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
New York :
Nova Science,
©2010.
|
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Beschreibung: | 1 online resource (ix, 223 pages) : illustrations (some color) |
| Bibliographie: | Includes bibliographical references and index. |
| ISBN: | 9781613241301 1613241305 |
Internformat
MARC
| LEADER | 00000cam a2200000 a 4500 | ||
|---|---|---|---|
| 001 | ZDB-4-EBA-ocn729253181 | ||
| 003 | OCoLC | ||
| 005 | 20241004212047.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 | |
| 082 | 7 | |a 004.6/52 |2 22 | |
| 049 | |a MAIN | ||
| 100 | 1 | |a Ding, Wei, |d 1964- |1 https://id.oclc.org/worldcat/entity/E39PCjvGR4fYVjg4qWvTJWDwmd |0 http://id.loc.gov/authorities/names/n2009011339 | |
| 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) |0 http://id.loc.gov/authorities/subjects/sh2007004723 | |
| 650 | 0 | |a Peer-to-peer architecture (Computer networks) |0 http://id.loc.gov/authorities/subjects/sh2001003097 | |
| 650 | 0 | |a Routing (Computer network management) |0 http://id.loc.gov/authorities/subjects/sh2006000147 | |
| 650 | 6 | |a Réseaux ad hoc (Réseaux d'ordinateurs) | |
| 650 | 6 | |a P2P (Réseaux d'ordinateurs) | |
| 650 | 6 | |a Routage (Gestion des réseaux d'ordinateurs) | |
| 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 | |l FWS01 |p ZDB-4-EBA |q FWS_PDA_EBA |u https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=368637 |3 Volltext |
| 938 | |a ProQuest Ebook Central |b EBLB |n EBL3019710 | ||
| 938 | |a ebrary |b EBRY |n ebr10671275 | ||
| 938 | |a EBSCOhost |b EBSC |n 368637 | ||
| 938 | |a YBP Library Services |b YANK |n 6929917 | ||
| 994 | |a 92 |b GEBAY | ||
| 912 | |a ZDB-4-EBA | ||
| 049 | |a DE-863 | ||
Datensatz im Suchindex
| DE-BY-FWS_katkey | ZDB-4-EBA-ocn729253181 |
|---|---|
| _version_ | 1816881761342193664 |
| adam_text | |
| any_adam_object | |
| author | Ding, Wei, 1964- |
| author_GND | http://id.loc.gov/authorities/names/n2009011339 |
| author_facet | Ding, Wei, 1964- |
| author_role | |
| author_sort | Ding, Wei, 1964- |
| author_variant | w d wd |
| building | Verbundindex |
| bvnumber | localFWS |
| callnumber-first | T - Technology |
| callnumber-label | TK5105 |
| callnumber-raw | TK5105.77 .D558 2010eb |
| callnumber-search | TK5105.77 .D558 2010eb |
| callnumber-sort | TK 45105.77 D558 42010EB |
| callnumber-subject | TK - Electrical and Nuclear Engineering |
| collection | ZDB-4-EBA |
| 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. |
| ctrlnum | (OCoLC)729253181 |
| dewey-full | 004.6/52 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 004 - Computer science |
| dewey-raw | 004.6/52 |
| dewey-search | 004.6/52 |
| dewey-sort | 14.6 252 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>05880cam a2200601 a 4500</leader><controlfield tag="001">ZDB-4-EBA-ocn729253181</controlfield><controlfield tag="003">OCoLC</controlfield><controlfield tag="005">20241004212047.0</controlfield><controlfield tag="006">m o d </controlfield><controlfield tag="007">cr cnu---unuuu</controlfield><controlfield tag="008">110606s2010 nyua ob 001 0 eng d</controlfield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">N$T</subfield><subfield code="b">eng</subfield><subfield code="e">pn</subfield><subfield code="c">N$T</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">YDXCP</subfield><subfield code="d">E7B</subfield><subfield code="d">OCLCF</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">NLGGC</subfield><subfield code="d">EBLCP</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">DEBSZ</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">AZK</subfield><subfield code="d">MERUC</subfield><subfield code="d">AGLDB</subfield><subfield code="d">ICA</subfield><subfield code="d">MOR</subfield><subfield code="d">PIFAG</subfield><subfield code="d">ZCU</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">U3W</subfield><subfield code="d">D6H</subfield><subfield code="d">STF</subfield><subfield code="d">WRM</subfield><subfield code="d">VTS</subfield><subfield code="d">NRAMU</subfield><subfield code="d">ICG</subfield><subfield code="d">INT</subfield><subfield code="d">AU@</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">DKC</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">M8D</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">UKCRE</subfield><subfield code="d">AJS</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCL</subfield></datafield><datafield tag="019" ind1=" " ind2=" "><subfield code="a">961549960</subfield><subfield code="a">962685248</subfield><subfield code="a">988417519</subfield><subfield code="a">991920438</subfield><subfield code="a">1037931910</subfield><subfield code="a">1038632214</subfield><subfield code="a">1045500530</subfield><subfield code="a">1153466985</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781613241301</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1613241305</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9781608769513</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">1608769518</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)729253181</subfield><subfield code="z">(OCoLC)961549960</subfield><subfield code="z">(OCoLC)962685248</subfield><subfield code="z">(OCoLC)988417519</subfield><subfield code="z">(OCoLC)991920438</subfield><subfield code="z">(OCoLC)1037931910</subfield><subfield code="z">(OCoLC)1038632214</subfield><subfield code="z">(OCoLC)1045500530</subfield><subfield code="z">(OCoLC)1153466985</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">TK5105.77</subfield><subfield code="b">.D558 2010eb</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">COM</subfield><subfield code="x">043000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="082" ind1="7" ind2=" "><subfield code="a">004.6/52</subfield><subfield code="2">22</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">MAIN</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Ding, Wei,</subfield><subfield code="d">1964-</subfield><subfield code="1">https://id.oclc.org/worldcat/entity/E39PCjvGR4fYVjg4qWvTJWDwmd</subfield><subfield code="0">http://id.loc.gov/authorities/names/n2009011339</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Synergy of peer-to-peer networks and mobile ad-hoc networks :</subfield><subfield code="b">boot strapping and routing /</subfield><subfield code="c">Wei Ding.</subfield></datafield><datafield tag="260" ind1=" " ind2=" "><subfield code="a">New York :</subfield><subfield code="b">Nova Science,</subfield><subfield code="c">©2010.</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (ix, 223 pages) :</subfield><subfield code="b">illustrations (some color)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="504" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references and index.</subfield></datafield><datafield tag="588" ind1="0" ind2=" "><subfield code="a">Print version record.</subfield></datafield><datafield tag="505" ind1="0" ind2=" "><subfield code="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.</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="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.</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="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.</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="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.</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="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.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Ad hoc networks (Computer networks)</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh2007004723</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Peer-to-peer architecture (Computer networks)</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh2001003097</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Routing (Computer network management)</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh2006000147</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Réseaux ad hoc (Réseaux d'ordinateurs)</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">P2P (Réseaux d'ordinateurs)</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Routage (Gestion des réseaux d'ordinateurs)</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS</subfield><subfield code="x">Networking</subfield><subfield code="x">General.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Ad hoc networks (Computer networks)</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Peer-to-peer architecture (Computer networks)</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Routing (Computer network management)</subfield><subfield code="2">fast</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Print version:</subfield><subfield code="a">Ding, Wei, 1964-</subfield><subfield code="t">Synergy of peer-to-peer networks and mobile ad-hoc networks.</subfield><subfield code="d">New York : Nova Science, ©2010</subfield><subfield code="z">9781608769513</subfield><subfield code="w">(DLC) 2010001179</subfield><subfield code="w">(OCoLC)496955221</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="l">FWS01</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FWS_PDA_EBA</subfield><subfield code="u">https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=368637</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ProQuest Ebook Central</subfield><subfield code="b">EBLB</subfield><subfield code="n">EBL3019710</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ebrary</subfield><subfield code="b">EBRY</subfield><subfield code="n">ebr10671275</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">EBSCOhost</subfield><subfield code="b">EBSC</subfield><subfield code="n">368637</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">6929917</subfield></datafield><datafield tag="994" ind1=" " ind2=" "><subfield code="a">92</subfield><subfield code="b">GEBAY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-4-EBA</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-863</subfield></datafield></record></collection> |
| id | ZDB-4-EBA-ocn729253181 |
| illustrated | Illustrated |
| indexdate | 2024-11-27T13:17:51Z |
| institution | BVB |
| isbn | 9781613241301 1613241305 |
| language | English |
| oclc_num | 729253181 |
| open_access_boolean | |
| owner | MAIN DE-863 DE-BY-FWS |
| owner_facet | MAIN DE-863 DE-BY-FWS |
| physical | 1 online resource (ix, 223 pages) : illustrations (some color) |
| psigel | ZDB-4-EBA |
| publishDate | 2010 |
| publishDateSearch | 2010 |
| publishDateSort | 2010 |
| publisher | Nova Science, |
| record_format | marc |
| spelling | Ding, Wei, 1964- https://id.oclc.org/worldcat/entity/E39PCjvGR4fYVjg4qWvTJWDwmd http://id.loc.gov/authorities/names/n2009011339 Synergy of peer-to-peer networks and mobile ad-hoc networks : boot strapping and routing / Wei Ding. New York : Nova Science, ©2010. 1 online resource (ix, 223 pages) : illustrations (some color) text txt rdacontent computer c rdamedia online resource cr rdacarrier Includes bibliographical references and index. Print version record. 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. Ad hoc networks (Computer networks) http://id.loc.gov/authorities/subjects/sh2007004723 Peer-to-peer architecture (Computer networks) http://id.loc.gov/authorities/subjects/sh2001003097 Routing (Computer network management) http://id.loc.gov/authorities/subjects/sh2006000147 Réseaux ad hoc (Réseaux d'ordinateurs) P2P (Réseaux d'ordinateurs) Routage (Gestion des réseaux d'ordinateurs) COMPUTERS Networking General. bisacsh Ad hoc networks (Computer networks) fast Peer-to-peer architecture (Computer networks) fast Routing (Computer network management) fast Print version: Ding, Wei, 1964- Synergy of peer-to-peer networks and mobile ad-hoc networks. New York : Nova Science, ©2010 9781608769513 (DLC) 2010001179 (OCoLC)496955221 FWS01 ZDB-4-EBA FWS_PDA_EBA https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=368637 Volltext |
| spellingShingle | Ding, Wei, 1964- Synergy of peer-to-peer networks and mobile ad-hoc networks : boot strapping and routing / 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. Ad hoc networks (Computer networks) http://id.loc.gov/authorities/subjects/sh2007004723 Peer-to-peer architecture (Computer networks) http://id.loc.gov/authorities/subjects/sh2001003097 Routing (Computer network management) http://id.loc.gov/authorities/subjects/sh2006000147 Réseaux ad hoc (Réseaux d'ordinateurs) P2P (Réseaux d'ordinateurs) Routage (Gestion des réseaux d'ordinateurs) COMPUTERS Networking General. bisacsh Ad hoc networks (Computer networks) fast Peer-to-peer architecture (Computer networks) fast Routing (Computer network management) fast |
| subject_GND | http://id.loc.gov/authorities/subjects/sh2007004723 http://id.loc.gov/authorities/subjects/sh2001003097 http://id.loc.gov/authorities/subjects/sh2006000147 |
| title | Synergy of peer-to-peer networks and mobile ad-hoc networks : boot strapping and routing / |
| title_auth | Synergy of peer-to-peer networks and mobile ad-hoc networks : boot strapping and routing / |
| title_exact_search | Synergy of peer-to-peer networks and mobile ad-hoc networks : boot strapping and routing / |
| title_full | Synergy of peer-to-peer networks and mobile ad-hoc networks : boot strapping and routing / Wei Ding. |
| title_fullStr | Synergy of peer-to-peer networks and mobile ad-hoc networks : boot strapping and routing / Wei Ding. |
| title_full_unstemmed | Synergy of peer-to-peer networks and mobile ad-hoc networks : boot strapping and routing / Wei Ding. |
| title_short | Synergy of peer-to-peer networks and mobile ad-hoc networks : |
| title_sort | synergy of peer to peer networks and mobile ad hoc networks boot strapping and routing |
| title_sub | boot strapping and routing / |
| topic | Ad hoc networks (Computer networks) http://id.loc.gov/authorities/subjects/sh2007004723 Peer-to-peer architecture (Computer networks) http://id.loc.gov/authorities/subjects/sh2001003097 Routing (Computer network management) http://id.loc.gov/authorities/subjects/sh2006000147 Réseaux ad hoc (Réseaux d'ordinateurs) P2P (Réseaux d'ordinateurs) Routage (Gestion des réseaux d'ordinateurs) COMPUTERS Networking General. bisacsh Ad hoc networks (Computer networks) fast Peer-to-peer architecture (Computer networks) fast Routing (Computer network management) fast |
| topic_facet | Ad hoc networks (Computer networks) Peer-to-peer architecture (Computer networks) Routing (Computer network management) Réseaux ad hoc (Réseaux d'ordinateurs) P2P (Réseaux d'ordinateurs) Routage (Gestion des réseaux d'ordinateurs) COMPUTERS Networking General. |
| url | https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=368637 |
| work_keys_str_mv | AT dingwei synergyofpeertopeernetworksandmobileadhocnetworksbootstrappingandrouting |