Results 1 -
9 of
9
Scalable Supernode Selection in Peer-to-Peer Overlay Networks
- In Proceedings of the 2nd International Workshop on Hot Topics in Peer-to-Peer Systems, La
, 2005
"... We define a problem called the supernode selection problem which has emerged across a variety of peer-topeer applications. Supernode selection involves selection of a subset of the peers to serve a special role. The supernodes must be well-dispersed throughout the peerto -peer overlay network, and m ..."
Abstract
-
Cited by 25 (0 self)
- Add to MetaCart
(Show Context)
We define a problem called the supernode selection problem which has emerged across a variety of peer-topeer applications. Supernode selection involves selection of a subset of the peers to serve a special role. The supernodes must be well-dispersed throughout the peerto -peer overlay network, and must fulfill additional requirements such as load balance, resource needs, adaptability to churn, and heterogeneity. While similar to dominating set and p-centers problems, the supernode selection problem must meet the additional challenge of operating within a huge, unknown and dynamically changing network. We describe three generic supernode selection protocols we have developed for peer-topeer environments: a label-based scheme for structured overlay networks, a distributed protocol for coordinatebased overlay networks, and a negotiation protocol for unstructured overlays. We believe an integrated approach to the supernode selection problem can benefit the peer-to-peer community through cross-fertilization of ideas and sharing of protocols.
A Mathematical Foundation for Topology Awareness of P2P Overlay Networks
- In the 4th International Conference on Grid and Cooperative Computing (GCC2005), Springer LNCS
, 2005
"... Abstract. In peer-to-peer (P2P) overlay networks, the mechanism of a peer randomly joining and leaving a network, causes a topology mismatch between the overlay and the underlying physical topology. This causes a large volume of redundant traffic in the underlying physical network as well as an extr ..."
Abstract
-
Cited by 5 (1 self)
- Add to MetaCart
(Show Context)
Abstract. In peer-to-peer (P2P) overlay networks, the mechanism of a peer randomly joining and leaving a network, causes a topology mismatch between the overlay and the underlying physical topology. This causes a large volume of redundant traffic in the underlying physical network as well as an extra delay in message delivery in the overlay network. Topology mismatch occurs because overlay networks are not aware of their underlying physical networks. In this paper we present a mathematical model for topology awareness of overlay networks (degree of matching between an overlay and its underlying physical network) and the efficiency of message delivery on them. We also after determining the computational complexity of the model, propose an optimization heuristic algorithm to increase topology awareness of P2P overlay networks. Then we present the results of running the algorithm on different kinds of random graphs and show, how we can implement the algorithm over P2P networks. 1
A new neighbour selection strategy for group-based wireless sensor networks
"... In any type of networks a neighbour selection method is needed to form the topology of the network and to know which node the information has to be sent to reach a destination. Nowadays, several selection strategies exist that are based on different aspects and mainly designed to work in common netw ..."
Abstract
-
Cited by 4 (3 self)
- Add to MetaCart
(Show Context)
In any type of networks a neighbour selection method is needed to form the topology of the network and to know which node the information has to be sent to reach a destination. Nowadays, several selection strategies exist that are based on different aspects and mainly designed to work in common networks. In this paper we will show our study about those different methods and, then we show the development of a suitable neighbour selection strategy for group-based wireless sensor networks (WSN) that is based on a capacity parameter defined by us and the new neighbour distance. We also present the proposal architecture for WSNs and the protocol when a new node joins a group and has to select its neighbours.
A Group-Based Architecture for Wireless Sensor Networks
"... Abstract—Many routing protocols for ad-hoc networks and sensor networks have been designed, but none of them are based on groups. We propose to divide the network into several groups of sensors. When a sensor send data to other groups, the data has to arrive just to one sensor from each group, then ..."
Abstract
-
Cited by 2 (1 self)
- Add to MetaCart
(Show Context)
Abstract—Many routing protocols for ad-hoc networks and sensor networks have been designed, but none of them are based on groups. We propose to divide the network into several groups of sensors. When a sensor send data to other groups, the data has to arrive just to one sensor from each group, then they propagate it to the rest of sensors in their groups. We have simulated our proposal for different types of sensor topologies to know which type of topology is the best depending on the number of sensors in the whole network or depending on the number of interior sensors. We have also simulated how much time is needed to propagate information between groups. The application areas for our proposal could be rural and agricultural environments to detect plagues and to propagate it to neighbouring areas, or for military purposes to propagate information between neighbouring squads. Keywords-Sensor Network; Group-Based Architecture; Groupbased routing algorithm. I.
IP-based Clustering for Peer-to-Peer Overlays
"... Abstract — The efficiency of overlay networks built on top of the IP network is often threatened by the mismatch between the topologies of the overlay and the underlying IP network, resulting in unnecessary traffic and increased latencies. Substantial improvement can be achieved by optimizing the lo ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
Abstract — The efficiency of overlay networks built on top of the IP network is often threatened by the mismatch between the topologies of the overlay and the underlying IP network, resulting in unnecessary traffic and increased latencies. Substantial improvement can be achieved by optimizing the logical links between overlay nodes to better match the IP network topology. In this paper, we propose a new method for selfoptimization of a DHT-based peer-to-peer overlay. Our method has no need for active measurement of inter-node latencies, thus minimizing network traffic costs of node insertion and topology maintenance. We verify our method by means of analysis of large data sets of latency measurements between arbitrary nodes on the Internet, proving correlation among common IP prefix length of communicating nodes and latency. Index Terms — peer-to-peer, overlay network, topology mismatch problem, proximity neighbour selection I.
A Planar Group-Based Architecture to Scale Ad-Hoc and Sensor Networks
, 2009
"... It is known that grouping nodes gives better performance to the group and to the whole system, thereby avoiding unnecessary message forwarding and additional overheads while allows to scale the network considerably. Many routing protocols for ad-hoc networks and sensor networks have been designed, ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
(Show Context)
It is known that grouping nodes gives better performance to the group and to the whole system, thereby avoiding unnecessary message forwarding and additional overheads while allows to scale the network considerably. Many routing protocols for ad-hoc networks and sensor networks have been designed, but none of them is based on groups. In this paper, after a review of group based architectures and of neighbor selection strategies, a planar group-based network architecture is proposed. In the proposal, the network is formed by several groups of ad-hoc devices or sensors. Connections between groups are established as a function of the proximity and the neighbor's available capacity (based on the ad-hoc device or sensor’s energy). The messages that are needed to the proper operation are shown. It is also simulated how much time is needed to propagate information between groups and it is calculated the diameter for different topologies
Group-based Self-Organization Grid Architecture
"... Abstract. Many grid architectures have been developed since the first protogrid systems in the early 70’s, but there are not so many based on groups using an efficient node neighbor selection. This paper proposes a grid architecture based on groups. The architecture organizes logical connections bet ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
(Show Context)
Abstract. Many grid architectures have been developed since the first protogrid systems in the early 70’s, but there are not so many based on groups using an efficient node neighbor selection. This paper proposes a grid architecture based on groups. The architecture organizes logical connections between nodes from different groups of nodes allowing sharing resources, data or computing time between groups. Connections are used to find and share available resources from other groups and they are established based on node’s available capacity. Suitable nodes have higher roles in the architecture and their function is to organize connections based on a node selection process. Nodes ’ logical connections topology changes depending on some dynamic parameters. The architecture is scalable and fault-tolerant. We describe the protocol, its management and real measurements. It could be used as an intergrid protocol.
GET/INT-Institut National des
"... IP Telephony is a potential killer application among the various multimedia applications and services. It is therefore natural to expect support for these services over new network architectures like wireless ad-hoc networks. Despite the proliferation of IP Telephony services in the Internet, the tr ..."
Abstract
- Add to MetaCart
(Show Context)
IP Telephony is a potential killer application among the various multimedia applications and services. It is therefore natural to expect support for these services over new network architectures like wireless ad-hoc networks. Despite the proliferation of IP Telephony services in the Internet, the traditional client/server models that have been used are found to be highly inefficient for wireless ad-hoc networks as compared to peer-to-peer (P2P) models. On the other hand, P2P strategies require some tuning to work well in wireless ad-hoc networks. In this paper, we discuss some undesirable situation that may happen if P2P systems are deployed over wireless ad-hoc networks without adaptation. We then define our strategies for positioning Super Nodes in the physical network underlay as well as P2P ID space according to the constraints of these network technologies. We evaluate the efficiency of our approche in reducing the session establishment time and request failure rate as two important criteria for the performance of IP telephony systems.
Proximity Based Peer-to-Peer Overlay Networks (P3ON) with Load Distribution
"... Abstract. Construction of overlay networks without any consideration of real network topologies causes inefficient routing in peer-to-peer net-works. This paper presents the design and evaluation of a proximity based peer-to-peer overlay network (P3ON). P3ON is composed of two-tier overlay rings. Th ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract. Construction of overlay networks without any consideration of real network topologies causes inefficient routing in peer-to-peer net-works. This paper presents the design and evaluation of a proximity based peer-to-peer overlay network (P3ON). P3ON is composed of two-tier overlay rings. The high tier ring is a global overlay in which every node participates. Whereas, the low tier ring is a local overlay that consists of nodes in the same autonomous system (AS). Since the low tier ring consists of nearby nodes (in the same AS), the lookup latency can be sig-nificantly reduced if the first search within the low tier ring is successful. Also, to cope with skewness of load (of key lookup) distribution, P3ON effectively replicates the popular keys (and results) to neighbor nodes and neighbor ASs. Simulation results reveal that P3ON outperforms the existing ring-based P2P network in terms of lookup time and achieves relatively balanced load distribution.
