GFS-Btree: A Scalable Peer-to-Peer Overlay Network for Lookup Service View Full Text


Ontology type: schema:Chapter     


Chapter Info

DATE

2004

AUTHORS

Qinghu Li , Jianmin Wang , Jiaguang Sun

ABSTRACT

A fundamental problem that confronts peer-to-peer applications is to efficiently locate the node that stores a particular data item. We propose a new scalable Peer-to-Peer overlay network, GFS-Btree, which is resembling a Btree network. By adding additional linkages to Btree, GFS-Btree can relieve the congestion at the root and the other branch nodes. The events of a node joining and leaving the GFS-Btree system require no global coordination and require maximally O(logn) nodes to change their state. Lookup routing is achievable on GFS-Btree network in O(logn) hops with O(1) connection cost. More... »

PAGES

340-347

Identifiers

URI

http://scigraph.springernature.com/pub.10.1007/978-3-540-24679-4_68

DOI

http://dx.doi.org/10.1007/978-3-540-24679-4_68

DIMENSIONS

https://app.dimensions.ai/details/publication/pub.1026289026


Indexing Status Check whether this publication has been indexed by Scopus and Web Of Science using the SN Indexing Status Tool
Incoming Citations Browse incoming citations for this publication using opencitations.net

JSON-LD is the canonical representation for SciGraph data.

TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

[
  {
    "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
    "about": [
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/10", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Technology", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/1005", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Communications Technologies", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Department of Computer Science & Technology, Tsinghua University, Beijing, China", 
          "id": "http://www.grid.ac/institutes/grid.12527.33", 
          "name": [
            "Department of Computer Science & Technology, Tsinghua University, Beijing, China"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Li", 
        "givenName": "Qinghu", 
        "id": "sg:person.016443220153.06", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016443220153.06"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "School of Software, Tsinghua University, Beijing, China", 
          "id": "http://www.grid.ac/institutes/grid.12527.33", 
          "name": [
            "School of Software, Tsinghua University, Beijing, China"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Wang", 
        "givenName": "Jianmin", 
        "id": "sg:person.012303351315.43", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012303351315.43"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "School of Software, Tsinghua University, Beijing, China", 
          "id": "http://www.grid.ac/institutes/grid.12527.33", 
          "name": [
            "School of Software, Tsinghua University, Beijing, China"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Sun", 
        "givenName": "Jiaguang", 
        "id": "sg:person.011411464635.59", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011411464635.59"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "2004", 
    "datePublishedReg": "2004-01-01", 
    "description": "A fundamental problem that confronts peer-to-peer applications is to efficiently locate the node that stores a particular data item. We propose a new scalable Peer-to-Peer overlay network, GFS-Btree, which is resembling a Btree network. By adding additional linkages to Btree, GFS-Btree can relieve the congestion at the root and the other branch nodes. The events of a node joining and leaving the GFS-Btree system require no global coordination and require maximally O(logn) nodes to change their state. Lookup routing is achievable on GFS-Btree network in O(logn) hops with O(1) connection cost.", 
    "editor": [
      {
        "familyName": "Li", 
        "givenName": "Minglu", 
        "type": "Person"
      }, 
      {
        "familyName": "Sun", 
        "givenName": "Xian-He", 
        "type": "Person"
      }, 
      {
        "familyName": "Deng", 
        "givenName": "Qian-ni", 
        "type": "Person"
      }, 
      {
        "familyName": "Ni", 
        "givenName": "Jun", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/978-3-540-24679-4_68", 
    "inLanguage": "en", 
    "isAccessibleForFree": false, 
    "isPartOf": {
      "isbn": [
        "978-3-540-21988-0", 
        "978-3-540-24679-4"
      ], 
      "name": "Grid and Cooperative Computing", 
      "type": "Book"
    }, 
    "keywords": [
      "peer overlay networks", 
      "scalable peer", 
      "overlay network", 
      "particular data item", 
      "lookup service", 
      "peer applications", 
      "data items", 
      "fundamental problem", 
      "global coordination", 
      "network", 
      "connection cost", 
      "nodes", 
      "branch nodes", 
      "peers", 
      "Btree", 
      "routing", 
      "services", 
      "congestion", 
      "applications", 
      "cost", 
      "system", 
      "coordination", 
      "items", 
      "additional linkages", 
      "state", 
      "events", 
      "linkage", 
      "roots", 
      "problem"
    ], 
    "name": "GFS-Btree: A Scalable Peer-to-Peer Overlay Network for Lookup Service", 
    "pagination": "340-347", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1026289026"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/978-3-540-24679-4_68"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/978-3-540-24679-4_68", 
      "https://app.dimensions.ai/details/publication/pub.1026289026"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-05-20T07:44", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20220519/entities/gbq_results/chapter/chapter_241.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/978-3-540-24679-4_68"
  }
]
 

Download the RDF metadata as:  json-ld nt turtle xml License info

HOW TO GET THIS DATA PROGRAMMATICALLY:

JSON-LD is a popular format for linked data which is fully compatible with JSON.

curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/978-3-540-24679-4_68'

N-Triples is a line-based linked data format ideal for batch operations.

curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/978-3-540-24679-4_68'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-540-24679-4_68'

RDF/XML is a standard XML format for linked data.

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/978-3-540-24679-4_68'


 

This table displays all metadata directly associated to this object as RDF triples.

120 TRIPLES      23 PREDICATES      55 URIs      48 LITERALS      7 BLANK NODES

Subject Predicate Object
1 sg:pub.10.1007/978-3-540-24679-4_68 schema:about anzsrc-for:10
2 anzsrc-for:1005
3 schema:author N8d17b9d3426d47b8a5aaf7034c5d4b35
4 schema:datePublished 2004
5 schema:datePublishedReg 2004-01-01
6 schema:description A fundamental problem that confronts peer-to-peer applications is to efficiently locate the node that stores a particular data item. We propose a new scalable Peer-to-Peer overlay network, GFS-Btree, which is resembling a Btree network. By adding additional linkages to Btree, GFS-Btree can relieve the congestion at the root and the other branch nodes. The events of a node joining and leaving the GFS-Btree system require no global coordination and require maximally O(logn) nodes to change their state. Lookup routing is achievable on GFS-Btree network in O(logn) hops with O(1) connection cost.
7 schema:editor N547e80936a594c889747fe064fec6a23
8 schema:genre chapter
9 schema:inLanguage en
10 schema:isAccessibleForFree false
11 schema:isPartOf Nb712ca8f2f664d15a950586bbb40a647
12 schema:keywords Btree
13 additional linkages
14 applications
15 branch nodes
16 congestion
17 connection cost
18 coordination
19 cost
20 data items
21 events
22 fundamental problem
23 global coordination
24 items
25 linkage
26 lookup service
27 network
28 nodes
29 overlay network
30 particular data item
31 peer applications
32 peer overlay networks
33 peers
34 problem
35 roots
36 routing
37 scalable peer
38 services
39 state
40 system
41 schema:name GFS-Btree: A Scalable Peer-to-Peer Overlay Network for Lookup Service
42 schema:pagination 340-347
43 schema:productId N30181dca0afe4907b8a14ee101761956
44 N530ab4e633084172be6e6f7eea2ba2e9
45 schema:publisher N64598da942044600ac8432a1ac00c3e6
46 schema:sameAs https://app.dimensions.ai/details/publication/pub.1026289026
47 https://doi.org/10.1007/978-3-540-24679-4_68
48 schema:sdDatePublished 2022-05-20T07:44
49 schema:sdLicense https://scigraph.springernature.com/explorer/license/
50 schema:sdPublisher Na3c7dc190c9346ada77dca31d9d7f63a
51 schema:url https://doi.org/10.1007/978-3-540-24679-4_68
52 sgo:license sg:explorer/license/
53 sgo:sdDataset chapters
54 rdf:type schema:Chapter
55 N30181dca0afe4907b8a14ee101761956 schema:name doi
56 schema:value 10.1007/978-3-540-24679-4_68
57 rdf:type schema:PropertyValue
58 N530ab4e633084172be6e6f7eea2ba2e9 schema:name dimensions_id
59 schema:value pub.1026289026
60 rdf:type schema:PropertyValue
61 N547e80936a594c889747fe064fec6a23 rdf:first Nc0e17885da6e4e58ac96987a22e9ec25
62 rdf:rest N787f609a3ba94e4fa3afe4216d1688f9
63 N622bd6ee144f46049ff72bab3ce446be rdf:first sg:person.011411464635.59
64 rdf:rest rdf:nil
65 N64598da942044600ac8432a1ac00c3e6 schema:name Springer Nature
66 rdf:type schema:Organisation
67 N68079a6aa09f40529fe2d5896626c41e schema:familyName Deng
68 schema:givenName Qian-ni
69 rdf:type schema:Person
70 N787f609a3ba94e4fa3afe4216d1688f9 rdf:first Ncf0ba1c6edb54c34950c6db9c8f7152c
71 rdf:rest Nb2be9fd3c88b433ab6e65cc6d42bfb5b
72 N8d17b9d3426d47b8a5aaf7034c5d4b35 rdf:first sg:person.016443220153.06
73 rdf:rest Nf6b47c95c7a44fdf8d1b564c60cc1bfb
74 Na3c7dc190c9346ada77dca31d9d7f63a schema:name Springer Nature - SN SciGraph project
75 rdf:type schema:Organization
76 Nb2be9fd3c88b433ab6e65cc6d42bfb5b rdf:first N68079a6aa09f40529fe2d5896626c41e
77 rdf:rest Ncc78180138a6456687f4083402922459
78 Nb712ca8f2f664d15a950586bbb40a647 schema:isbn 978-3-540-21988-0
79 978-3-540-24679-4
80 schema:name Grid and Cooperative Computing
81 rdf:type schema:Book
82 Nc0e17885da6e4e58ac96987a22e9ec25 schema:familyName Li
83 schema:givenName Minglu
84 rdf:type schema:Person
85 Ncc78180138a6456687f4083402922459 rdf:first Ndd905b64d2f1451da214c0c723ee5a68
86 rdf:rest rdf:nil
87 Ncf0ba1c6edb54c34950c6db9c8f7152c schema:familyName Sun
88 schema:givenName Xian-He
89 rdf:type schema:Person
90 Ndd905b64d2f1451da214c0c723ee5a68 schema:familyName Ni
91 schema:givenName Jun
92 rdf:type schema:Person
93 Nf6b47c95c7a44fdf8d1b564c60cc1bfb rdf:first sg:person.012303351315.43
94 rdf:rest N622bd6ee144f46049ff72bab3ce446be
95 anzsrc-for:10 schema:inDefinedTermSet anzsrc-for:
96 schema:name Technology
97 rdf:type schema:DefinedTerm
98 anzsrc-for:1005 schema:inDefinedTermSet anzsrc-for:
99 schema:name Communications Technologies
100 rdf:type schema:DefinedTerm
101 sg:person.011411464635.59 schema:affiliation grid-institutes:grid.12527.33
102 schema:familyName Sun
103 schema:givenName Jiaguang
104 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011411464635.59
105 rdf:type schema:Person
106 sg:person.012303351315.43 schema:affiliation grid-institutes:grid.12527.33
107 schema:familyName Wang
108 schema:givenName Jianmin
109 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012303351315.43
110 rdf:type schema:Person
111 sg:person.016443220153.06 schema:affiliation grid-institutes:grid.12527.33
112 schema:familyName Li
113 schema:givenName Qinghu
114 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016443220153.06
115 rdf:type schema:Person
116 grid-institutes:grid.12527.33 schema:alternateName Department of Computer Science & Technology, Tsinghua University, Beijing, China
117 School of Software, Tsinghua University, Beijing, China
118 schema:name Department of Computer Science & Technology, Tsinghua University, Beijing, China
119 School of Software, Tsinghua University, Beijing, China
120 rdf:type schema:Organization
 




Preview window. Press ESC to close (or click here)


...