Abstract
Telecom systems utilize the Distributed Hash Tables (DHTs) approach to build the network infrastructure for advantages of even distribution of workload, high scalability and cost-effectiveness. Although DHT is undoubtedly applicative in such architectures, some practical distinctions still should be considered to meet the performance requirements of telecom infrastructures. This paper focuses in two features of the distributed telecom system, so-called the real-time response and geographic partition, proposes a hierarchical DHT lookup service named Comb. Comb’s overlay is organized as a two-layered architecture, workload is distributed evenly among nodes and most queries can be routed in no more than two hops. Comb performs effectively with low bandwidth consumption and satisfactory fault tolerance even in a continuously changing environment. Both theoretical analysis and experimental result demonstrate that the two-layered architecture of Comb is feasible and efficient. Comb improves the performances on routing delay and lookup failure rates with high scalability and availability.
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.
References
Korzun, D., Gurtov, A.: Survey on hierarchical routing schemes in “flat” distributed hash tables. Peer-to-Peer Networking and Applications 4(4), 346–375 (2011)
Tang, C., Buco, M.J., Chang, R.N., et al.: Low traffic overlay networks with large routing tables. ACM SIGMETRICS Performance Evaluation Review 33(1), 14–25 (2005)
Lindman, P., Thorsell, L.: Applying distributed power modules in telecom systems. IEEE Transactions on Power Electronics 11(2), 365–373 (1996)
Garces-Erice, L., Biersack, E.W., Ross, K.W., et al.: Hierarchical peer-to-peer systems. Parallel Processing Letters 13(4), 643–657 (2003)
Karger, D., Lehman, E., Leighton, T., et al.: Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web. In: Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pp. 654–663. ACM (1997)
Stoica, I., Morris, R., Karger, D., et al.: Chord: A scalable peer-to-peer lookup service for internet applications. ACM SIGCOMM Computer Communication Review 31(4), 149–160 (2001)
Ratnasamy, S., Francis, P., Handley, M., et al.: A Scalable Content-Addressable Network (2001)
Maymounkov, P., Mazières, D.: Kademlia: A peer-to-peer information system based on the xor metric. In: Druschel, P., Kaashoek, F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, pp. 53–65. Springer, Heidelberg (2002)
Rowstron, A., Druschel, P.: Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, pp. 329–350. Springer, Heidelberg (2001)
Zhao, B.Y., Huang, L., Stribling, J., et al.: Tapestry: A resilient global-scale overlay for service deployment. IEEE Journal on Selected Areas in Communications 22(1), 41–53 (2004)
Korzun, D., Gurtov, A.: Hierarchical architectures in structured peer-to-peer overlay networks. Peer-to-Peer Networking and Applications, 1–37 (2013)
Fonseca, P., Rodrigues, R., Gupta, A., et al.: Full-information lookups for peer-to-peer overlays. IEEE Transactions on Parallel and Distributed Systems 20(9), 1339–1351 (2009)
Gupta, A., Liskov, B., Rodrigues, R.: Efficient routing for peer-to-peer overlays. In: First Symp. on Networked Systems Design and Implementation (NSDI), pp. 113–126 (2004)
Shi, G., Chen, J., Gong, H., et al.: Sandstone: A dht based carrier grade distributed storage system. In: IEEE International Conference on Parallel Processing, ICPP 2009, pp. 420–428 (2009)
Monnerat, L.R., Amorim, C.L.: D1HT: a distributed one hop hash table. In: IEEE 20th International Parallel and Distributed Processing Symposium, IPDPS 2006, p. 10 (2006)
Tang, C., Buco, M.J., Chang, R.N., et al.: Low traffic overlay networks with large routing tables. ACM SIGMETRICS Performance Evaluation Review 33(1), 14–25 (2005)
MIIT 2012, http://www.miit.gov.cn
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Shuang, K., Zhang, P., Su, S. (2013). An Efficient Lookup Service in DHT Based Communication System. In: Su, J., Zhao, B., Sun, Z., Wang, X., Wang, F., Xu, K. (eds) Frontiers in Internet Technologies. Communications in Computer and Information Science, vol 401. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-53959-6_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-53959-6_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-53958-9
Online ISBN: 978-3-642-53959-6
eBook Packages: Computer ScienceComputer Science (R0)
