A Spontaneous Overlay Search Tree

作者: Hung-Chang Hsiao , Chuan-Mao Lin , Chung-Ta King

DOI: 10.1007/978-3-540-45209-6_168

关键词:

摘要: It is often necessary to maintain a data structure, for example search tree, set of computing nodes, which are interconnected dynamically and spontaneously. Instead relying on centralized “official” server the grass-root spontaneous approach distribute structure participating nodes by taking advantages their distributed resources. This study shows feasibility such an designing tree called Pyramid, operate atop end systems without server. Pyramid allows manipulate transparently through high-level operations as search, insert, delete, update query. designed based peer-to-peer model. Its self-configuration -healing features enable manipulation information in unreliable unstable environment. A wireless application prototype presented.

参考文章(12)
Hung-Chang Hsiao, Chung-Ta King, Tornado: a capability-aware peer-to-peer storage network international parallel and distributed processing symposium. pp. 72- ,(2003) , 10.1109/IPDPS.2003.1213171
Ben Yanbin Zhao, John Kubiatowicz, Anthony D Joseph, Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and Routing ,(2001)
Witold Litwin, Marie-Anna Neimat, Donovan A. Schneider, LH*—a scalable, distributed data structure ACM Transactions on Database Systems. ,vol. 21, pp. 480- 525 ,(1996) , 10.1145/236711.236713
David Culler, Eric A. Brewer, Steven D. Gribble, Joseph M. Hellerstein, Scalable, distributed data structures for internet service construction operating systems design and implementation. pp. 22- ,(2000) , 10.5555/1251229.1251251
Brigitte Kröll, Peter Widmayer, Distributing a search tree among a growing number of processors international conference on management of data. ,vol. 23, pp. 265- 276 ,(1994) , 10.1145/191839.191891
Edith Cohen, Amos Fiat, Haim Kaplan, A case for associative peer to peer overlays acm special interest group on data communication. ,vol. 33, pp. 95- 100 ,(2003) , 10.1145/774763.774778
A. Crespo, H. Garcia-Molina, Routing indices for peer-to-peer systems international conference on distributed computing systems. pp. 23- 32 ,(2002) , 10.1109/ICDCS.2002.1022239
Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, Hari Balakrishnan, Chord Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications - SIGCOMM '01. ,vol. 31, pp. 149- 160 ,(2001) , 10.1145/383059.383071
Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp, Scott Schenker, A scalable content-addressable network Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications - SIGCOMM '01. ,vol. 31, pp. 161- 172 ,(2001) , 10.1145/383059.383072
Antony Rowstron, Peter Druschel, Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems Lecture Notes in Computer Science. ,vol. 2218, pp. 329- 350 ,(2001) , 10.1007/3-540-45518-3_18