A Tabu Based Cache to Improve Latency and Load Balancing on Prefix Trees

Distributed Hash Tables (DHTs) provide the substrate to build large scale distributed applications over Peer-to-Peer networks. A major limitation of DHTs is that they only support exact-match queries. In order to offer range queries over a DHT it is necessary to build additional indexing structures. Prefix-based indexes, such as Prefix Hash Tree (PHT), are interesting approaches for building distributed indexes on top of DHTs. Nevertheless, the lookup operation of these indexes usually generates a high amount of unnecessary traffic overhead which degrades system performance by increasing response time. In this paper, we propose a novel distributed cache system called Tabu Prefix Table Cache (TPT-C), aiming at improving the performance of the Prefix-trees. We have implemented our solution over PHT, and the results confirm that our searching approach reduces up to a 70% the search latency and traffic overhead.

[1]  Sriram Ramabhadran,et al.  Prefix Hash Tree An Indexing Data Structure over Distributed Hash Tables , 2004, PODC 2004.

[2]  Dimitrios Tsoumakos,et al.  Replica-aware, multi-dimensional range queries in Distributed Hash Tables , 2010, Comput. Commun..

[3]  Akbar Ghaffarpour Rahbar,et al.  PowerTrust: A Robust and Scalable Reputation System for Trusted Peer-to-Peer Computing , 2007, IEEE Transactions on Parallel and Distributed Systems.

[4]  Karl Aberer,et al.  P-Grid: a self-organizing structured P2P system , 2003, SGMD.

[5]  Nian-Feng Tzeng,et al.  FaSReD: Fast and Scalable Resource Discovery in Support of Multiple Resource Range Requirements for Computational Grids , 2008, 2008 Seventh IEEE International Symposium on Network Computing and Applications.

[6]  Anand Sivasubramaniam,et al.  DPTree: A Balanced Tree Based Indexing Framework for Peer-to-Peer Systems , 2006, Proceedings of the 2006 IEEE International Conference on Network Protocols.

[7]  Jianliang Xu,et al.  LIGHT: A Query-Efficient Yet Low-Maintenance Indexing Scheme over DHTs , 2010, IEEE Transactions on Knowledge and Data Engineering.

[8]  Srinivasan Seshan,et al.  Mercury: supporting scalable multi-attribute range queries , 2004, SIGCOMM '04.

[9]  Michael B. Jones,et al.  SkipNet: A Scalable Overlay Network with Practical Locality Properties , 2003, USENIX Symposium on Internet Technologies and Systems.

[10]  Shipeng Li,et al.  Distributed Segment Tree: Support of Range Query and Cover Query over DHT , 2006, IPTPS.

[11]  Gade Krishna,et al.  A scalable peer-to-peer lookup protocol for Internet applications , 2012 .

[12]  Jun Gao,et al.  An adaptive protocol for efficient support of range queries in DHT-based systems , 2004, Proceedings of the 12th IEEE International Conference on Network Protocols, 2004. ICNP 2004..

[13]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[14]  Beng Chin Ooi,et al.  BATON: A Balanced Tree Structure for Peer-to-Peer Networks , 2005, VLDB.

[15]  Hai Jin,et al.  Yarqs: Yet Another Range Queries Schema in DHT Based P2P Network , 2009, 2009 Ninth IEEE International Conference on Computer and Information Technology.

[16]  Min Cai,et al.  MAAN: A Multi-Attribute Addressable Network for Grid Information Services , 2003, Journal of Grid Computing.

[17]  Klara Nahrstedt,et al.  RandPeer: Membership Management for QoS Sensitive Peer-to-Peer Applications , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[18]  Sriram Ramabhadran,et al.  A case study in building layered DHT applications , 2005, SIGCOMM '05.

[19]  Hossein Saiedian,et al.  A framework for improving software maintenance efficiency , 1994 .

[20]  James Aspnes,et al.  Skip graphs , 2003, SODA '03.