Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer-journals/survey-of-dht-topology-construction-techniques-in-virtual-computing-w7ykSyDXgn
References (79)
-
A. Gai, L. Viennot (2004)
Broose: a practical distributed hashtable based on the de-Bruijn topologyProceedings. Fourth International Conference on Peer-to-Peer Computing, 2004. Proceedings.
-
I. Stoica, R. Morris, David Karger, M. Kaashoek, H. Balakrishnan (2001)
Chord: A scalable peer-to-peer lookup service for internet applications -
Ping Wu, Caijie Zhang, Ying Feng, Ben Zhao, D. Agrawal, A. Abbadi (2006)
Parallelizing Skyline Queries for Scalable Distribution -
P. Fraigniaud, P. Gauron (2006)
D2B: A de Bruijn based content-addressable networkTheor. Comput. Sci., 355
-
M. Castro, Manuel Costa, A. Rowstron (2005)
Debunking some myths about structured and unstructured overlays, 2
-
W. Pugh (1989)
Skip lists: a probabilistic alternative to balanced trees -
A. Rowstron, P. Druschel (2001)
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems -
P. Yalagandula, Michael Dahlin (2004)
A scalable distributed information management system -
M. Castro, Manuel Costa, A. Rowstron (2004)
Performance and dependability of structured peer-to-peer overlaysInternational Conference on Dependable Systems and Networks, 2004
-
Ben Zhao, Ling Huang, J. Stribling, Sean Rhea, A. Joseph, J. Kubiatowicz (2004)
Tapestry: a resilient global-scale overlay for service deploymentIEEE Journal on Selected Areas in Communications, 22
-
He-ying Zhang, Baohong Liu, Wenhua Dou (2003)
Design of a robust active queue management algorithm based on feedback compensation -
S. Ratnasamy, I. Stoica, S. Shenker (2002)
Routing Algorithms for DHTs: Some Open Questions -
T. Roscoe (2004)
Handling churn in a DHT -
D. Hoffman, T. Novak, A. Venkatesh (2004)
Has the Internet become indispensable?Commun. ACM, 47
-
Indranil Gupta, K. Birman, Prakash Linga, A. Demers, R. Renesse (2003)
Kelips: Building an Efficient and Stable P2P DHT through Increased Memory and Background Overhead -
(1969)
The design of optimum interconnection networks for multiprocessors. In: Architecture and Design of Digital Computer -
I. J. Taylor (2005)
From P2P to Web Services and Grids -
Dongsheng Li, Xicheng Lu, Baosheng Wang, Jinshu Su, Jiannong Cao, Keith Chan, H. Leong (2006)
Delay-Bounded Range Queries in DHT-based Peer-to-Peer Systems26th IEEE International Conference on Distributed Computing Systems (ICDCS'06)
-
D. Malkhi, M. Naor, David Ratajczak (2002)
Viceroy: a scalable and dynamic emulation of the butterfly -
(2005)
Research on peer-to-peer resource location in large-scale distributed systems -
Haiying Shen, Chengzhong Xu, Guihai Chen (2004)
Cycloid: a constant-degree and lookup-efficient P2P overlay network18th International Parallel and Distributed Processing Symposium, 2004. Proceedings.
-
K. Albrecht, Ruedi Arnold, M. Gähwiler, Roger Wattenhofer (2004)
Aggregating information in peer-to-peer systems for improved join and leaveProceedings. Fourth International Conference on Peer-to-Peer Computing, 2004. Proceedings.
-
P. Cao, Zhe Wang (2004)
Efficient top-K query calculation in distributed networks -
Zhang Yiming, Li Dongsheng, Lu Xi-Cheng (2007)
Scalable Distributed Resource Information Service for Internet-Based Virtual Computing EnvironmentJournal of Software, 18
-
D. Loguinov, Anuj Kumar, Vivek Rai, Sai Ganesh (2003)
Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilienceIEEE/ACM Transactions on Networking, 13
-
(1969)
The design of optimum interconnection networks for multiprocessors -
Adina Crainiceanu, Prakash Linga, Ashwin Machanavajjhala, J. Gehrke, J. Shanmugasundaram (2007)
P-ring: an efficient and robust P2P range index structure -
Stephanos Androutsellis-Theotokis, D. Spinellis (2004)
A survey of peer-to-peer content distribution technologiesACM Comput. Surv., 36
-
Yiming Zhang, Lei Chen, Xicheng Lu, Dongsheng Li (2010)
Enabling routing control in a DHTIEEE Journal on Selected Areas in Communications, 28
-
Gurmeet Singh, Manku, Mayank Bawa, Prabhakar Raghavan (2003)
Proceedings of Usits '03: 4th Usenix Symposium on Internet Technologies and Systems Symphony: Distributed Hashing in a Small World -
Ryan Huebsch, M. Garofalakis, J. Hellerstein, I. Stoica (2007)
Sharing aggregate computation for distributed queries -
Y. Tang, Shuigeng Zhou (2008)
LHT: A Low-Maintenance Indexing Scheme over DHTs2008 The 28th International Conference on Distributed Computing Systems
-
Prasanna Ganesan, K. Gummadi, H. Garcia-Molina (2004)
Canon in G major: designing DHTs with hierarchical structure24th International Conference on Distributed Computing Systems, 2004. Proceedings.
-
Sean Rhea, Dennis Geels, Timothy Roscoe, J. Kubiatowicz (2004)
USENIX Association Proceedings of the General Track : -
A. Kumar J. Xu (2004)
On the fundamental tradeoffs between routing table size and network diameter in peer-to-peer networksIEEE J Sel Area Comm, 22
-
H. Jagadzsh (1998)
Linear Clustering of Objects with Multiple Attributes -
H. Jagadish, B. Ooi, K. Tan, Q. Vu, Rong-Juan Zhang (2006)
Speeding up search in peer-to-peer networks with a multi-way tree structureProceedings of the 2006 ACM SIGMOD international conference on Management of data
-
Dahlin M. Administrative Autonomy in Structured Overlays. Technical Report Yalagandula P (2006)
Yalagandula P, Dahlin M. Administrative Autonomy in Structured Overlays. Technical Report, University of Texas at Austin. 2006 -
Dongsheng Li, Xicheng Lu, Jie Wu (2005)
FISSIONE: a scalable constant degree and low congestion DHT scheme based on Kautz graphsProceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies., 3
-
J. Risson, T. Moors (2006)
Survey of research towards robust peer-to-peer networks: Search methodsRFC, 4981
-
Haiying Shen, Chengzhong Xu (2006)
Elastic Routing Table with Provable Performance for Congestion Control in DHT Networks26th IEEE International Conference on Distributed Computing Systems (ICDCS'06)
-
Chun B Huebsch R (2005)
an internet-scale query processor. In: Proceedings of CIDR 2005. AsilomarProceedings of CIDR 2005
-
Prasanna Ganesan, Beverly Yang, H. Garcia-Molina (2004)
One torus to rule them all: multi-dimensional queries in P2P systems -
H. Balakrishnan, M. Kaashoek, David Karger, R. Morris, I. Stoica (2003)
Looking up data in P2P systemsCommun. ACM, 46
-
H. Jagadish, B. Ooi, Q. Vu (2005)
BATON: A Balanced Tree Structure for Peer-to-Peer Networks -
Gade Krishna (2012)
A scalable peer-to-peer lookup protocol for Internet applications -
Ranjita Bhagwan, G. Varghese, G. Voelker (2003)
Cone: Augmenting DHTs to Support Distributed Resource Discovery -
R. Morris I. Stoica (2003)
Chord: a scalable peer-to-peer lookup service for Internet applicationsIEEE ACM Trans Netw, 11
-
C. Z. Xu H. Y. Shen (2005)
Cycloid: a scalable constant-degree p2p overlay networkPerform Evaluation, 63
-
Adina Crainiceanu, Prakash Linga, J. Gehrke, J. Shanmugasundaram (2004)
P-tree: a p2p index for resource discovery applications -
Molina H G Daswani N (2003)
Daswani N, Molina H G, Yang B. Open problems in data-sharing peer-to-peer systems. ICDT 2003. -
Y. Chawathe, Sriram Ramabhadran, S. Ratnasamy, A. LaMarca, S. Shenker, J. Hellerstein (2005)
A case study in building layered DHT applications -
Jun Xu (2003)
On the fundamental tradeoffs between routing table size and network diameter in peer-to-peer networksIEEE Journal on Selected Areas in Communications, 22
-
Costa M Castro M (2003)
94, Microsoft Research -
S. Saroiu (2003)
Skipnet: a scalable overlay network with practical locality properties -
David Karger, M. Ruhl (2004)
Diminished Chord: A Protocol for Heterogeneous Subgroup Formation in Peer-to-Peer Networks -
P. Maymounkov, David Mazières (2002)
Kademlia: A Peer-to-Peer Information System Based on the XOR Metric -
Abhishek Gupta, D. Agrawal, A. Abbadi (2003)
Approximate Range Selection Queries in Peer-to-Peer Systems -
Lijiang Chen, B. Cui, Hua Lu, Linhao Xu, Quanqing Xu (2008)
iSky: Efficient and Progressive Skyline Computing in a Structured P2P Network2008 The 28th International Conference on Distributed Computing Systems
-
Sean Rhea, Dennis Geels, Timothy Roscoe, J. Kubiatowicz (2004)
Handling Churn in a DHT (Awarded Best Paper!) -
Yiming Zhang, Ling Liu, Dongsheng Li, Feng Liu, Xicheng Lu (2009)
DHT-Based Range Query Processing for Web Service Discovery2009 IEEE International Conference on Web Services
-
D. Schoder, K. Fischbach (2003)
Peer-to-peer prospectsCommun. ACM, 46
-
Agrawal D Gupta A (2003)
Proceedings of the 1st Biennial Conference on Innovative Data Systems ResearchProceedings of the 1st Biennial Conference on Innovative Data Systems Research (CIDR)
-
Ruhl M. Diminished chord Karger D (2004)
a protocol for heterogeneous sub-group formation in peer-to-peer networks. In: Voelker GVoelker G
-
B. Karp (2005)
OpenDHT: a public DHT service and its uses -
Jinyang Li, J. Stribling, R. Morris, F. Kaashoek (2005)
Bandwidth-efficient management of DHT routing tables -
Ryan Huebsch, Brent Chun, J. Hellerstein, B. Loo, Petros Maniatis, Timothy Roscoe, S. Shenker, I. Stoica, Aydan Yumerefendi (2005)
The Architecture of PIER: an Internet-Scale Query Processor -
M. Cai, Martin Frank, Jinbo Chen, Pedro Szekely (2003)
MAAN: A Multi-Attribute Addressable Network for Grid Information ServicesJournal of Grid Computing, 2
-
de Bruijn (1946)
A combinatorial problem, 49
-
C. Schmidt, M. Parashar (2004)
Enabling flexible queries with guarantees in P2P systemsIEEE Internet Computing, 8
-
C. Plaxton, R. Rajaraman, A. Richa (1997)
Accessing Nearby Copies of Replicated Objects in a Distributed EnvironmentTheory of Computing Systems, 32
-
Neil Daswani, H. Garcia-Molina, Beverly Yang (2003)
Open Problems in Data-Sharing Peer-to-Peer Systems -
Xicheng Lu, Huaimin Wang, Ji Wang (2006)
Internet-based virtual computing environment (iVCE): Concepts and architectureScience in China Series F: Information Sciences, 49
-
Moors T. Survey of Research towards Robust Peer-to-Peer Networks Risson J (2004)
Search Methods. Technical Report UNSW-EE-P2P-1-1. 2004 -
Abhishek Kumar, S. Merugu, Jun Xu, E. Zegura, Xingxing Yu (2003)
Ulysses: a robust, low-diameter, low-latency peer-to-peer network11th IEEE International Conference on Network Protocols, 2003. Proceedings.
-
David Oppenheimer, Jeannie Albrecht, D. Patterson, Amin Vahdat (2004)
Distributed Resource Discovery on PlanetLab with SWORD -
Ashwin Bharambe, Mukesh Agrawal, S. Seshan (2004)
Mercury: supporting scalable multi-attribute range queries -
M. Kaashoek, David Karger (2003)
Koorde: A Simple Degree-Optimal Distributed Hash Table -
S. Ratnasamy, P. Francis, M. Handley, R. Karp, S. Shenker (2001)
A scalable content-addressable network
- Publisher
- Springer Journals
- Copyright
- 2011 Science China Press and Springer-Verlag Berlin Heidelberg
- ISSN
- 1674-733X
- eISSN
- 1869-1919
- DOI
- 10.1007/s11432-011-4377-6
- Publisher site
- See Article on Publisher Site
Abstract
Abstract The Internet-based virtual computing environment (iVCE) is a novel network computing platform. The characteristics of growth, autonomy, and diversity of Internet resources present great challenges to resource sharing in iVCE. The DHT overlay (DHT for short) technique has various advantages such as high scalability, low latency, and desirable availability, and is thus an important approach to realizing efficient resource sharing. Topology construction is a key technique for structured overlays that realizes basic overlay functions including dynamic maintenance and message routing. In this paper, we first introduce the traditional techniques of DHT topology construction, focusing mainly on dynamic maintenance and message routing of typical DHTs, DHT indexing techniques for complex queries, and DHT grouping techniques for matching domain structures. We then present recent advances in DHT topology construction techniques in iVCE taking advantage of the characteristics of Internet resources. Finally, we discuss the future of DHT topology construction techniques.
Journal
Science China Information Sciences – Springer Journals
Published: Nov 1, 2011