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 sensor networks, skeleton (also known as medial axis) extraction is recognized as an appealing approach to support many applications such as load-balanced routing and location free segmentation. Existing solutions in the literature rely heavily on the identified boundaries, which puts limitations on the applicability of the skeleton extraction algorithm. In this paper, we conduct the first work...
In traditional P2P networks, such as Gnutella, peers propagate query messages towards the resource holders by flooding them through the network. However, it is a costly operation since it consumes node and link resources excessively, which are often unnecessarily. There is no reason, for example, for a peer to receive a query message if the peer has no matching resource or is not on the path to a...
As the rapid growth of Internet and the communication link speed, it becomes increasingly challenging for network processors to timely route the incoming traffic to the destination ports. The traditional approach must look up the routing table based on the destination IP address to determine the output port. The ternary CAM approach provides fast associative look up, but is very costly for large routing...
The existing opportunistic protocols of delay tolerant network (DTN) occupy much storage and the prediction-based protocols need to calculate and spread much predication information and the scheduling protocols cannot accommodate to huge complex network. This paper analyses and summarizes the existing DTN protocols and proposes a new DTN routing protocol called CRHC which is based on hierarchical...
Many structured Peer-to-Peer-Systems (P2P) have been developed over the past years. However, most of them rely on hash-functions and thus put major restrictions on applications being implemented on top of them. In this paper we present a very detailed description of Papnet, a hash-free P2P overlay-network that supports range-queries and realizes an infinite alphanumeric address space that can be used...
This paper presents the design of a decentralized storage scheme to support multi-dimensional range queries over sensor networks. We build a distributed k-d tree based index structure over sensor network, so as to efficiently map high dimensional event data to a two-dimensional space of sensors while preserving the proximity of events. We propose a dynamic programming based methodology to control...
This paper imports the concept of domain to design a resource locating model with local domain first based on Kademlia protocol, which is abbreviated to LDF-KAD, to refer the small world phenomenon and the characteristic of localized dataflow first on the Internet. The LDF-KAD model includes two layers structure that are super node layer and general layer. And super node layer consists of all super...
In this paper, we propose two algorithms for broadcasting a large data set with limited loads of all nodes on a DHT-based P2P network using a de Bruijn graph. One of the broadcast algorithms is applied to de Bruijn graphs with the restricted number of nodes. We prove that this algorithm broadcasts a data set along a degree-constrained spanning tree without global knowledge of a P2P network and that...
Route protection for key circuits is the important method to improve the quality of service in transmission network. Based on analyzing the principle of protective circuit routing, this paper presents that single ant colony algorithm can not be used to select protective circuit. Then, this paper presents an algorithm using multiple ant colonies algorithm to solve the problem. Two different routing...
Grid is an environment that makes it possible to share resources that are managed by diverse, independent and administrative geographically distributed organizations. The main objective of grid is to enable users to solve problems using the available geographically distributed resources. Grid resource discovery is a challenging issue because characteristics of resources are heterogeneous, dynamic,...
We study task-allocation problems where cooperative robots need to perform tasks simultaneously. We develop a distributed negotiation procedure that allows robots to find all task exchanges that reduce the team cost of a given task allocation, without robots having to know how other robots compute their robot costs. Finally, we demonstrate empirically that our negotiation procedure can substantially...
Resource space model (RSM) is a normalized classification model that uses m-dimensional semantic spaces to share and manage various resources in a centralized manner. This paper explores how to use the idea of classification semantics to organize indexes of resources in a decentralized manner. We deploy RSM on a structured P2P topology HRing by two ID management methods. HRing is a ring-structured...
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...
Resource discovery is critical to the usability and accessibility of grid computing systems. Distributed hash table (DHT) has been applied to grid systems as a distributed mechanism for providing scalable range-query and multiattribute resource discovery. Multi-DHT-based approaches depend on multiple DHT networks with each network responsible for a single attribute. Single-DHT-based approaches keep...
The paper introduces a secure DSR protocol, which is based on the principle of the sequence number increment and the scheme of the end-to-end acknowledgement. The OPNET simulation result shows that the secure routing design can resist the black-hole attack effectively.
Data deduplication is an essential and critical component of backup systems. Essential, because it reduces storage space requirements, and critical, because the performance of the entire backup operation depends on its throughput. Traditional backup workloads consist of large data streams with high locality, which existing deduplication techniques require to provide reasonable throughput. We present...
Bamboo is one structured P2P overlay, that likes others (e.g. Chord, Kademlia, Pastry), organizes peers into a flat overlay network and offers distributed hash table (DHT) functionality. It is very promising for its efficient routing performance. However, one disadvantage impeding the DHT algorithm popularity is the routing information maintenance overhead; it generates considerable network traffic...
Although metric access methods (MAMs) proved their capabilities when performing efficient similarity search, their further performance improvement is needed due to extreme growth of data volumes. Since multi core processors become widely available, it is justified to exploit parallelism. However, taking into account the Gustafsonpsilas law, it is necessary to find tasks suitable for parallelization...
Efficient search in unstructured P2P networks has been extensively studied in the literature. And search in unstructured P2P networks shows promise to become an alternative to the state-of-the-art search engines. However, efficient search techniques for guaranteed location of shared resource in unstructured P2P networks are yet to be devised. The paper presents a simple but highly effective search...
Quantum communication networks need to securely transmit a quantum frame from source to destination. In the wireless communication network, source and destination have two types of connection: direct or indirect communication. In the direct connected mode, the transmission security can be achieved by using a quantum key distribution. In the indirect connected mode, it is a difficult problem to deal...
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.