DRIP: A Dynamic VoRonoi RegIons-Based Publish/Subscribe Protocol in Mobile Networks

Yuan, Quan; Wu, Jie

doi:10.1109/infocom.2008.277

Cited by 17 publications

(15 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We propose the GSPS to build and manage the super-peer overlay characterized by the minimum number of super-peers. Inspired by the method called VoRonoi Regions set up in the mobile network [22] and the clustering method [23], super-peers are first selected during the overlay construction.…”

Section: Selecting Super-peers and Client Peersmentioning

confidence: 99%

A Robust Algorithm for the Membership Management of Super-Peer Overlay

Liu

Zhou

Koskela

et al. 2009

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Peer-to-Peer technologies have been widely applied for multimedia applications. The super-peer based approach provides an efficient way to run applications by exploring nodes' heterogeneity. In P2P live video streaming, even though the number of stable nodes is small, they have significant impact on the performance of the network. Thus, we present a super-peer-based overlay design, where stable nodes are assigned as super-peers that organize client nodes. A gossip-based super-peer selection algorithm (GSPS) is proposed to identify the stable nodes to be chosen as super-peers and to manage the client nodes (namely the membership management). The basic idea of the GSPS is: first, a set of super-peer candidates for a node is built based on the gossip, then the role of this node is identified and the corresponding operations are executed. Simulation results show that the GSPS is efficient in managing the super-peer overlay and robust to the failure of super-peers.Keywords: Peer-to-Peer, super-peer, gossip, robustness. IntroductionThe peer-to-peer (P2P) paradigm provides an effective approach to construct largescale systems with high robustness, mainly due to their inherent decentralization and redundant structures [1] [2] [3]. Moreover, the P2P systems are able to utilize the resources distributed in a large number of machines connected to the system through the Internet. Therefore, much work focuses on building the P2P overlay, such asIn these research studies, Random walk and Graph theory are utilized for the construction of the overlay. For the management of the overlay, the diameter, and the degree are two important qualities to consider. The super-peer-based overlay (such as Gnutella [9] and Kazaa [10]) provides an effective way to run applications by utilizing the heterogeneity of the peer nodes. Specifically, the super-peer approach does not have the disadvantage of the traditional client-server model (the single point of failure), resulting in the increased robustness [11] [12] [13]. Moreover, the nodes with low capacity are shielded from the massive query traffic by the super-peers, which improves the scalability of the system.

show abstract

Section: Selecting Super-peers and Client Peersmentioning

confidence: 99%

A Robust Algorithm for the Membership Management of Super-Peer Overlay

Liu

Zhou

Koskela

et al. 2009

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…The difference in terms of number of messages produced for certain communication patterns can easily constitute up to two orders of magnitude. To strike a better balance, a third approach has been proposed with hybrid strategies [2,30]. These disseminate queries to a certain degree.…”

Section: Implementing Lpsmentioning

confidence: 99%

“…[17]), QCA (e.g. [28,1]), and Hybrid [2,30]. We use MCA, QCA and Hybrid implementations which disseminate messages using SGS and GCR, which facilitates comparisons.…”

Section: Algorithm Evaluationmentioning

confidence: 99%

ALPS – Adaptive Location-based Publish/Subscribe

Holzer¹,

Eugster²,

Garbinato³

2012

Computer Networks

View full text Add to dashboard Cite

Location-based publish/subscribe (LPS) is an important building block for contextaware applications in mobile ad hoc networks (MANETs). In LPS, published messages are routed based on their content as well as on the location of publishers and subscribers.Existing LPS algorithms can be coarsely classified as follows: (1) message-centric approaches consist in broadcasting published messages, (2) query-centric approaches broadcast subscriber queries for subsequently routing messages, and (3) hybrid approaches broadcast queries and messages each within restricted scopes. Each approach is clearly superior to others for particular communication patterns, e.g., for certain ratios between the number of queries and the number of messages in the network. This paper presents an adaptive location-based publish/subscribe (ALPS) algorithm for settings with multiple, unknown, or varying communication patterns. ALPS can be viewed as a parameterized hybrid LPS algorithm that can seamlessly move between message-and query-centricity based on estimations of the current communication pattern.We evaluate ALPS on two benchmark applications namely in the context of mobile social networking and robot swarms. Our results indicate that ALPS reduces the message complexity by up to a factor 3× compared to the best respective alternative, while performing comparably to the respective optimal solutions with static communication patterns, making ALPS appealing as a one-size-fits-all solution.

show abstract

“…In [3], Yuan and Wu discuss a publish/subscribe protocol that delivers events to interested nodes in the network. The Rank-Based Broadcast (RBB) technique [2] is another resource discovery technique, which ranks resources in its database and broadcasts the top-ranked resources to its neighbors.…”

Section: Related Workmentioning

confidence: 99%

Efficient Resource Discovery in Mobile Ad Hoc Networks

Thanawala

Srinivasan

2009

2009 IEEE International Conference on Communications

Self Cite

View full text Add to dashboard Cite

Abstract-The highly dynamic nature of infrastructureless adhoc networks poses new challenges during resource discovery. In this paper, we propose a novel algorithm for resource discovery in mobile ad hoc networks called Efficient Resource-Discovery (ERD). When proposing this novel algorithm, our primary goal is to spread the most relevant resources and queries to the nodes in the network. The proposed algorithm ERD is very efficient in dynamically ranking resources and queries based on their priority, selecting the transmission time, and determining how many resources and queries are to be transmitted. ERD utilizes the network bandwidth in an optimal manner avoiding the spread of redundant data in the network, which otherwise can significantly overload the network with duplicate copies. We compare ERD with periodic flooding and rank based broadcast (RBB) algorithms for mobile ad hoc networks. Results show that ERD outperforms both these algorithms significantly.

show abstract

DRIP: A Dynamic VoRonoi RegIons-Based Publish/Subscribe Protocol in Mobile Networks

Cited by 17 publications

References 7 publications

A Robust Algorithm for the Membership Management of Super-Peer Overlay

A Robust Algorithm for the Membership Management of Super-Peer Overlay

ALPS – Adaptive Location-based Publish/Subscribe

Efficient Resource Discovery in Mobile Ad Hoc Networks

Contact Info

Product

Resources

About