Journal of Information Processing Systems

Korea Information Processing Society (한국정보처리학회)
권호 표지
DOI QR코드

DOI QR Code

A Structured Overlay Network Scheme Based on Multiple Different Time Intervals

  • Received : 2019.04.01
  • Accepted : 2020.01.14
  • Published : 2020.12.31
Download PDF
⟨ Previous Next ⟩

Abstract

This paper describes a structured overlay network scheme based on multiple different time intervals. Many types of data (e.g., sensor data) can be requested at specific time intervals that depend on the user and the system. These queries are referred to as "interval queries." A method for constructing an overlay network that efficiently processes interval queries based on multiple different time intervals is proposed herein. The proposed method assumes a ring topology and assigns nodes to a keyspace based on one-dimensional time information. To reduce the number of forwarded messages for queries, each node constructs shortcut links for each interval that users tend to request. This study confirmed that the proposed method reduces the number of messages needed to process interval queries. The contributions of this study include the clarification of interval queries with specific time intervals; establishment of a structured overlay network scheme based on multiple different time intervals; and experimental verification of the scheme in terms of communication load, delay, and maintenance cost.

Keywords

References

  1. J. Lin, W. Yu, N. Zhang, X. Yang, H. Zhang, and W. Zhao, "A survey on Internet of Things: architecture, enabling technologies, security and privacy, and applications," IEEE Internet of Things Journal, vol. 4, no. 5, pp. 1125-1142, 2017. https://doi.org/10.1109/JIOT.2017.2683200
  2. A. Colakovic and M. Hadzialic, "Internet of Things (IoT): a review of enabling technologies, challenges, and open research issues," Computer Networks, vol. 144, pp. 17-39, 2018. https://doi.org/10.1016/j.comnet.2018.07.017
  3. I. Stoica, R. Morris, D. Liben-Nowell, D. R. Karger, M. F. Kaashoek, F. Dabek, and H. Balakrishnan, "Chord: a scalable peer-to-peer lookup protocol for Internet applications," IEEE/ACM Transactions on Networking, vol. 11, no. 1, pp. 17-32, 2003. https://doi.org/10.1109/TNET.2002.808407
  4. Y. Shu, B. C. Ooi, K. L. Tan, and A. Zhou, "Supporting multi-dimensional range queries in peer-to-peer systems," in Proceedings of the 5th IEEE International Conference on Peer-to-Peer Computing (P2P 2005), Konstanz, Germany, 2005, pp. 173-180.
  5. S. K. Tetarave, S. Tripathy, and R. K. Ghosh, "V-Chord: an efficient file sharing on LTE/GSM Network," in Proceedings of the 19th International Conference on Distributed Computing and Networking (ICDCN), Varanasi, India, 2018, pp. 1-8.
  6. L. Cheklat, M. Amad, M. Omar, and A. Boukerram, "Energy efficient physical proximity based Chord protocol for data delivery in WSNs," in Proceedings of the 2018 International Conference on Applied Smart Systems (ICASS), Medea, Algeria, 2018, pp. 1-6.
  7. T. Gu, S. J. Hong, S. Uhmn, and K. M. Lee, "Membership management based on a hierarchical ring for large grid environments," Journal of Information Processing Systems, vol. 3, no. 1, pp. 8-15, 2007. https://doi.org/10.3745/JIPS.2007.3.1.008
  8. W. Zhang, H. Tang, S. Byna, and Y. Chen, "DART: distributed adaptive radix tree for efficient affix-based keyword search on HPC systems," in Proceedings of the 27th International Conference on Parallel Architectures and Compilation Techniques (PACT), Limassol, Cyprus, 2018, pp. 1-12.
  9. J. Aspnes and G. Shah, "Skip graphs," ACM Transactions on Algorithms, vol. 3, no. 4, article no. 37, 2007.
  10. S. Takeuchi, J. Shinomiya, T. Shiraki, Y. Ishi, Y. Teranishi, M. Yoshida, and S. Shimojo, "A large scale keyvalue store based on range-key Skip Graph and its applications," in Database Systems for Advanced Applications. Heidelberg, Germany: Springer, 2010, pp. 432-435.
  11. R. Banno, T. Fujino, S. Takeuchi, and M. Takemoto, "SFB: a scalable method for handling range queries on skip graphs," IEICE Communications Express, vol. 4, no. 1, pp. 14-19, 2015. https://doi.org/10.1587/comex.4.14
  12. S. T. Boshrooyeh and O. Ozkasap, "Guard: secure routing in skip graph," in Proceedings of the 2017 IFIP Networking Conference (IFIP Networking) and Workshops, Stockholm, Sweden, 2017.
  13. Y. Hassanzadeh-Nazarabadi and O. Ozkasap, "ELATS: energy and locality aware aggregation tree for skip graph," in Proceedings of the 2017 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom), Istanbul, Turkey, 2017.
  14. Y. Aoki, M. Ohnishi, and K. Shudo, "Ballistic skip graph: a skip graph-style constant-degree structured overlay," in Proceedings of the 23rd IEEE Symposium on Computers and Communications (ISCC), Natal, Brazil, 2018, pp. 341-346.
  15. A. Mondal, Y. Lifu, and M. Kitsuregawa, "P2PR-Tree: an R-tree-based spatial index for peer-to-peer environments," in Current Trends in Database Technology - EDBT 2004 Workshops. Heidelberg, Germany: Springer, 2004, pp. 516-525.
  16. E. Tanin, A. Harwood, and H. Samet, "Using a distributed quadtree index in peer-to-peer networks," The VLDB Journal, vol. 16, no. 2, pp. 165-178, 2007. https://doi.org/10.1007/s00778-005-0001-y
  17. F. Araujo and L. Rodrigues, "GeoPeer: a location-aware peer-to-peer system," in Proceedings of the 3rd IEEE International Symposium on Network Computing and Applications (NCA), Cambridge, MA, 2004, pp. 30-46.
  18. M. Ohnishi, M. Inoue, and H. Harai, "Incremental distributed construction method of Delaunay overlay network on detour overlay paths," Information and Media Technologies, vol. 8, no. 2, pp. 556-564, 2013.
  19. Y. Teranishi, S. Takeuchi, and K. Harumoto, "HDOV: an overlay network for wide area spatial data collection," in Proceedings of the 26th ACM Symposium on Applied Computing (SAC), TaiChung, Taiwan, 2011, pp. 506-513.
  20. K. Ragab, "An autonomic -interleaving registry overlay network for efficient ubiquities web services discovery service," Journal of Information Processing Systems, vol. 4, no. 2, pp. 53-60, 2008. https://doi.org/10.3745/JIPS.2008.4.2.053
  21. T. Kawakami, "A construction method for structured overlay networks based on multiple different time intervals," in Proceedings of the 2019 World Congress on Information Technology Applications and Services (World IT Congress 2019 Jeju), Jeju, South Korea, 2019, pp. 81-86.
  22. Q. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker, "Search and replication in unstructured peer-to-peer networks," in Proceedings of the 16th ACM International Conference on Supercomputing (ICS), New York, NY, 2002, pp. 84-95.
  23. V. Gopalakrishnan, B. Silaghi, B. Bhattacharjee, and P. Keleher, "Adaptive replication in peer-to-peer systems," in Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS), Tokyo, Japan, 2004, pp. 360-369.
  24. H. Yamamoto, D. Maruta, and Y. Oie, "Replication methods for load balancing on distributed storages in P2P networks," IEICE Transactions on Information and Systems, vol. 89, no. 1, pp. 171-180, 2006.
  25. K. P. N. Puttaswamy, A. Sala, and B. Y. Zhao, "Searching for rare objects using index replication," in Proceedings of the 27th IEEE International Conference on Computer Communications (INFOCOM), Phoenix, AZ, 2008, pp. 1723-1731.
  26. T. Schutt, F. Schintke, and A. Reinefeld, "Scalaris: reliable transactional P2P key/value store," in Proceedings of the 7th ACM SIGPLAN Workshop on ERLANG, Victoria, Canada, 2008, pp. 41-48.
  27. H. Shen and Y. Zhu, "A proactive low-overhead file replication scheme for structured P2P content delivery networks," Journal of Parallel and Distributed Computing, vol. 69, no. 5, pp. 429-440, 2009. https://doi.org/10.1016/j.jpdc.2009.02.008
  28. S. Legtchenko, S. Monnet, P. Sens, and G. Muller, "RelaxDHT: a churn-resilient replication strategy for peerto-peer distributed hash-tables," ACM Transactions on Autonomous and Adaptive Systems, vol. 7, no. 2, article no. 28, 2012.
  29. H. Kim, S. Kang, and H. Y. Yeom, "Server selection schemes considering node status for a fault-tolerant streaming service on a peer-to-peer network," Journal of Information Processing Systems, vol. 2, no. 1, pp. 6-12, 2006. https://doi.org/10.3745/JIPS.2006.2.1.006
  30. Q. Cao and S. Fujita, "Cost-effective replication schemes for query load balancing in DHT-based peer-to-peer file searches," Journal of Information Processing Systems, vol. 10, no. 4, pp. 628-645, 2014. https://doi.org/10.3745/JIPS.03.0020
  31. S. Zahid, S. A. Abid, N. Shah, S. H. A. Naqvi, W. Mehmood, "Distributed partition detection with dynamic replication management in a DHT-based MANET," IEEE Access, vol. 6, pp. 18731-18746, 2018. https://doi.org/10.1109/access.2018.2814017
  32. Y. Hassanzadeh-Nazarabadi, A. Kupcu, and O. Ozkasap, "Decentralized and locality aware replication method for DHT-based P2P storage systems," Future Generation Computer Systems, vol. 84, pp. 32-46, 2018. https://doi.org/10.1016/j.future.2018.02.007
  33. Y. Teranishi, "PIAX: toward a framework for sensor overlay network," in Proceedings of the 6th Annual IEEE Consumer Communications and Networking Conference (CCNC), Las Vegas, NV, 2009, pp. 1-5.