2010
DOI: 10.1109/tc.2009.157
|View full text |Cite
|
Sign up to set email alerts
|

The Design and Evaluation of a Self-Organizing Superpeer Network

Abstract: van, M. (2010). The design and evaluation of a self-organizing superpeer network. IEEE Transactions on Computers, 59(3), 317-331. https://doi.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
19
0

Year Published

2012
2012
2020
2020

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 25 publications
(19 citation statements)
references
References 54 publications
0
19
0
Order By: Relevance
“…Their election is based on the heterogeneity of the computational, storage or network resources and mandates how the super-peer hierarchy is structured. Other factors for their election can be adopted such as the semantic content similarity in a file-sharing application [Garbacki et al, 2010]. Note that the election of super-peers is usually a domain-specific problem that is challenging to address with a generic approach or methodology [Sacha, 2009].…”
Section: Structured Overlay Networkmentioning
confidence: 99%
“…Their election is based on the heterogeneity of the computational, storage or network resources and mandates how the super-peer hierarchy is structured. Other factors for their election can be adopted such as the semantic content similarity in a file-sharing application [Garbacki et al, 2010]. Note that the election of super-peers is usually a domain-specific problem that is challenging to address with a generic approach or methodology [Sacha, 2009].…”
Section: Structured Overlay Networkmentioning
confidence: 99%
“…Though not able to gather sensor data, they can take tasks and contribute their computation power. Besides, all these nodes can serve as a bridge and help to relay data within their connection coverage and capacity [10].…”
Section: B Wireless Sensor Network and Mobile Connectivitymentioning
confidence: 99%
“…Dynamic and decentralized routing algorithms such as Distance Vector can be implemented on top of the basic Ocelot network infrastructure providing facilities for managing link costs, connectivity, and local storage. Simple mechanisms for load balancing and heterogeneous processing capacities are currently implemented and more sophisticated ones [11] can also be easily explored.…”
Section: A Ocelot Basicsmentioning
confidence: 99%
“…Another self-organizing superpeer system is SOSPNET [8], which is built on top of an unstructured architecture with semantic correlation between peers and files. In this system, superpeers maintain semantic caches of pointers to files, which are dynamically requested by client peers that have similar attributes.…”
Section: Related Workmentioning
confidence: 99%