An Efficient Hybrid Lookup Service Exploiting Localized Query Traffic

질의의 지역성을 이용한 효율적인 하이브리드 검색 서비스

  • 이상환 (국민대학교 전자정보통신대학 컴퓨터공학부) ;
  • 한재일 (국민대학교 전자정보통신대학 컴퓨터공학부) ;
  • 김철수 (한국전자통신연구원 RFID/USN 서비스 연구팀) ;
  • 황재각 (한국전자통신연구원 RFID/USN 서비스 연구팀)
  • Published : 2009.09.30

Abstract

Since the development of the Distributed Hash Tables (DHTs), the distributed lookup services are one of the hot topics in the networking area. The main reason of this popularity is the simplicity of the lookup structure. However, the simple key based search mechanism makes the so called "keyword" based search difficult if not impossible. Thus, the applicability of the DHTs is limited to certain areas. In this paper. we find that DHTs can be used as the ubiquitous sensor network (USN) metadata lookup service across a large number of sensor networks. The popularity of the Ubiquitous Sensor Network has motivated the development of the USN middleware services for the sensor networks. One of the key functionalities of the USN middleware service is the lookup of the USN metadata, by which users get various information about the sensor network such as the type of the sensor networks and/or nodes, the residual of the batteries, the type of the sensor nodes. Traditional distributed hash table based lookup systems are good for one sensor network. However, as the number of sensor network increases, the need to integrate the lookup services of many autonomous sensor networks so that they can provide the users an integrated view of the entire sensor network. In this paper, we provide a hybrid lookup model, in which the autonomous lookup services are combined together and provide seamless services across the boundary of a single lookup services. We show that the hybrid model can provide far better lookup performance than a single lookup system.

Keywords

References

  1. Stoica, I., R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan, "Chord : A scalable peer-to-peer lookup service for Internet applications", in Proceedings of ACMSIGCOMM(2001), San Diego, CA https://doi.org/10.1145/964723.383071
  2. Rowstron, A. and P. Drushel, "Pastry : Scalable, distributed object location and routing for large-scale peer-to-peer systems", in Proceedings of IFIP/ACM International Conference on Distributed Systems Platforms (Middleware)(2001), Heidelberg, Germany
  3. Ratnasamy, S., P. Francis, M. Handley, R. Karp, and S. Shenker, "A scalable contentaddressable network", in Proceedings of ACMSIGCOMM(2001), San Diego, CA
  4. Yu, Y., S. Lee, and Z. L. Zhang, "Leopard : A locality-aware peer-topeer system with no hot spot", in Proceedings of the 4th IFIP Networking Conference (2005), Waterloo, Canada
  5. Weiser, M., "Some computer science issues in ubiquitous computing", Communications of the ACM, Vol.36, No.7(1993), pp.75-84 https://doi.org/10.1145/159544.159617
  6. Lee, S. H., J. Han, and C. S. Kim, "DChord: An Efficient and Robust Peer-to-Peer Lookup System", submitted to a Journal
  7. Adamic1, L. A. and A. H. Bernardo, "Zipf's law and the Internet", Glottometrics, Vol.3 (2002), pp.143-150
  8. Garces-Erice, L., E. W. Biersack, P. A. Felber, K. W. Ross, and G. Urvoy-Keller, "Hierarchical Peer-to-Peer Systems", Euro-Par 2003, LNCS, Vol.2790(2003), pp.1230-1239 https://doi.org/10.1007/978-3-540-45209-6_166
  9. Planetlab, https://www.planet-lab.org/