Information Technology Reference
In-Depth Information
Sit, E., & Morris, R. (2002):
Security consider-
ations for peer-to-peer distributed hash tables.
In
IPTPS '02: Proc. of the 1
st
International Workshop
on Peer-to-Peer Systems.
Zuo, C., Li, R., Shen, H., & Lu, Z. (2009): High
Coverage Search in Multi-Tree Based P2P Overlay
Network. In ICCCN'09: Proc of the 18
th
Interna-
tional Conference on Computer Communications
and Networks. San Francisco, CA: USA.
Spleiss, C., & Kunzmann, G. (2007).
Decentral-
ized supplementary services for Voice-over-IP
telephony.
Proceedings of EUNICE 2007.
Lecture
Notes in Computer Science
,
4606
(Jul), 62-69.
doi:10.1007/978-3-540-73530-4_8
KEY TERMS AND DEFINITIONS
Decentralization:
Attempt to avoid central
services, thus preventing single points of failure.
Directory:
A service organizing users
Distributed Hash Table (DHT):
Type of de-
centralized infrastructure providing a hash-table
like addressing scheme
Extended Prefix Hash Tree (EPHT):
Modi-
fied PHT to be used when implementing distrib-
uted user directories.
Infrastructure:
Underlying algorithm in a
distributed application, allowing the nodes to
address each other.
IP-Telephony:
Telephony over IP networks,
mostly using the Voice over IP protocol
Peer-to-Peer:
A paradigm in distributed
systems, where all nodes may act as both, client
and server.
Prefix Hash Tree (PHT):
Search algorithm
based on DHTs, as proposed by Ramabhadran
et al (2004)
Steinmetz, R., & Wehrle, K. (2005):
What is
peer-to-peer about?
In volume 3485 of Lecture
Notes in Computer Science, pages 9—16. Berlin,
Heidelberg: Germany, Springer.
Stutzbach, D., & Rejaie, R. (2006):
Understand-
ing churn in peer-to-peer networks
. In IMC'06:
Proc. of the 6
th
ACM SIGCOMM on Internet
Measurement, pages 189—202, New York, NY,
USA: ACM Press.
Tanenbaum, A. (2003).
Computer Networks
.
Upper Saddle River, NJ, USA: Prentice Hall
International.
Tutschku, K., & Tran-Gia, P. (2005).
Peer-to-
peer-systems and applications. chapter Traffic
Characteristics and Performance Evaluation of
Peer-to-Peer Systems
(pp. 383-397). Springer.
Zhao, B., Huang, L., Stribling, J., Rhea, S., Joseph,
A., & Kubiatovicz, J. (2004). Tapestry: A resilient
global-scale overlay for service deployment.
IEEE
Journal on Selected Areas in Communications
,
22
(1), 41-53. doi:10.1109/JSAC.2003.818784
ENDNOTES
1
Dr. G. Kunzmann is now working for
DOCOMO Communications Laboratories
Europe GmbH, Munich, Germany
Zoels, S., Schubert, S., & Kellerer, W. (2006):
Hybrid dht design for mobile environments
. In
AP2PC'06: Proc of 5
th
International Workshop
on Agents and Peer-to-Peer Computing, LNCS,
Springer.
2
Each lookup operation requires log
b
n
mes-
sages in the DHT protocol, where
n
is the
number of peers, and
b
is a parameter de-
pending on the design of the DHT's routing
table.
Search WWH ::
Custom Search