2016 First IEEE International Conference on Computer Communication and the Internet (ICCCI) 2016
DOI: 10.1109/cci.2016.7778866
|View full text |Cite
|
Sign up to set email alerts
|

A novel lookup and routing protocol based on CAN for structured P2P network

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2019
2019
2019
2019

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 7 publications
0
2
0
Order By: Relevance
“…The NetSize-aware protocol introduced in [148] is based on CAN. The main objective of this algorithm is to solve the problem of search flexibility in DHT.…”
Section: Routing Algorithms In Structured P2p Networkmentioning
confidence: 99%
“…The NetSize-aware protocol introduced in [148] is based on CAN. The main objective of this algorithm is to solve the problem of search flexibility in DHT.…”
Section: Routing Algorithms In Structured P2p Networkmentioning
confidence: 99%
“…Third generation: the third generation of P2P networks (eg. HPM [1], Chord [10], P2P based CAN [8] and Agregation based routing protocol [13]) is generally based on the DHT (Distributed hash table) to generate key for both nodes and data. Nodes identifier and keys value pairs are both hashed to one identifier space.…”
Section: Peer To Peer Networkmentioning
confidence: 99%