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
Showing 1 featured edition. View all 1 editions?
Edition | Availability |
---|---|
1
Infrastructureless data dissemination: A distributed hash table-based publish/subscribe system.
2005
in English
0494022116 9780494022115
|
aaaa
Libraries near you:
WorldCat
|
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
ID Numbers
Community Reviews (0)
Feedback?History
- Created October 21, 2008
- 2 revisions
Wikipedia citation
×CloseCopy and paste this code into your Wikipedia page. Need help?
December 15, 2009 | Edited by WorkBot | link works |
October 21, 2008 | Created by ImportBot | Imported from University of Toronto MARC record. |