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.
Information network derived from various domains are studied recently. Searching for Similarity is a major task into such types Information Network. Lot of research on computing similar objects is done in Homogeneous Information Network. But real world scenario can be described easily by Heterogeneous Information Network (HIN) which consists of different types of entities and relationship among them...
We consider two problems in the context of tree-structured data sets (e.g., XML): (1) searching for a data element, (2) synchronizing two data trees (replicas) stored at remote locations. We propose to compute bloom filters for the interior tree nodes, this bloom filter tree is used for both data search and synchronization. It is more efficient than tree traversal since it prunes out entire subtrees,...
Shortages of traditional intelligent agent searching are slow speed and having robustness problems, because of the large amount of information to exchange. Therefore, it cannot meet the requirements of society now. In order to improve the search efficiency and fault tolerance, this paper studies the small world network model of Kleinberg, and finds this kind of network structure can be contained in...
Networked systems, such as telecom networks and cloud infrastructures, generate and hold vast amounts of configuration and operational data. The goal of this work is to make all this data available through a real-time search process named network search, which will enable new real-time management solutions. The thesis contains several contributions towards engineering a network search system. Key...
Searching content in spontaneous wireless ad Hoc networks is a complex task due to the intermittent nature of the connections, energy constraints, the often present user mobility and most importantly the lack of centralized network administration. At the same time, the today’s search engines (e.g., Google, Yahoo and Bing) are able to provide amazing results at the blink of an eye thanks to their sophisticated...
Due to the disparity between the peer-to-peer (P2P) and the physical networks, we study the challenging problems of mobile routing in unstructured P2P networks over mobile ad hoc networks (MANETs). To route queries and objects of interest, the existing mobile P2P protocols widely adopted an inflexible techniques which experience a relatively high delivery time due to remarkable network traffic, nodes...
Cloud computing has evolved as a paradigm shift to deliver computing and storage services on demand to facilitate the consumers. Inter-connecting Cloud computing system components i.e. servers, virtual machines(VMs), application services is essential to exchange information between the services to avoid the problems of provisioning, efficiency bottleneck and single point of failure that are largely...
In this paper we propose a novel searchable P2P content storage for storing mobile apps. In the growing need of storing and distributing huge number mobile apps across large number of users, it has been deemed necessary to think of a storage that leverages enormous amount of content space that common people can share these days. In our proposal, we leverage popular P2P stores, such as standard DHTs,...
Peer-to-Peer (P2P) protocols usage is proliferating for a variety of applications including time- and safety-critical ones. While the distributed design of P2P provides inherent fault tolerance to certain failures, the large-scale decentralized coordination exhibits various exploitable security threats. One of these key threats are Eclipse attacks, where a large fraction of malicious peers can surround,...
Typical mobile P2P protocols largely relied on inflexible techniques such as, flooding, replicating, random walks and selective forwarding to route queries and discover objects of interest, which incur a relatively high search time due to remarkable network traffic, multiple copies and duplication of query messages. Recently proposed P2P protocols are able to reduce search time but due to peer mobility,...
Multidimensional complex query searching is difficult in Peer-to-Peer (P2P) overlay networks due to its characteristics of high scalability, dynamicity and decentralized architecture. On the other side, the P2P applications like searching of multimedia contents in social networking or multiplayer games (that combines the search based on the multiple game scenarios) are becoming popular among the end...
Designing an efficient search algorithm is a key challenge in unstructured peer-to-peer networks in order to reduce redundant messages in the search process. Addressing the problem, in this paper, a path tracking search algorithm based on the credibility of node service ability(CNSA) is proposed. we utilize the credibility of node service ability as heuristic information to probabilistically guide...
Peer to peer network (P2P) has emerged as a popular model for file sharing because of high scalability, low cost and easy maintenance. The success of a P2P network is highly dependent on its “Search Mechanism” and “Topology Formation” strategy. Many researchers have dealt with super peer based on overlay topology where the key factor is selection of a super peer from all the peers. In this paper,...
In P2P (peer-to-peer) systems, file replication technology is widely used to reduce hot spots and achieve high availability. One approach is to create replicas on the content-provider side. However, this type of methods rely its implementation heavily on the low-layer DHTs, they also generate a heavy query load on the master replica nodes. Furthermore, some of them do not perform well when dealing...
Distance education resources based on P2P mode are distributed in each node, which is difficult to find target resource. In order to improve the efficiency of the distance education system resource utilization, the paper fully considers the node physical location and node ability, and puts forward an improved Chord mode on the base of the analysis of the Chord model principle. Then, the improved Chord...
One of the most important issues in peer-to-peer networks is locating objects among a lot of data. There have been different search methods to find data with certain advantages and disadvantages. In this paper, we propose a new version of k-random walk algorithm utilizing learning automata. In this distributed method, the value of k for krandom walk is not selected randomly but it is selected in an...
Designing an efficient search algorithm is an important issue in unstructured peer-to-peer networks when there is no central control or information on the locations of objects. There are various search strategies with different effects on network performance. In k-random walks as a search strategy, having an adaptive value of k instead of a random value can affect performance of the network. Therefore...
This paper proposes a popularity based Quality of Service (QoS) aware smart replica management algorithm for content distribution in peer-to-peer overlay networks. Peer-to-peer overlay networks are a good solution for distributed computing than client-server model since nodes in P2P networks act both as client and server. With such functionality of managing replicas is an astonishing task and we designed...
Many proposals have been advanced for structured P2P networks, but it is difficult for existing structured P2P networks to achieve dynamic load balancing sufficient. In this paper, we propose a new structured P2P network called Waon, which achieves dynamic load balancing among nodes. Each node in a Waon network controls the number of objects assigned to the node for load balancing of objects. In addition,...
In this work we introduce a peer-to-peer approach for in-flight entertainment video on-demand systems. Such applications are traditional ways for the airline to improve profit from its operation and attract customers. We outline how a peer-to-peer system should be organized to address this specific application and reduce direct operational costs by reducing weight of the system. Furthermore, we discuss...
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.