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.
We investigate the impact of an unevenly distributed load among nodes of a distributed key-value store on response times. We find that response times of “get” operations quickly degrade in the presence of power law distributions of load and identify the point, at which the system needs to apply a mitigation approach. The migration technique, which we propose, overcomes the long response times of consistent...
Wireless Mesh Networks (WMNs) are new emerging multi-hop wireless networks that offer low-cost high-bandwidth community wireless services. Much work has been done so far in order to enhance the performance of these networks. In this paper, by using the optimization framework provided in [1], we study the impact of using some advanced wireless communication techniques on the performance improvement...
Cloud computing is an emerging field in computer science. Users are utilizing less of their own existing resources, while increasing usage of cloud resources. With the emergence of new technologies such as mobile devices, these devices are usually under-utilized, and can provide similar functionality to a cloud provided they are properly configured and managed. This paper proposes a Distributed Cloud...
To the problem of hostile service brought by node anonymity in P2P system, this thesis proposes a reputation aware resource finding algorithm. This algorithm is based on routing indices (RIs) algorithm and adopts the conception of reputation to efficiently restrain the deceiving behavior of hostile nodes in P2P system and reduce the messages load in the system, which can ensure the reliability and...
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,...
The resource locating efficiency is the core issue of P2P systems. The unstructured P2P systems adopt the flooding mechanism, which causes huge network burden. The Structured P2P systems, however, employs routing based on DHT, which results in an expensive topology maintenance. This paper will propose a semi-construct P2P model. Based on the research of the small world theory, this model combines...
In recent years, improving network model and enhancing the network performance have received people's attention gradually. The peer-to-peer network model has been used in Ad Hoc networks to increase the data output rate, to reduce the transmission power, to increase network capacity and the better load balance. However, the network analysis topology computation, the routing and the energy supply have...
Content-based publish/subscribe allows for highly expressive descriptions of subscriptions and thus is more appropriate for content dissemination when a finer level of granularity is necessary. However, scalability has become an issue due to the expensive matching and delivering inherent in content-based events. In this paper we propose a novel content-based publish/subscribe framework built over...
In this paper, aimed at how to solve load imbalance problem when exploiting P2P technology in telecommunications network, we propose a load balancing algorithm GALB. In GALB algorithm, the intra-domain load transfer is mainly used for temporary load imbalance. For emergency leading to a large amount of concurrent user request, we will adopt the inter-domain load transfer. Experimental results show...
A fundamental problem in large peer-to-peer application is finding a routing method by which the user can efficiently locate the nodes those stores a particular data item. In this paper we present a new resource routing method: redundant De Bruijn routing graph(RDBR). Every node in RDBR has main routing label and assistant routing label, a group of nodes with same main routing label constitute of...
Emerging Peer-to-Peer (P2P) technologies have enabled various types of content to be efficiently distributed over the Internet. Most P2P systems adopt selfish peer selection schemes in the application layer that in some sense optimize the user quality of experience. On the network side, traffic engineering (TE) is deployed by ISPs in order to achieve overall efficient network resource utilization...
The distributed optimal path planning (D-OPP) problem has been a bottleneck restricting the performance of Peer-to-Peer (P2P) workflow systems which have met the development trend of workflow systems and been one of the most important domains of Distributed computing. The essence of this problem is to solve the dynamical global optimization in local views without centralized mechanism. Aiming at this...
Recently, structured P2P (Peer-to-Peer) system has become more and more popular. However, P2P systems' large scale and high dynamics have brought a great challenge to data availability and accessing performance. Redundancy techniques are used to solve these problems. However, in structured P2P systems, due to the consistent hash, the overlay network could not match underlying physical network well...
We present 3nuts, a self-stabilizing peer-to-peer (p2p) network supporting range queries and adapting the overlay structure to the underlying physical network. 3nuts combines concepts of structured and unstructured p2p networks to over-come their individual shortcomings while keeping their strengths. This is achieved by combining self maintaining random networks for robustness, a search tree to allow...
Distributed key/value-stores are a key component of many large-scale applications. Traditionally they have been designed using Distributed Hash Tables (DHTs). DHTs, however, setup a tight coupling between the naming of nodes and assignment of keys to nodes which limits application control over data placement. We propose using small amounts of shared state in a semi-centralized architecture for more...
The problem of defining a support for multidimensional range queries on P2P overlays is currently an active field of research. Several approaches based on the extension of the basic functionalities offered by Distributed Hash Tables have been recently proposed. The main drawback of these approaches is that the locality required for the resolution of a range query cannot be guaranteed by uniform hashing...
A critical problem in a distributed system is the load of each of its individual components, which, if too large, threatens the availability of the whole system. A solution for system availability is decentralizing its components by using peer-to-peer networks. For such networks, we define in this work a scalable, transparent strategy for locally balancing the load of the individual peers, based on...
Approximately 74% of queries in peer-to-peer file sharing systems return no results, wasting both network bandwidth and computational resources. Considering the popularity of this application, this is a significant problem. We propose to improve the accuracy of query routing by improving how file collections are described and defining how peers organize into groups. Our basic approach is to improve...
Super-peer networks inherit the advantages of P2P networks, such as pooling together the shared data (images in our system) across peers, self-organizing, and fault-tolerance. In addition, they take advantage of the heterogeneity of capabilities across peers in load-balancing and network adaptation. A super-peer node operates as an equal peer, and as a server/parent to a set of peers. Content-based...
The following topics are dealt with: data center; Internet networking; location sensing; RFID; clouds; grids; data streaming; querying; IP networks; system security; data management; network security; sensor networks; fault tolerance; routing; social networks; resource allocation; network coding; P2P; and wireless networks.
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.