Abstract
Overlay networks are widely used for peer-to-peer (P2P) systems and data center systems (cloud system). P2P and data center systems are in face of node frequently joining, leaving and failure, which leads to topological uncertainty and data uncertainty. Topological uncertainty refers to that overlay network is incomplete, i.e., failures of node and link (between two nodes). Data uncertainty refers to data inconsistency and inaccurate data placement. Existing P2P and data center systems have these two uncertainties, and uncertainties have an impact on querying latency. In this study, therefore, we first give probabilistic lower bounds of diameter and average query distance for overlay network in face of these two uncertainties. The querying latency of existing systems cannot be better than the bounds. Also, existing systems often suffer unsuccessful queries due to uncertainties. To support an efficient and accurate query, we propose a topology constructive method and a data placement strategy for removing two uncertainties from overlay network. Also, efficient algorithms are proposed to support range queries in an overlay network. The DeBruijn graph representing overlay network is used to construct a new system, Phoenix, based on proposed methods. Finally, experiments show that performances of Phoenix can exceed the probabilistic bounds, and they behave better than existing systems in terms of querying latency, querying costs, fault tolerance and maintenance overhead.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Ratnasamy, S., Francis, P., Handley, M.: A scalable content-addressable network. In: Proc. of the ACM SIGCOMM (2001)
Stoica, I., Morris, R., Karger, D.: Chord: a scalable peer-to-peer lookup service for internet applications. In: Proc. of the ACM SIGCOMM (2001)
Gauron, P.: D2B: a de bruijn based content-addressable network. Theor. Comput. Sci. (2006)
Kaashoek, F., Karger, D.R.: Koorde: a simple degree-optimal hash table. In: IPTPS (2003)
Malkhi, D.: Viceroy: a scalable and dynamic emulation of the butterfly. In: SODA (2002)
Xu, J., Kumar, A., Yu, X.: On the fundamental tradeoffs between routing table size and network diameter in peer-to-peer networks. IEEE J. Sel. Areas Commun. (2004)
Shen, H.: Cycloid: a constant-degree and lookupefficient p2p overlay network. In: IPDPS (2004)
Banerjee, S., Sarkar, D.: Hypercube connected rings: a scalable and fault-tolerant logical topology for optical networks. In: Computer Communications (2001)
Guo, D., Wu, J., Liu, Y., Jin, H., Chen, H., Chen, T.: Quasi-kautz digraphs for peer-to-peer networks. TPDS (August 24, 2010)
Guo, D., Liu, Y., Li, X.: BAKE: a balanced kautz tree structure for peer-to- peer networks. In: Proc. of INFOCOM, Phoenix, AZ, USA (April 2008)
Li, D., Guo, C., Wu, H., Zhang, Y., Lu, S.: Ficonn: using backup port for server interconnection in data centers. In: Proc. IEEE INFOCOM, Brazil (2009)
Guo, C., Lu, G., Li, D.: Bcube: a high performance, server-centric network architecture for modular data centers. In: Proc. SIGCOMM, Barcelona, Spain (2009)
He, Y., Liu, Y.: VOVO: VCR-oriented video-on-demand in large-scale peer-to-peer Networks. IEEE TPDS 20(4), 528–539 (2009)
Liu, Y.: A two-hop solution to solving topology mismatch. TPDS 19(11), 1591–1600 (2008)
Greenberg, A., Jain, N., Kandula, S., Kim, C., Lahiri, P., Maltz, D.A., Patel, P.: Vl2: A scalable and flexible data center network. In: Proc. of SIGCOMM, Barcelona, Spain (2009)
Szpankowski, W.: Patricia trees again revisited. Journal of the ACM 37 (1990)
DeGroot, M.H.: Probability and statistics. Addison-Wesley, Reading (2001)
Guo, D., Wu, J., Chen, H.: Moore: an extendable P2P network based on incomplete kautz digraph with constant degree. In: Proc. of 26th IEEE INFOCOM (May 2007)
Liu, Y., Xiao, L., Ni, L.M.: Building a scalable bipartite P2P overlay network. IEEE TPDS 18(9), 1296–1306 (2007)
Liu, Y., Xiao, L., Liu, X., Ni, L.M., Zhang, X.: Location awareness in unstructured peer-to-peer systems. IEEE TPDS 16(2), 163–174 (2005)
Jagadish, H.V., Ooi, B.C., Vu, Q.H.: BATON: A balanced tree structure for peer-to-peer networks. In: Proceedings of the 31st VLDB Conference (2005)
Bridges, W.G., Toueg, S.: On the impossibility of directed moore graphs. Journal of Combinatorial Theory, Series B29(3) (1980)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yuan, Y., Guo, D., Wang, G., Chen, L. (2011). Removing Uncertainties from Overlay Network. In: Yu, J.X., Kim, M.H., Unland, R. (eds) Database Systems for Advanced Applications. DASFAA 2011. Lecture Notes in Computer Science, vol 6587. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20149-3_22
Download citation
DOI: https://doi.org/10.1007/978-3-642-20149-3_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20148-6
Online ISBN: 978-3-642-20149-3
eBook Packages: Computer ScienceComputer Science (R0)