A Structured Overlay Network Scheme Based on Multiple Different Time Intervals
2
조회
0
다운로드
2
인용
0
참고문헌
키워드
초록
This paper describes a structured overlay network scheme based on multiple different time intervals. Manytypes of data (e.g., sensor data) can be requested at specific time intervals that depend on the user and thesystem. These queries are referred to as “interval queries.” A method for constructing an overlay network thatefficiently processes interval queries based on multiple different time intervals is proposed herein. The proposedmethod 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 intervalthat users tend to request. This study confirmed that the proposed method reduces the number of messagesneeded to process interval queries. The contributions of this study include the clarification of interval querieswith specific time intervals; establishment of a structured overlay network scheme based on multiple differenttime intervals; and experimental verification of the scheme in terms of communication load, delay, andmaintenance cost.
Abstract
This paper describes a structured overlay network scheme based on multiple different time intervals. Manytypes of data (e.g., sensor data) can be requested at specific time intervals that depend on the user and thesystem. These queries are referred to as “interval queries.” A method for constructing an overlay network thatefficiently processes interval queries based on multiple different time intervals is proposed herein. The proposedmethod 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 intervalthat users tend to request. This study confirmed that the proposed method reduces the number of messagesneeded to process interval queries. The contributions of this study include the clarification of interval querieswith specific time intervals; establishment of a structured overlay network scheme based on multiple differenttime intervals; and experimental verification of the scheme in terms of communication load, delay, andmaintenance cost.
참고문헌 (33)
- J. Lin, "A survey on Internet of Things : architecture, enabling technologies, security and privacy, and applications", IEEE Internet of Things Journal, 4(5), pp.1125~1142 (2017)
- A. Colakovic, "Internet of Things(IoT) : a review of enabling technologies, challenges, and open research issues", Computer Networks, 144, pp.17~39 (2018)
- I. Stoica, "Chord : a scalable peer-to-peer lookup protocol for Internet applications", IEEE, 2003, pp.11(1), 17~32
- Y. Shu, "Supporting multi-dimensional range queries in peer-to-peer systems", Proceedings of the 5th IEEE International Conference on Peer-to-Peer Computing(P2P 2005), pp.173~180 (2005)
- S. K. Tetarave, "V-Chord : an efficient file sharing on LTE", GSM Network, 2018, 1~8
- L. Cheklat, "Energy efficient physical proximity based Chord protocol for data delivery in WSNs", Proceedings of the 2018 International Conference on Applied Smart Systems(ICASS), pp.1~6 (2018)
- T. Gu, "Membership management based on a hierarchical ring for large grid environments", Journal of Information Processing Systems, 3(1), pp.8~15 (2007)
- W. Zhang, "DART : distributed adaptive radix tree for efficient affix-based keyword search on HPC systems", Proceedings of the 27th International Conference on Parallel Architectures and Compilation Techniques(PACT), pp.1~12 (2018)
- J. Aspnes, "Skip graphs", ACM Transactions on Algorithms, 3(4), pp.37~ (2007)
- S. Takeuchi, "Database Systems for Advanced Applications", pp.432~435 (2010), Springer
- R. Banno, "SFB : a scalable method for handling range queries on skip graphs", IEICE Communications Express, 4(1), pp.14~19 (2015)
- S. T. Boshrooyeh, "Guard : secure routing in skip graph", Proceedings of the 2017 IFIP Networking Conference (IFIP Networking) and Workshops (2017)
- Y. Hassanzadeh-Nazarabadi, "ELATS : energy and locality aware aggregation tree for skip graph", Proceedings of the 2017 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom) (2017)
- Y. Aoki, "Ballistic skip graph : a skip graph-style constant-degree structured overlay", Proceedings of the 23rd IEEE Symposium on Computers and Communications (ISCC), pp.341~346 (2018)
- A. Mondal, "P2PR-Tree : an R-tree-based spatial index for peer-to-peer environments", Current Trends in Database Technology - EDBT 2004 Workshops, pp.516~525 (2004)
- E. Tanin, "Using a distributed quadtree index in peer-to-peer networks", The VLDB Journal, 16(2), pp.165~178 (2007)
- F. Araujo, "GeoPeer : a location-aware peer-to-peer system", Proceedings of the 3rd IEEE International Symposium on Network Computing and Applications (NCA), pp.30~46 (2004)
- M. Ohnishi, "Incremental distributed construction method of Delaunay overlay network on detour overlay paths", Information and Media Technologies, 8(2), pp.556~564 (2013)
- Y. Teranishi, "HDOV : an overlay network for wide area spatial data collection", Proceedings of the 26th ACM Symposium on Applied Computing(SAC), pp.506~513 (2011)
- Khaled Ragab, "An Autonomic <K, D>-Interleaving Registry Overlay Network for Efficient Ubiquities Web Services Discovery Service", JIPS(Journal of Information Processing Systems), 4(2), pp.53~60 (2008), 한국정보처리학회
- T. Kawakami, "A construction method for structured overlay networks based on multiple different time intervals", Proceedings of the 2019 World Congress on Information Technology Applications and Services (World IT Congress 2019 Jeju), pp.81~86 (2019)
- Q. Lv, "Search and replication in unstructured peer-to-peer networks", Proceedings of the 16th ACM International Conference on Supercomputing (ICS), pp.84~95 (2002)
- V. Gopalakrishnan, "Adaptive replication in peer-to-peer systems", Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS), pp.360~369 (2004)
- H. Yamamoto, "Replication methods for load balancing on distributed storages in P2P networks", IEICE Transactions on Information and Systems, 89(1), pp.171~180 (2006)
- K. P. N. Puttaswamy, "Searching for rare objects using index replication", Proceedings of the 27th IEEE International Conference on Computer Communications (INFOCOM), pp.1723~1731 (2008)
- T. Schütt, "Scalaris : reliable transactional P2P key", value store, 2008, 41~48
- H. Shen, "A proactive low-overhead file replication scheme for structured P2P content delivery networks", Journal of Parallel and Distributed Computing, 69(5), pp.429~440 (2009)
- S. Legtchenko, "RelaxDHT : a churn-resilient replication strategy for peerto-peer distributed hash-tables", ACM Transactions on Autonomous and Adaptive Systems, 7(2), pp.28~ (2012)
- H. Kim, "Server selection schemes considering node status for a fault-tolerant streaming service on a peer-to-peer network", Journal of Information Processing Systems, 2(1), pp.6~12 (2006)
- Qi Cao, "Cost-Effective Replication Schemes for Query Load Balancing in DHT-Based Peer-to-Peer File Searches", JIPS(Journal of Information Processing Systems), 10(4), pp.628~645 (2014), 한국정보처리학회[DOI]
- S. Zahid, "Distributed partition detection with dynamic replication management in a DHT-based MANET", IEEE Access, 6, pp.18731~18746 (2018)
- Y. Hassanzadeh-Nazarabadi, "Decentralized and locality aware replication method for DHT-based P2P storage systems", Future Generation Computer Systems, 84, pp.32~46 (2018)
- Y. Teranishi, "PIAX : toward a framework for sensor overlay network", Proceedings of the 6th Annual IEEE Consumer Communications and Networking Conference(CCNC), pp.1~5 (2009)