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", 
      "global coordination", 
      "network", 
      "connection cost", 
      "fundamental problem", 
      "branch nodes", 
      "nodes", 
      "peers", 
      "Btree", 
      "routing", 
      "congestion", 
      "services", 
      "applications", 
      "cost", 
      "system", 
      "coordination", 
      "items", 
      "additional linkages", 
      "state", 
      "events", 
      "problem", 
      "linkage", 
      "roots", 
      "new scalable Peer", 
      "GFS-Btree", 
      "Btree network", 
      "GFS-Btree system", 
      "Lookup routing", 
      "GFS-Btree network"
    ], 
    "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-01-01T19:25", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20220101/entities/gbq_results/chapter/chapter_445.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.

126 TRIPLES      23 PREDICATES      61 URIs      54 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 Ne606cd3f3616435b993ec46d247c28e4
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 Ndd275eb1448a4518b12493761a8a6a87
8 schema:genre chapter
9 schema:inLanguage en
10 schema:isAccessibleForFree false
11 schema:isPartOf Ne3b80e50d0394147b3799c219ab3a714
12 schema:keywords Btree
13 Btree network
14 GFS-Btree
15 GFS-Btree network
16 GFS-Btree system
17 Lookup routing
18 additional linkages
19 applications
20 branch nodes
21 congestion
22 connection cost
23 coordination
24 cost
25 data items
26 events
27 fundamental problem
28 global coordination
29 items
30 linkage
31 lookup service
32 network
33 new scalable Peer
34 nodes
35 overlay network
36 particular data item
37 peer applications
38 peer overlay networks
39 peers
40 problem
41 roots
42 routing
43 scalable peer
44 services
45 state
46 system
47 schema:name GFS-Btree: A Scalable Peer-to-Peer Overlay Network for Lookup Service
48 schema:pagination 340-347
49 schema:productId N74166bd302cf452b84d1d6fb6e295f14
50 Nc86699140f89428cb689a15fe5aef46c
51 schema:publisher Ncdc364d63ab64725a596fad7fc50b301
52 schema:sameAs https://app.dimensions.ai/details/publication/pub.1026289026
53 https://doi.org/10.1007/978-3-540-24679-4_68
54 schema:sdDatePublished 2022-01-01T19:25
55 schema:sdLicense https://scigraph.springernature.com/explorer/license/
56 schema:sdPublisher Nda793fd9a243494583954ac0c14f1e08
57 schema:url https://doi.org/10.1007/978-3-540-24679-4_68
58 sgo:license sg:explorer/license/
59 sgo:sdDataset chapters
60 rdf:type schema:Chapter
61 N01d5bf1c67824acfb57a56c9c54640fd rdf:first sg:person.011411464635.59
62 rdf:rest rdf:nil
63 N39b7e26c791645e4bee71541aaff06b8 rdf:first N431be4ff823945078cf7a4689b357fa1
64 rdf:rest N3e8ece25e26145bdadc945c61fd3700e
65 N3e8ece25e26145bdadc945c61fd3700e rdf:first N66437b4b8c1b4fbca2ee711d680b9ab2
66 rdf:rest N9277f90e5d9844c98f4ae6ce314e7ef4
67 N431be4ff823945078cf7a4689b357fa1 schema:familyName Sun
68 schema:givenName Xian-He
69 rdf:type schema:Person
70 N66437b4b8c1b4fbca2ee711d680b9ab2 schema:familyName Deng
71 schema:givenName Qian-ni
72 rdf:type schema:Person
73 N74166bd302cf452b84d1d6fb6e295f14 schema:name dimensions_id
74 schema:value pub.1026289026
75 rdf:type schema:PropertyValue
76 N9277f90e5d9844c98f4ae6ce314e7ef4 rdf:first Nad6f34baa1e1457ea50b50b41f99d977
77 rdf:rest rdf:nil
78 Na4a5b9172b004110ba23d2a834a18f48 rdf:first sg:person.012303351315.43
79 rdf:rest N01d5bf1c67824acfb57a56c9c54640fd
80 Na65ae259c5784261b72a23758da69a2e schema:familyName Li
81 schema:givenName Minglu
82 rdf:type schema:Person
83 Nad6f34baa1e1457ea50b50b41f99d977 schema:familyName Ni
84 schema:givenName Jun
85 rdf:type schema:Person
86 Nc86699140f89428cb689a15fe5aef46c schema:name doi
87 schema:value 10.1007/978-3-540-24679-4_68
88 rdf:type schema:PropertyValue
89 Ncdc364d63ab64725a596fad7fc50b301 schema:name Springer Nature
90 rdf:type schema:Organisation
91 Nda793fd9a243494583954ac0c14f1e08 schema:name Springer Nature - SN SciGraph project
92 rdf:type schema:Organization
93 Ndd275eb1448a4518b12493761a8a6a87 rdf:first Na65ae259c5784261b72a23758da69a2e
94 rdf:rest N39b7e26c791645e4bee71541aaff06b8
95 Ne3b80e50d0394147b3799c219ab3a714 schema:isbn 978-3-540-21988-0
96 978-3-540-24679-4
97 schema:name Grid and Cooperative Computing
98 rdf:type schema:Book
99 Ne606cd3f3616435b993ec46d247c28e4 rdf:first sg:person.016443220153.06
100 rdf:rest Na4a5b9172b004110ba23d2a834a18f48
101 anzsrc-for:10 schema:inDefinedTermSet anzsrc-for:
102 schema:name Technology
103 rdf:type schema:DefinedTerm
104 anzsrc-for:1005 schema:inDefinedTermSet anzsrc-for:
105 schema:name Communications Technologies
106 rdf:type schema:DefinedTerm
107 sg:person.011411464635.59 schema:affiliation grid-institutes:grid.12527.33
108 schema:familyName Sun
109 schema:givenName Jiaguang
110 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011411464635.59
111 rdf:type schema:Person
112 sg:person.012303351315.43 schema:affiliation grid-institutes:grid.12527.33
113 schema:familyName Wang
114 schema:givenName Jianmin
115 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012303351315.43
116 rdf:type schema:Person
117 sg:person.016443220153.06 schema:affiliation grid-institutes:grid.12527.33
118 schema:familyName Li
119 schema:givenName Qinghu
120 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.016443220153.06
121 rdf:type schema:Person
122 grid-institutes:grid.12527.33 schema:alternateName Department of Computer Science & Technology, Tsinghua University, Beijing, China
123 School of Software, Tsinghua University, Beijing, China
124 schema:name Department of Computer Science & Technology, Tsinghua University, Beijing, China
125 School of Software, Tsinghua University, Beijing, China
126 rdf:type schema:Organization
 




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


...