Faster Content Access in KAD

Steiner, Moritz; Carra, Damiano; Biersack, Ernst W.

doi:10.1109/p2p.2008.28

Cited by 34 publications

(27 citation statements)

References 14 publications

(14 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [5], Steiner et al presented an improvement approach to shorten Kad lookup latency, called Integrated Content Lookup (ICL), which couples content retrieval with the routing process in the tolerance zone during search process.…”

Section: B Related Workmentioning

confidence: 99%

Revisiting why Kad lookup fails

Liu

Wei

Zhang

et al. 2012

2012 IEEE 12th International Conference on Peer-to-Peer Computing (P2P)

View full text Add to dashboard Cite

Abstract-Kad is one of the most popular peer-to-peer (P2P) networks deployed on today's Internet. Its reliability is dependent on not only to the usability of the file-sharing service, but also to the capability to support other Internet services. However, Kad can only attain around a 91% lookup success ratio today. We build a measurement system called Anthill to analyze Kad's performance quantitatively, and find that Kad's failures can be classified into four types: packet loss, selective Denial of Service (sDoS) nodes, search sequence miss, and publish/search space miss. The first two are due to environment changes, the third is caused by the detachment of routing and content operations in Kad, and the last one shows the limitations of the Kademlia DHT algorithm under Kad's current configuration. Based on the analysis, we propose corresponding approaches for Kad, which achieve a success ratio of 99.8%, with only moderate communication overhead.

show abstract

Section: B Related Workmentioning

confidence: 99%

Revisiting why Kad lookup fails

Liu

Wei

Zhang

et al. 2012

2012 IEEE 12th International Conference on Peer-to-Peer Computing (P2P)

View full text Add to dashboard Cite

show abstract

“…The list building process is done iteratively with the help of different peers. Here we summarize the main steps of the Lookup procedure: for a detailed explanation, we refer the interested reader to [14] [15]. Initialization: The (publishing or searching) peer first retrieves from its routing table the 50 closest contacts to the destination, and stores them in the candidate list.…”

Section: B Content Managementmentioning

confidence: 99%

Adaptive load balancing in KAD

Carra

Steiner²,

Michiardi

2011

2011 IEEE International Conference on Peer-to-Peer Computing

Self Cite

View full text Add to dashboard Cite

Abstract-The endeavor of this work is to study the impact of content popularity in a large-scale Peer-to-Peer network, namely KAD. Armed with the insights gained from an extensive measurement campaign, which pinpoints several deficiencies of the present KAD design in handling popular objects, we set off to design and evaluate an adaptive load balancing mechanism. Our mechanism is backward compatible with KAD, as it only modifies its inner algorithms, and presents several desirable properties: (i) it drives the process that selects the number and location of peers responsible to store references to objects, based on their popularity; (ii) it solves problems related to saturated peers, that entail a significant drop in the diversity of references to objects, and (iii) if coupled with an enhanced content search procedure, it allows a more fair and efficient usage of peer resources, at a reasonable cost. Our evaluation uses a trace-driven simulator that features realistic peer churn and a precise implementation of the inner components of KAD.

show abstract

“…The P2P substrate of Safebook is a DHT similar to KAD [86,110] in charge of storing and retrieving the entrypoint references of all the users' Matryoshkas. Such a substrate comprises of all user nodes and allows any node to issue a lookup query to reach the Matryoshka of any user.…”

Section: Peer-to-peer Substratementioning

confidence: 99%

“…T RT T and T L are dened as random variables and are set to the values originated from real measurements on Kad conducted in [110]. T is then evaluated with Monte Carlo techniques based on these measurements.…”

Section: D53 Performancementioning

confidence: 99%

Security and Privacy in Online Social Networks

Cutillo

Manulis²,

Strufe

2010

Handbook of Social Network Technologies and Applications

View full text Add to dashboard Cite

3Uno solo è il mio desiderio, quello di vedervi felici nel tempo e nell'eternità.sac. Giovanni Bosco 4 Abstract Social network applications allow people to establish links and exchange information based on various interests such as professional activities, hobbies, et similia. Several commercial social networking platforms that came to light recently suddenly became extremely popular at the international arena. Apart from obvious advantages in terms of fast community building, rapid exchange of information at the professional and private level, social network platforms raise several issues concerning the privacy and security of their users. The goal of this thesis is to identify privacy and security problems raised by the social networks and to come up with the design of radically new architectures for the social network platform.As current social network platforms are based on centralized architectures that inherently threat user privacy due to potential monitoring and interception of private user information, the goal is to design social network platforms based on a distributed architecture in order to assure user privacy. New mechanisms are investigated in order to solve some classical security and trust management problems akin to distributed systems by taking advantage of the information stored in the social network platforms. Such problems range from trust establishment in self-organizing systems to key management without infrastructure to cooperation enforcement in peer-to-peer systems.This thesis suggests a new approach to tackle these security and privacy problems with a special emphasis on the privacy of users with respect to the application provider in addition to defense against intruders or malicious users. In order to ensure users' privacy in the face of potential privacy violations by the provider, the suggested approach adopts a decentralized architecture relying on cooperation among a number of independent parties that are also the users of the online social network application. The second strong point of the suggested approach is to capitalize on the trust relationships that are part of social networks in real life in order to cope with the problem of building trusted and privacy-preserving mechanisms as part of the online application. The combination of these design principles is Safebook, i ii Abstract a decentralized and privacy-preserving online social network application. Based on the two design principles, decentralization and exploiting real-life trust, various mechanisms for privacy and security are integrated into Safebook in order to provide data storage and data management functions that preserve users'privacy, data integrity, and availability.Apart from the design of Safebook, a signicant part of the thesis is devoted to its analysis and evaluation using various methods such as experimenting with real social network platforms. A special acknowledgement goes to seventeen among the best students I have ever met:

show abstract

Faster Content Access in KAD

Cited by 34 publications

References 14 publications

Revisiting why Kad lookup fails

Revisiting why Kad lookup fails

Adaptive load balancing in KAD

Security and Privacy in Online Social Networks

Contact Info

Product

Resources

About