The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Distributed hash tables (DHTs) have been prevalent within the Internet community for many years. Crawling a DHT network allows researchers to monitor the behavior of peers, determine their geographic location, and predict their trend, etc. To characterize a DHT network accurately and comprehensively, the measurements should be conducted in the long term, which are rarely considered in the former studies...
P2P is an essential technology to solve the gap between server's capability and growing demand of client. In P2P system, there is a natural imbalance. Thus, Load balance is one of the main research directions. Better balance performance would lead to higher bandwidth, higher resource utilization, and better network stability. Churn is a normal phenomenon in P2P network, which often brings some awful...
Deploying cache has been generally adopted by Internet service providers (ISPs) to mitigate P2P traffic in recent years. Most traditional caching algorithms are designed for locality-unaware P2P networks, which mainly consider the requested frequency of contents as the principle of caching policies. However, in more prevalent locality-aware conditions with biased neighbor-selection policies, the existing...
The rapid rising of Linux users requires P2P, an efficient content transport method, to distribute packages. Different from traditional streaming P2P systems, a P2P package distribution system is hazarded by the special characteristics of small package size and hot packages. Due to the small package size, DHT search performance, which is rarely considered in traditional P2P system, comes to be an...
Kad is a P2P protocol which has about 1 million concurrent online users. The eclipse attack is one of the most severe threats in Kad. In this paper, we propose a distributed verification approach to defend against the eclipse attack in Kad. Previous works mostly concentrate on ID generation or secure routing algorithm. Our approach utilizes many benign peers to prove that the storage peer is valid...
DHTs have been widely used in designing various applications, especially P2P file sharing systems. It is crucial but difficult to get an accurate snapshot of a DHT network, since such network is serverless and peers join and depart dynamically. In this letter, we analyze and empirically verify that neither breadth-first search nor depth-first search is optimal for DHT snapshot crawling, due to uneven...
Nowadays, web servers are suffering from flash crowds and application layer DDoS attacks that can severely degrade the availability of services. It is difficult to prevent them because they comply with the communication protocol. Peer-to-peer (P2P) networks have been exploited to amplify DDoS attacks, but we believe their available resource, such as distributed storage and network bandwidth, can be...
ID uniqueness is essential in DHT-based systems as peer lookup and resource searching rely on ID-matching. Many previous works and measurements on Kad do not take into account that IDs among peers may not be unique. We observe that a significant portion of peers, 19.5% of the peers in routing tables and 4.5% of the active peers (those who respond to Kad protocol), do not have unique IDs. These repetitions...
As the first DHT implemented in real applications and involving millions of simultaneous users, all aspects of Kad must be analyzed and measured carefully. This paper focuses on measuring the routing table of Kad in eMule/aMule. We present and analyze the availability and stability of routing table by crawling actively. We find the phenomenon of ID repetition in Kad that many peers use a same ID simultaneously,...
Kademlia-based DHT has been deployed in many P2P applications and it is reported that there are millions of simultaneous users in Kad network. For such a protocol that significantly involves so many peers, its robustness and security must be evaluated carefully. In this paper, we analyze the Kademlia protocol and identify several potential vulnerabilities. We classify potential attacks as three types:...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.