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.
Replication is often used in distributed hash tables (DHTs) to reduce the latency of query requests. For read-write objects, replicas are commonly kept up-to-date by having a master node maintain physical pointers to replica hosts. Since these links are based on IP addresses, they must be updated whenever a linked node fails. This can be costly in systems with high churn. In this paper, we introduce...
Skip Graphs provide novel distributed data structures for peer-to-peer (P2P) searching. They are simple, resilient and are capable of supporting complex queries. Like many distributed hash table (DHT) algorithms, one issue that remains to be addressed is the large number of pointers per node in the system. They suffer from the problems of high storage requirements and high volume of repair-mechanism...
Large-scale P2P systems typically have hundreds of thousands of peers that involve frequent dynamic activities. Empirical studies have shown that participating nodes in P2P systems are not equivalent. Such heterogeneity has been taken into account in the design of P2P systems. In this paper, to achieve better scalability and improve the routing performance of REIK, we design a novel hierarchical REIK...
In decentralized P2P networks, many security mechanisms still rely on a central authority. This centralization creates a single point of failure and does not comply with the P2P principles. We previously proposed a distributed PKI for P2P networks which allows to push security mechanisms to the edges of the network but relies on unaffordable maintenance operations using byzantine agreements. In this...
In this paper, we present an algorithm for an effective flooding procedure with reduced cost in a DHT based P2P network. We describe techniques of flooding and replication that exploit structural constraints to achieve low overhead and higher reliability. These techniques can help to support complex queries in mobile distributed environments with better performance.
Peer-to-Peer Session Initiation Protocol (P2PSIP) is a new technology being standardized in the Internet engineering task force. A P2PSIP network consists of a collection of nodes organized in a peer-to-peer fashion for the purpose of enabling real-time communication using the Session Initiation Protocol (SIP). In this paper, we present experimental results obtained by running a P2PSIP prototype in...
With highly dynamic, structured P2P system needs very large maintenance cost. But there is little research on this kind of maintenance. This article focuses on reducing maintenance cost of structured P2P system and proposes a clone node protocol, CNP for short. We realize a new system based on vxusing CNP, i.e. CNChord. CNP can reduce maintenance cost greatly, and improve query efficiency at some...
Zero-day attacks - especially those that hide the attack exploit by using code obfuscation and encryption - remain a formidable challenge to existing network defenses. Many techniques have been developed that can address known attacks and similar new attacks that may arise in the future. Some methods, like Earlybird and Polygraph, focus on string-based content prevalence in payloads; others focus...
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.