@conference {17877,
	title = {DiST: fully decentralized indexing for querying distributed multidimensional datasets},
	booktitle = {Parallel and Distributed Processing Symposium, 2006. IPDPS 2006. 20th International},
	year = {2006},
	month = {2006/04//},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Grid computing and peer-to-peer (P2P) systems are emerging as new paradigms for managing large scale distributed resources across wide area networks. While grid computing focuses on managing heterogeneous resources and relies on centralized managers for resource and data discovery, P2P systems target scalable, decentralized methods for publishing and searching for data. In large distributed systems, a centralized resource manager is a potential performance bottleneck and decentralization can help avoid this bottleneck, as is done in P2P systems. However, the query functionality provided by most existing P2P systems is very rudimentary, and is not directly applicable to grid resource management. In this paper, we propose a fully decentralized multidimensional indexing structure, called DiST, that operates in a fully distributed environment with no centralized control. In DiST, each data server only acquires information about data on other servers from executing and routing queries. We describe the DiST algorithms for maintaining the decentralized network of data servers, including adding and deleting servers, the query routing algorithm, and failure recovery algorithms. We also evaluate the performance of the decentralized scheme against a more structured hierarchical indexing scheme that we have previously shown to perform well in distributed grid environments},
	keywords = {Computer network management, distributed multidimensional dataset querying, failure recovery, fault tolerant computing, fully decentralized multidimensional indexing, grid computing, Indexing, large scale distributed resource management, Large-scale systems, Multidimensional systems, Network servers, P2P systems, Peer to peer computing, peer-to-peer computing, peer-to-peer systems, Publishing, Query processing, query routing, resource allocation, Resource management, telecommunication network routing, wide area networks},
	isbn = {1-4244-0054-6},
	doi = {10.1109/IPDPS.2006.1639280},
	author = {Nam,Beomseok and Sussman, Alan}
}
@conference {16885,
	title = {A serverless 3D world},
	booktitle = {Proceedings of the 12th annual ACM international workshop on Geographic information systems},
	series = {GIS {\textquoteright}04},
	year = {2004},
	month = {2004///},
	pages = {157 - 165},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {Online multi-participant virtual-world systems have attracted significant interest from the Internet community but are hindered by their inability to efficiently support interactivity for a large number of participants. Current solutions divide a large virtual-world into a few mutually exclusive zones, with each zone controlled by a different server, and/or limit the number of participants per server or per virtual-world. Peer-to-Peer (P2P) systems are known to provide excellent scalability in a networked environment (one peer is introduced to the system by each participant), however current P2P applications can only provide file sharing and other forms of relatively simple data communications. In this paper, we present a generic 3D virtual-world application that runs on a P2P network with no central administration or server. Two issues are addressed by this paper to enable such a spatial application on a P2P network. First, we demonstrate how to index and query a 3D space on a dynamic distributed network. Second, we show how to build such a complex application from the ground level of a P2P routing algorithm. Our work leads to new directions for the development of online virtual-worlds that we believe can be used for many government, industry, and public domain applications.},
	keywords = {distributed hash tables, peer-to-peer systems, spatial data, virtual-worlds},
	isbn = {1-58113-979-9},
	doi = {10.1145/1032222.1032246},
	url = {http://doi.acm.org/10.1145/1032222.1032246},
	author = {Tanin,Egemen and Harwood,Aaron and Samet, Hanan and Nutanong,Sarana and Truong,Minh Tri}
}
@article {12309,
	title = {Scalable application layer multicast},
	journal = {SIGCOMM Comput. Commun. Rev.},
	volume = {32},
	year = {2002},
	month = {2002/08//},
	pages = {205 - 217},
	abstract = {We describe a new scalable application-layer multicast protocol, specifically designed for low-bandwidth, data streaming applications with large receiver sets. Our scheme is based upon a hierarchical clustering of the application-layer multicast peers and can support a number of different data delivery trees with desirable properties.We present extensive simulations of both our protocol and the Narada application-layer multicast protocol over Internet-like topologies. Our results show that for groups of size 32 or more, our protocol has lower link stress (by about 25\%), improved or similar end-to-end latencies and similar failure recovery properties. More importantly, it is able to achieve these results by using orders of magnitude lower control traffic.Finally, we present results from our wide-area testbed in which we experimented with 32-100 member groups distributed over 8 different sites. In our experiments, average group members established and maintained low-latency paths and incurred a maximum packet loss rate of less than 1\% as members randomly joined and left the multicast group. The average control overhead during our experiments was less than 1 Kbps for groups of size 100.},
	keywords = {application layer multicast, hierarchy, overlay networks, peer-to-peer systems, scalability},
	isbn = {0146-4833},
	doi = {10.1145/964725.633045},
	url = {http://doi.acm.org/10.1145/964725.633045},
	author = {Banerjee,Suman and Bhattacharjee, Bobby and Kommareddy,Christopher}
}
