Check nearby libraries
Buy this book

Peer-to-peer networks can offer benefits to distributed content-based publish/subscribe data dissemination systems. In particular, since a peer-to-peer network's aggregate resources grows as the number of participants increases, scalability can be achieved without managing or deploying additional infrastructure. This thesis proposes an efficient algorithm for supporting publish/subscribe subscriptions that specify a range of interest. The algorithm is built over the Pastry distributed hash table and is completely decentralized. Load balance is addressed by subscription delegation away from overloaded peers, and a bottom up tree search technique that avoids root hotspots. As well, fault-tolerance is achieved with a light-weight replication scheme that quickly detects and recovers from faults. Simulations support the scalability and fault-tolerance properties of the algorithm.
Check nearby libraries
Buy this book

Edition | Availability |
---|---|
1
Infrastructureless data dissemination: A distributed hash table-based publish/subscribe system.
2005
in English
0494022116 9780494022115
|
aaaa
|
Book Details
Edition Notes
Source: Masters Abstracts International, Volume: 44-01, page: 0402.
Thesis (M.A.Sc.)--University of Toronto, 2005.
Electronic version licensed for access by U. of T. users.
ROBARTS MICROTEXT copy on microfiche.
The Physical Object
Edition Identifiers
Work Identifiers
Community Reviews (0)
January 24, 2010 | Edited by WorkBot | add more information to works |
December 11, 2009 | Created by WorkBot | add works page |