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.
In this paper we focus on building low latency resource location service over unstructured Peer-to-Peer (P2P) networks. In state-of-the-art search approaches in unstructured P2P systems ,they often evaluate efficiency by overlay hops, while two nodes logically adjacent maybe physically far away and from user's QoS, clients always want to acquire as many as objects in a short time, so we propose an...
Peer to Peer (P2P) networks are the important part of the next cohort of Internet. But in Peer networks, achieving required efficiency for any application is difficult. This is because efficiency of application evidently depends on the effective communication. For any communication process in peer network very large number of message passes needed because the message may go through a node multiple...
Churn is one of the crucial problems which restrict the development and deployment of DHT networks. In terms of churn treatment, this paper studies the quick start-up bootstrapping mechanism for Kademlia and proposes a heuristic bootstrapping algorithm to overcome the defects of the original. By modifying the way how to populate the routing tables, the heuristic algorithm decreases the messages sent...
Location and manipulation of complex data is a difficult, challenging task in nowadays extremely complex IT systems and on the Internet, overwhelmed with a huge amount of information that develops and grows rapidly. In this paper, we propose a self-organizing approach that combines purely decentralized unstructured P2P with space based computing in order to locate effectively and filter (retrieve)...
The discovery of autonomous systems (ASes) interconnections and the inference of their commercial type of relationships (ToR) has been motivated by the need to accurately calculate AS-level paths. An inherent problem in current algorithms is their extensive use of heuristics, causing unbounded errors that are spread over all inferred relationships. We propose a near-deterministic algorithm for solving...
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.