Pub Date : 2021-07-01DOI: 10.1109/ICDCS51616.2021.00098
G. A. D. Luna, P. Flocchini, G. Prencipe, N. Santoro
In this paper, we start the investigation of distributed computing by mobile agents in dangerous dynamic networks. The danger is posed by the presence in the network of a black hole (BH), a harmful site that destroys all incoming agents without leaving any trace. The problem of determining the location of the black hole in a network, known as black hole search (BHS), has been extensively studied in the literature, but always and only assuming that the network is static. At the same time, the existing results on mobile agents computing in dynamic networks never consider the presence of harmful sites. In this paper we start filling this research gap by studying black hole search in temporal rings, specifically focusing on 1-interval connectivity adversarial dynamics. The main complexity parameter of BHS is the number of agents (called size) needed to solve the problem; other parameters are the number of moves (called cost) performed by the agents, and the time until termination. Feasibility and complexity depend on many factors; the size n of the ring, whether or not n is known, and the type of inter-agent communication (whiteboards, tokens, face-to-face, visual). In this paper, we provide a complete feasibility characterization presenting size optimal algorithms. Furthermore, we establish lower bounds on the cost and time of size-optimal solutions and show that our algorithms achieve those bounds.
{"title":"Black Hole Search in Dynamic Rings","authors":"G. A. D. Luna, P. Flocchini, G. Prencipe, N. Santoro","doi":"10.1109/ICDCS51616.2021.00098","DOIUrl":"https://doi.org/10.1109/ICDCS51616.2021.00098","url":null,"abstract":"In this paper, we start the investigation of distributed computing by mobile agents in dangerous dynamic networks. The danger is posed by the presence in the network of a black hole (BH), a harmful site that destroys all incoming agents without leaving any trace. The problem of determining the location of the black hole in a network, known as black hole search (BHS), has been extensively studied in the literature, but always and only assuming that the network is static. At the same time, the existing results on mobile agents computing in dynamic networks never consider the presence of harmful sites. In this paper we start filling this research gap by studying black hole search in temporal rings, specifically focusing on 1-interval connectivity adversarial dynamics. The main complexity parameter of BHS is the number of agents (called size) needed to solve the problem; other parameters are the number of moves (called cost) performed by the agents, and the time until termination. Feasibility and complexity depend on many factors; the size n of the ring, whether or not n is known, and the type of inter-agent communication (whiteboards, tokens, face-to-face, visual). In this paper, we provide a complete feasibility characterization presenting size optimal algorithms. Furthermore, we establish lower bounds on the cost and time of size-optimal solutions and show that our algorithms achieve those bounds.","PeriodicalId":222376,"journal":{"name":"2021 IEEE 41st International Conference on Distributed Computing Systems (ICDCS)","volume":"171 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115146791","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-07-01DOI: 10.1109/ICDCS51616.2021.00118
Tianxiang Dai, Haya Shulman, M. Waidner
The research and operational community believe that TCP provides protection against IP fragmentation based attacks and recommend that servers avoid sending responses over UDP and use TCP instead. In this work we show for the first time that IP fragmentation attacks may also apply to communication over TCP. We perform a study of the nameservers in the 100K-top Alexa domains and find that 454 domains are vulnerable to IP fragmentation attacks. Of these domains, we find 366 additional domains that are vulnerable only to IP fragmentation attacks on communication with TCP. We also find that the servers vulnerable to TCP fragmentation can be forced to fragment packets to much smaller sizes (of less than 292 bytes) than servers vulnerable to UDP fragmentation (not below 548 bytes). This makes the impact of the attacks against servers vulnerable to fragmentation of TCP segments much more detrimental. Our study not only shows that the recommendation to use TCP and avoid UDP is risky but it also shows that the attack surface due to fragmentation is larger than was previously believed. We evaluate known IP fragmentation-based DNS cache poisoning attacks against DNS responses over TCP.
{"title":"Poster: Fragmentation Attacks on DNS over TCP","authors":"Tianxiang Dai, Haya Shulman, M. Waidner","doi":"10.1109/ICDCS51616.2021.00118","DOIUrl":"https://doi.org/10.1109/ICDCS51616.2021.00118","url":null,"abstract":"The research and operational community believe that TCP provides protection against IP fragmentation based attacks and recommend that servers avoid sending responses over UDP and use TCP instead. In this work we show for the first time that IP fragmentation attacks may also apply to communication over TCP. We perform a study of the nameservers in the 100K-top Alexa domains and find that 454 domains are vulnerable to IP fragmentation attacks. Of these domains, we find 366 additional domains that are vulnerable only to IP fragmentation attacks on communication with TCP. We also find that the servers vulnerable to TCP fragmentation can be forced to fragment packets to much smaller sizes (of less than 292 bytes) than servers vulnerable to UDP fragmentation (not below 548 bytes). This makes the impact of the attacks against servers vulnerable to fragmentation of TCP segments much more detrimental. Our study not only shows that the recommendation to use TCP and avoid UDP is risky but it also shows that the attack surface due to fragmentation is larger than was previously believed. We evaluate known IP fragmentation-based DNS cache poisoning attacks against DNS responses over TCP.","PeriodicalId":222376,"journal":{"name":"2021 IEEE 41st International Conference on Distributed Computing Systems (ICDCS)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128332655","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Permissioned blockchains take more reliability on participants than permissionless ones. In this poster, we focus on a hierarchical scenario of permissioned blockchains, which includes three types of participants: providers, collectors, and governors. Such a scenario has many applications in the field of IoT data collection, horizontal strategic alliances, etc. Our object is to reduce the cost of the governor's transaction verification. For this purpose, we propose a reputation protocol to help the governor measure the reliability of collectors. Based on the measurement of collectors' reputations, governors can pack high-quality transactions from reliable collectors into blocks, and thus the cost of verifying transactions can be decreased effectively. Through theoretical analysis, our protocol dramatically reduces the verification loss of governors.
{"title":"Poster: An Efficient Permissioned Blockchain with Provable Reputation Mechanism","authors":"Hongyin Chen, Zhaohua Chen, Yukun Cheng, Xiaotie Deng, Wenhan Huang, Jichen Li, Hongyi Ling, Mengqian Zhang","doi":"10.1109/ICDCS51616.2021.00123","DOIUrl":"https://doi.org/10.1109/ICDCS51616.2021.00123","url":null,"abstract":"Permissioned blockchains take more reliability on participants than permissionless ones. In this poster, we focus on a hierarchical scenario of permissioned blockchains, which includes three types of participants: providers, collectors, and governors. Such a scenario has many applications in the field of IoT data collection, horizontal strategic alliances, etc. Our object is to reduce the cost of the governor's transaction verification. For this purpose, we propose a reputation protocol to help the governor measure the reliability of collectors. Based on the measurement of collectors' reputations, governors can pack high-quality transactions from reliable collectors into blocks, and thus the cost of verifying transactions can be decreased effectively. Through theoretical analysis, our protocol dramatically reduces the verification loss of governors.","PeriodicalId":222376,"journal":{"name":"2021 IEEE 41st International Conference on Distributed Computing Systems (ICDCS)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132896734","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-07-01DOI: 10.1109/ICDCS51616.2021.00072
Longkun Guo, Wenjie Zou, Chenchen Wu, Dachuan Xu, D. Du
Emerging IoT applications have brought up new coverage problems with sink-based mobile sensors. In this paper, we first focus on the MinSum Sink-based Line Barrier Coverage (SLBC) problem of covering a line barrier with mobile sensors originated at sink stations distributed on the plane. The objective is to minimize the movement sum of the sensors for the sake of energy efficiency. When the sinks emit sensors with non-uniform radii, we prove the MinSum SLBC problem is $mathcal{NP}$ -complete via reducing from the Partition problem that is known $mathcal{NP}$ - complete. Then for the MinSum Sink-based on-a-Line Target Coverage (SLTC) problem of covering targets on a line, an exact algorithm is presented based on grouping the targets and transforming to the shortest path problem in the auxiliary graph induced by the vertices corresponding to the groups. The algorithm runs in time $O(n^{2})$ when sinks emit sensors of uniform sensing radius, and in time $O(vert Rvert ^{2}n^{2})$ for sensors of non-uniform radii, where $n$ and $vert Rvert$ are respectively the number of targets and different radii. Eventually for SLBC, we propose a pseudo additive fully polynomial-time approximation scheme by extending the algorithm for SLTC. The algorithm runs in $O(k^{2}(frac{L}{epsilon})^{2})$ time and computes a coverage with total movement provably bounded by $opt+epsilon$ for any fixed sufficiently small $epsilon > 0$, where $opt, k$ and $L$ are respectively the movement of an optimum solution, the number of sinks and the length of the barrier. At last, experiments are carried out to demonstrate the practical performance gain of our algorithms.
{"title":"MinSum Movement of Barrier and Target Coverage using Sink-based Mobile Sensors on the Plane","authors":"Longkun Guo, Wenjie Zou, Chenchen Wu, Dachuan Xu, D. Du","doi":"10.1109/ICDCS51616.2021.00072","DOIUrl":"https://doi.org/10.1109/ICDCS51616.2021.00072","url":null,"abstract":"Emerging IoT applications have brought up new coverage problems with sink-based mobile sensors. In this paper, we first focus on the MinSum Sink-based Line Barrier Coverage (SLBC) problem of covering a line barrier with mobile sensors originated at sink stations distributed on the plane. The objective is to minimize the movement sum of the sensors for the sake of energy efficiency. When the sinks emit sensors with non-uniform radii, we prove the MinSum SLBC problem is $mathcal{NP}$ -complete via reducing from the Partition problem that is known $mathcal{NP}$ - complete. Then for the MinSum Sink-based on-a-Line Target Coverage (SLTC) problem of covering targets on a line, an exact algorithm is presented based on grouping the targets and transforming to the shortest path problem in the auxiliary graph induced by the vertices corresponding to the groups. The algorithm runs in time $O(n^{2})$ when sinks emit sensors of uniform sensing radius, and in time $O(vert Rvert ^{2}n^{2})$ for sensors of non-uniform radii, where $n$ and $vert Rvert$ are respectively the number of targets and different radii. Eventually for SLBC, we propose a pseudo additive fully polynomial-time approximation scheme by extending the algorithm for SLTC. The algorithm runs in $O(k^{2}(frac{L}{epsilon})^{2})$ time and computes a coverage with total movement provably bounded by $opt+epsilon$ for any fixed sufficiently small $epsilon > 0$, where $opt, k$ and $L$ are respectively the movement of an optimum solution, the number of sinks and the length of the barrier. At last, experiments are carried out to demonstrate the practical performance gain of our algorithms.","PeriodicalId":222376,"journal":{"name":"2021 IEEE 41st International Conference on Distributed Computing Systems (ICDCS)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133114362","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Existing Internet routing protocols much focus on providing interconnection service for independent autonomous systems (ASes) rather than end-to-end low latency transmission. Nowadays, a growing number of applications and platforms have high requirements for low latency. However, developing new routing protocols in the wide area network that provides low latency routing service is very challenging, and remains an open problem due to the obstacles of compatibility, feasibility, scalability and efficiency. On the other hand, the ignorance of latency performance results in triangle inequality violations (TIV). In this paper, we leverage TIV and a new routing technology, SRv6, to build a new distributed routing protocol, SRv6 underlay federation (SRUF), which aims to provide low-latency routing services in network core. We design a novel method to find alternative paths with lower latency between any pair of ASes in SRUF. This method can achieve high scalability as it incurs only $O(n)$ bandwidth overhead in each member of SRUF. SRv6 is then employed to steer the flows along the selected indirect low-latency paths, while keeping compatibility to legacy routing systems. The experimental results with realworld datasets demonstrate that SRUF can effectively reduce the average end-to-end delay by 5.4% ~ 58.9%.
{"title":"SRUF: Low-Latency Path Routing with SRv6 Underlay Federation in Wide Area Network","authors":"Bangbang Ren, Deke Guo, Guoming Tang, Weijun Wang, Lailong Luo, Xiaoming Fu","doi":"10.1109/ICDCS51616.2021.00091","DOIUrl":"https://doi.org/10.1109/ICDCS51616.2021.00091","url":null,"abstract":"Existing Internet routing protocols much focus on providing interconnection service for independent autonomous systems (ASes) rather than end-to-end low latency transmission. Nowadays, a growing number of applications and platforms have high requirements for low latency. However, developing new routing protocols in the wide area network that provides low latency routing service is very challenging, and remains an open problem due to the obstacles of compatibility, feasibility, scalability and efficiency. On the other hand, the ignorance of latency performance results in triangle inequality violations (TIV). In this paper, we leverage TIV and a new routing technology, SRv6, to build a new distributed routing protocol, SRv6 underlay federation (SRUF), which aims to provide low-latency routing services in network core. We design a novel method to find alternative paths with lower latency between any pair of ASes in SRUF. This method can achieve high scalability as it incurs only $O(n)$ bandwidth overhead in each member of SRUF. SRv6 is then employed to steer the flows along the selected indirect low-latency paths, while keeping compatibility to legacy routing systems. The experimental results with realworld datasets demonstrate that SRUF can effectively reduce the average end-to-end delay by 5.4% ~ 58.9%.","PeriodicalId":222376,"journal":{"name":"2021 IEEE 41st International Conference on Distributed Computing Systems (ICDCS)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126275783","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-07-01DOI: 10.1109/ICDCS51616.2021.00106
Sizhuang Liang, Xirui Peng, H. Qi, Saman A. Zonouz, R. Beyah
We propose NSYNC, a practical framework to compare side-channel signals for real-time intrusion detection in Additive Manufacturing (AM) systems. The motivation to develop NSYNC is that we find AM systems are asynchronous in nature and there is random variation in timing in a printing process. Although this random variation, referred to as time noise, is very small compared with the duration of a printing process, it can cause existing Intrusion Detection Systems (IDSs) to fail. To deal with this problem, NSYNC incorporates a dynamic synchronizer to find the timing relationship between two signals. This timing relationship, referred to as the horizontal displacement, can not only be used to mitigate the adverse effect of time noise on calculating the (vertical) distance between signals, but also be used as indicators for intrusion detection. An existing dynamic synchronizer is Dynamic Time Warping (DTW). However, we found in experiments that DTW not only consumes an excessive amount of computational resources but also has limited accuracy for processing side-channel signals. To solve this problem, we propose a novel dynamic synchronizer, called Dynamic Window Matching (DWM), to replace DTW. To compare NSYNC against existing IDSs, we built a data acquisition system that is capable of collecting six different types of side-channel signals and performed a total of 302 benign printing processes and a total of 200 malicious printing processes with two printers. Our experiment results show that existing IDSs leveraging side-channel signals in AM systems can only achieve an accuracy from 0.50 to 0.88, whereas our proposed NSYNC can reach an accuracy of 0.99.
{"title":"A Practical Side-Channel Based Intrusion Detection System for Additive Manufacturing Systems","authors":"Sizhuang Liang, Xirui Peng, H. Qi, Saman A. Zonouz, R. Beyah","doi":"10.1109/ICDCS51616.2021.00106","DOIUrl":"https://doi.org/10.1109/ICDCS51616.2021.00106","url":null,"abstract":"We propose NSYNC, a practical framework to compare side-channel signals for real-time intrusion detection in Additive Manufacturing (AM) systems. The motivation to develop NSYNC is that we find AM systems are asynchronous in nature and there is random variation in timing in a printing process. Although this random variation, referred to as time noise, is very small compared with the duration of a printing process, it can cause existing Intrusion Detection Systems (IDSs) to fail. To deal with this problem, NSYNC incorporates a dynamic synchronizer to find the timing relationship between two signals. This timing relationship, referred to as the horizontal displacement, can not only be used to mitigate the adverse effect of time noise on calculating the (vertical) distance between signals, but also be used as indicators for intrusion detection. An existing dynamic synchronizer is Dynamic Time Warping (DTW). However, we found in experiments that DTW not only consumes an excessive amount of computational resources but also has limited accuracy for processing side-channel signals. To solve this problem, we propose a novel dynamic synchronizer, called Dynamic Window Matching (DWM), to replace DTW. To compare NSYNC against existing IDSs, we built a data acquisition system that is capable of collecting six different types of side-channel signals and performed a total of 302 benign printing processes and a total of 200 malicious printing processes with two printers. Our experiment results show that existing IDSs leveraging side-channel signals in AM systems can only achieve an accuracy from 0.50 to 0.88, whereas our proposed NSYNC can reach an accuracy of 0.99.","PeriodicalId":222376,"journal":{"name":"2021 IEEE 41st International Conference on Distributed Computing Systems (ICDCS)","volume":"149 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120869297","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-07-01DOI: 10.1109/ICDCS51616.2021.00030
Han Xue, Qun Huang, Yungang Bao
Existing blockchain systems suffer from low throughput and high payment latency. Payment channel networks (PCNs) such as the Lightning Network are proposed as a viable scaling solution. In PCNs, two participants can establish a payment channel to transfer funds without manipulating the blockchain. However, PCNs must route transactions between not directly connected participants on paths with sufficient funds. Since link capacities in PCNs vary as transactions are performed, it is hard to apply classical techniques to route PCN transactions directly. In this paper, we propose EPA-Route, a routing algorithm that aims to achieve both a high success rate and low transaction fees for PCNs. In addition, EPA-Route still maintains high performance and decentralization characteristics. In EPA-Route, every participant maintains a routing table. For every transaction, EPA-Route first probes possible paths based on the routing table and prunes useless paths at every hop to alleviate overheads. After a collection of paths obtained after probing and pruning, EPA-Route splits the transaction into several sub-transactions and allocates them to these paths. The allocation is formulated as an optimization problem to minimize transaction fees. Extensive experiments show that EPA-Route reduces up to 85 % transaction fees and maintains a comparable success rate as state-of-the-art algorithms.
{"title":"EPA-Route: Routing Payment Channel Network with High Success Rate and Low Payment Fees","authors":"Han Xue, Qun Huang, Yungang Bao","doi":"10.1109/ICDCS51616.2021.00030","DOIUrl":"https://doi.org/10.1109/ICDCS51616.2021.00030","url":null,"abstract":"Existing blockchain systems suffer from low throughput and high payment latency. Payment channel networks (PCNs) such as the Lightning Network are proposed as a viable scaling solution. In PCNs, two participants can establish a payment channel to transfer funds without manipulating the blockchain. However, PCNs must route transactions between not directly connected participants on paths with sufficient funds. Since link capacities in PCNs vary as transactions are performed, it is hard to apply classical techniques to route PCN transactions directly. In this paper, we propose EPA-Route, a routing algorithm that aims to achieve both a high success rate and low transaction fees for PCNs. In addition, EPA-Route still maintains high performance and decentralization characteristics. In EPA-Route, every participant maintains a routing table. For every transaction, EPA-Route first probes possible paths based on the routing table and prunes useless paths at every hop to alleviate overheads. After a collection of paths obtained after probing and pruning, EPA-Route splits the transaction into several sub-transactions and allocates them to these paths. The allocation is formulated as an optimization problem to minimize transaction fees. Extensive experiments show that EPA-Route reduces up to 85 % transaction fees and maintains a comparable success rate as state-of-the-art algorithms.","PeriodicalId":222376,"journal":{"name":"2021 IEEE 41st International Conference on Distributed Computing Systems (ICDCS)","volume":"147 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121478352","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-07-01DOI: 10.1109/ICDCS51616.2021.00038
N. Bartolini, Andrea Coletta, Andrea Gennaro, G. Maselli, Matteo Prata
The fast and unconstrained mobility of Flying Ad-hoc NETworks (FANETs) brings about the need to develop solutions for packet routing in a highly dynamic topology scenario. Previous works in this direction aim at extending protocols designed for Mobile Ad-hoc NETworks (MANETs) to the more challenging domain of FANETs. Unlike previous approaches, we aim at exploiting the device controllable mobility to facilitate network routing. We propose MAD (Movement Assisted Delivery): a packet routing protocol specifically tailored for networks of aerial vehicles. MAD enables adaptive selection of the most suitable relay nodes for packet delivery, resorting to movement-assisted delivery upon need, which is supported by a reinforcement learning approach. By means of extensive simulations we show that MAD outperforms previous solutions in all the considered performance metrics including average packet delay, delivery ratio, and communication overhead, at the expense of a moderate loss in average device availability.
{"title":"MAD for FANETs: Movement Assisted Delivery for Flying Ad-hoc Networks","authors":"N. Bartolini, Andrea Coletta, Andrea Gennaro, G. Maselli, Matteo Prata","doi":"10.1109/ICDCS51616.2021.00038","DOIUrl":"https://doi.org/10.1109/ICDCS51616.2021.00038","url":null,"abstract":"The fast and unconstrained mobility of Flying Ad-hoc NETworks (FANETs) brings about the need to develop solutions for packet routing in a highly dynamic topology scenario. Previous works in this direction aim at extending protocols designed for Mobile Ad-hoc NETworks (MANETs) to the more challenging domain of FANETs. Unlike previous approaches, we aim at exploiting the device controllable mobility to facilitate network routing. We propose MAD (Movement Assisted Delivery): a packet routing protocol specifically tailored for networks of aerial vehicles. MAD enables adaptive selection of the most suitable relay nodes for packet delivery, resorting to movement-assisted delivery upon need, which is supported by a reinforcement learning approach. By means of extensive simulations we show that MAD outperforms previous solutions in all the considered performance metrics including average packet delay, delivery ratio, and communication overhead, at the expense of a moderate loss in average device availability.","PeriodicalId":222376,"journal":{"name":"2021 IEEE 41st International Conference on Distributed Computing Systems (ICDCS)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123004100","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Cuckoo filter (CF) and its variants are emerging as replacements of Bloom filters in various networking and distributed systems to support efficient set representation and membership testing. Cuckoo filters store item fingerprints directly with two candidate buckets and a reallocation scheme is implemented to mitigate the bucket overflow problem for higher space utilization. Such a reallocation scheme, once triggered, however, can be time-consuming. This shortcoming makes the existing CFs not applicable for insertion-intensive scenarios such as online applications wherein the items join and leave frequently. To this end, in this paper, we propose the Vertical Cuckoo filter (VCF) which extends the standard Cuckoo filter by providing more candidate buckets to each item. Another challenging issue with such a design is how to ensure that the candidate buckets can be indexed by each other such that no additional hash computation and item access are necessary during fingerprint reallocation. Therefore, we present the vertical hashing, which indexes the candidate buckets with the fingerprint and given bitmasks. We further generalize and improve the VCF by realizing $k$ (≥ 4) candidate buckets and avoiding unnecessary computation. The comprehensive experiments indicate that VCF outperforms its same kinds in terms of space utilization and insertion throughput, with a slight compromise of lookup speed.
{"title":"The Vertical Cuckoo Filters: A Family of Insertion-friendly Sketches for Online Applications","authors":"Pengtao Fu, Lailong Luo, Shangsen Li, Deke Guo, Geyao Cheng, Yun Zhou","doi":"10.1109/ICDCS51616.2021.00015","DOIUrl":"https://doi.org/10.1109/ICDCS51616.2021.00015","url":null,"abstract":"Cuckoo filter (CF) and its variants are emerging as replacements of Bloom filters in various networking and distributed systems to support efficient set representation and membership testing. Cuckoo filters store item fingerprints directly with two candidate buckets and a reallocation scheme is implemented to mitigate the bucket overflow problem for higher space utilization. Such a reallocation scheme, once triggered, however, can be time-consuming. This shortcoming makes the existing CFs not applicable for insertion-intensive scenarios such as online applications wherein the items join and leave frequently. To this end, in this paper, we propose the Vertical Cuckoo filter (VCF) which extends the standard Cuckoo filter by providing more candidate buckets to each item. Another challenging issue with such a design is how to ensure that the candidate buckets can be indexed by each other such that no additional hash computation and item access are necessary during fingerprint reallocation. Therefore, we present the vertical hashing, which indexes the candidate buckets with the fingerprint and given bitmasks. We further generalize and improve the VCF by realizing $k$ (≥ 4) candidate buckets and avoiding unnecessary computation. The comprehensive experiments indicate that VCF outperforms its same kinds in terms of space utilization and insertion throughput, with a slight compromise of lookup speed.","PeriodicalId":222376,"journal":{"name":"2021 IEEE 41st International Conference on Distributed Computing Systems (ICDCS)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114170570","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-07-01DOI: 10.1109/ICDCS51616.2021.00013
Yi Liu, Leijie Wu, Yufeng Zhan, Song Guo, Zicong Hong
Edge Learning is an emerging distributed machine learning in mobile edge network. Limited works have designed mechanisms to incentivize edge nodes to participate in edge learning. However, their mechanisms only consider myopia optimization on resource consumption, which results in the lack of learning algorithm performance guarantee and longterm sustainability. In this paper, we propose Chiron, an incentive-driven long-term mechanism for edge learning based on hierarchical deep reinforcement learning. First, our optimization goal combines learning-algorithms metric (i.e., model accuracy) with system metric (i.e., learning time, and resource consumption), which can improve edge learning quality under a fixed training budget. Second, we present a two-layer H-DRL design with exterior and inner agents to achieve both long-term and short-term optimization for edge learning, respectively. Finally, experiments on three different real-world datasets are conducted to demonstrate the superiority of our proposed approach. In particular, compared with the state-of-the-art methods under the same budget constraint, the final global model accuracy and time efficiency can be increased by 6.5 % and 39 %, respectively. Our implementation is available at https://github.com/Joey61Liuyi/Chiron.
{"title":"Incentive-Driven Long-term Optimization for Edge Learning by Hierarchical Reinforcement Mechanism","authors":"Yi Liu, Leijie Wu, Yufeng Zhan, Song Guo, Zicong Hong","doi":"10.1109/ICDCS51616.2021.00013","DOIUrl":"https://doi.org/10.1109/ICDCS51616.2021.00013","url":null,"abstract":"Edge Learning is an emerging distributed machine learning in mobile edge network. Limited works have designed mechanisms to incentivize edge nodes to participate in edge learning. However, their mechanisms only consider myopia optimization on resource consumption, which results in the lack of learning algorithm performance guarantee and longterm sustainability. In this paper, we propose Chiron, an incentive-driven long-term mechanism for edge learning based on hierarchical deep reinforcement learning. First, our optimization goal combines learning-algorithms metric (i.e., model accuracy) with system metric (i.e., learning time, and resource consumption), which can improve edge learning quality under a fixed training budget. Second, we present a two-layer H-DRL design with exterior and inner agents to achieve both long-term and short-term optimization for edge learning, respectively. Finally, experiments on three different real-world datasets are conducted to demonstrate the superiority of our proposed approach. In particular, compared with the state-of-the-art methods under the same budget constraint, the final global model accuracy and time efficiency can be increased by 6.5 % and 39 %, respectively. Our implementation is available at https://github.com/Joey61Liuyi/Chiron.","PeriodicalId":222376,"journal":{"name":"2021 IEEE 41st International Conference on Distributed Computing Systems (ICDCS)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126606870","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：