d-SHAM: A Constant Degree-Scalable Homogeneous Addressing Mechanism for Structured P2P Networks
Minimizing the size of routing tables and reducing the lookup latency have established the ground rules for several structured peer-to-peer lookup algorithms. The motivation behind this is that updating large routing tables require significant maintenance traffic that will eventually compete with re...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2018-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/8302982/ |