Smart cities are a manifestation of the Internet of Things (IoT). The push for smart cities has led to the proliferation of video cameras in public spaces [1]. London is expected to deploy 642,000 cameras by 2020. These cameras will be used primarily for surveillance of the city for urban safety. At the same time, such smart city deployments have also seen edge and fog computing paradigms gain preference over the cloud-only computing model [2]. This is due to the network proximity of the edge and fog devices to the data sources, offering lower latency access to data and lower bandwidth requirements to push high volume data, such as video streams, to the cloud.
{"title":"A scalable and composable analytics platform for distributed wide-area tracking","authors":"Aakash Khochare, Yogesh L. Simmhan","doi":"10.1145/3288599.3299753","DOIUrl":"https://doi.org/10.1145/3288599.3299753","url":null,"abstract":"Smart cities are a manifestation of the Internet of Things (IoT). The push for smart cities has led to the proliferation of video cameras in public spaces [1]. London is expected to deploy 642,000 cameras by 2020. These cameras will be used primarily for surveillance of the city for urban safety. At the same time, such smart city deployments have also seen edge and fog computing paradigms gain preference over the cloud-only computing model [2]. This is due to the network proximity of the edge and fog devices to the data sources, offering lower latency access to data and lower bandwidth requirements to push high volume data, such as video streams, to the cloud.","PeriodicalId":346177,"journal":{"name":"Proceedings of the 20th International Conference on Distributed Computing and Networking","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129020258","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}
We consider the distributed setting of K = (k + 1) × (k + 1) autonomous mobile robots operating on a grid graph of N = (n + 1) × (n + 1) nodes with n = k · d, d ≥ 2, k ≥ 2, following Look-Compute-Move cycles and communicating with other robots using colored lights under the robots with lights model. We consider the uniform scattering problem of repositioning the robots on the nodes of the grid graph so that each robot reach to a static configuration in which they cover uniformly the grid. In this paper, we provide the first O(n) time algorithm for this problem for robots with lights in the fully synchronous setting, given that the robots have the common orientation, the knowledge of parameters n and k, and the visibility range of distance 2d. The best previously known algorithm solves this problem in O(N/d) (i.e., O(n2/d)) time under the classic oblivious robots model (with no lights) with the same capabilities in the asynchronous setting. Our algorithm is asymptotically time-optimal, since for any solution to this uniform scattering problem in both the classic and lights models, Ω(n) time is necessary. Moreover, the proposed algorithm is collision-free.
{"title":"Time-optimal uniform scattering in a grid","authors":"Pavan Poudel, Gokarna Sharma","doi":"10.1145/3288599.3288622","DOIUrl":"https://doi.org/10.1145/3288599.3288622","url":null,"abstract":"We consider the distributed setting of K = (k + 1) × (k + 1) autonomous mobile robots operating on a grid graph of N = (n + 1) × (n + 1) nodes with n = k · d, d ≥ 2, k ≥ 2, following Look-Compute-Move cycles and communicating with other robots using colored lights under the robots with lights model. We consider the uniform scattering problem of repositioning the robots on the nodes of the grid graph so that each robot reach to a static configuration in which they cover uniformly the grid. In this paper, we provide the first O(n) time algorithm for this problem for robots with lights in the fully synchronous setting, given that the robots have the common orientation, the knowledge of parameters n and k, and the visibility range of distance 2d. The best previously known algorithm solves this problem in O(N/d) (i.e., O(n2/d)) time under the classic oblivious robots model (with no lights) with the same capabilities in the asynchronous setting. Our algorithm is asymptotically time-optimal, since for any solution to this uniform scattering problem in both the classic and lights models, Ω(n) time is necessary. Moreover, the proposed algorithm is collision-free.","PeriodicalId":346177,"journal":{"name":"Proceedings of the 20th International Conference on Distributed Computing and Networking","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128124044","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}
In this work, we consider the problem of secure multi-party computation (MPC) with n parties where at most t are under the control of a computationally bounded adversary given the constraint t < n/2. We aim to design a round efficient protocol by minimizing the number of rounds in which the broadcast primitive is involved. In this setting, the previous best protocol can be attributed to Katz-Koo (EUROCRYPT 2007) which is set in the offline-online paradigm (where the parties generate preprocessing data during the offline phase to lighten the computation in the online phase). Their online phase is a constant round protocol with no invocations of broadcast, while the offline phase protocol needs total 29 rounds with a broadcast invocation in one round. Our work improves the round complexity of their offline phase protocol, by running in 4 rounds, with only a single broadcast round. Additionally, we also improve the communication complexity of the offline phase protocol by a factor of Ω(n3). As a technical contribution, we present the first two round computationally-secure verifiable secret-sharing (VSS) scheme that invokes broadcast in only one round.
{"title":"Round efficient computationally secure multi-party computation revisited","authors":"Laasya Bangalore, Ashish Choudhury, Gayathri Garimella","doi":"10.1145/3288599.3288600","DOIUrl":"https://doi.org/10.1145/3288599.3288600","url":null,"abstract":"In this work, we consider the problem of secure multi-party computation (MPC) with n parties where at most t are under the control of a computationally bounded adversary given the constraint t < n/2. We aim to design a round efficient protocol by minimizing the number of rounds in which the broadcast primitive is involved. In this setting, the previous best protocol can be attributed to Katz-Koo (EUROCRYPT 2007) which is set in the offline-online paradigm (where the parties generate preprocessing data during the offline phase to lighten the computation in the online phase). Their online phase is a constant round protocol with no invocations of broadcast, while the offline phase protocol needs total 29 rounds with a broadcast invocation in one round. Our work improves the round complexity of their offline phase protocol, by running in 4 rounds, with only a single broadcast round. Additionally, we also improve the communication complexity of the offline phase protocol by a factor of Ω(n3). As a technical contribution, we present the first two round computationally-secure verifiable secret-sharing (VSS) scheme that invokes broadcast in only one round.","PeriodicalId":346177,"journal":{"name":"Proceedings of the 20th International Conference on Distributed Computing and Networking","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123952707","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}
In the aftermath of a large-scale disaster (such as earthquake), existing communication infrastructures are often critically impaired, preventing timely information exchange between the survivors, responders, and the coordination center. Typically, a temporary network, called Disaster Response Network (DRN), is set up using smart devices, movable base stations and easily deployable cellular antennas. However, such networks are challenged by rapid devices' energy depletion and component failures due to environmental adversities and hardware faults. State-of-the-art literature address energy challenges through intelligent routing, however robustness of DRN against component failures is largely unaddressed. In this paper, we investigate designing a novel network topology for DRNs, which is both energy-efficient and robust against component devices' failures. Specifically, the objective is to construct a sparse structure from the original DRN (termed, Sparse-DRN) while ensuring that there exists a connected tree backbone. Our performance evaluation shows that the Sparse-DRN offers a good trade-off between the energy efficiency and network robustness, while ensuring the QoS requirements i.e., packet delivery and network latency.
{"title":"Towards energy-efficient and robust disaster response networks","authors":"V. Shah, Satyaki Roy, S. Silvestri, Sajal K. Das","doi":"10.1145/3288599.3295589","DOIUrl":"https://doi.org/10.1145/3288599.3295589","url":null,"abstract":"In the aftermath of a large-scale disaster (such as earthquake), existing communication infrastructures are often critically impaired, preventing timely information exchange between the survivors, responders, and the coordination center. Typically, a temporary network, called Disaster Response Network (DRN), is set up using smart devices, movable base stations and easily deployable cellular antennas. However, such networks are challenged by rapid devices' energy depletion and component failures due to environmental adversities and hardware faults. State-of-the-art literature address energy challenges through intelligent routing, however robustness of DRN against component failures is largely unaddressed. In this paper, we investigate designing a novel network topology for DRNs, which is both energy-efficient and robust against component devices' failures. Specifically, the objective is to construct a sparse structure from the original DRN (termed, Sparse-DRN) while ensuring that there exists a connected tree backbone. Our performance evaluation shows that the Sparse-DRN offers a good trade-off between the energy efficiency and network robustness, while ensuring the QoS requirements i.e., packet delivery and network latency.","PeriodicalId":346177,"journal":{"name":"Proceedings of the 20th International Conference on Distributed Computing and Networking","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130571303","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}
Microblogging sites are increasingly playing an important role in real-time disaster management. However, rumors and fake news often spread on such platforms, which if not detected, can derail the rescue operations. Therefore, it becomes imperative to verify some of the information posted on social media during disaster situations. To this end, it is necessary to correctly identify fact-checkable posts, so that their information content can be verified. In the present work, we address the problem of identifying fact-checkable posts on the Twitter microblogging site. We organized a shared task in the FIRE 2018 conference to study the problem of identification of fact-checkable tweets posted during a particular disaster event (the 2015 Nepal earthquake). This paper describes the dataset used in the shared task, and compares the performance of different methodologies for identifying fact-checkable tweets. We primarily experiment with two different types of approaches - classification-based and ranking-based. Our experiments show that a hybrid methodology involving both classification and ranking performs well and outperforms the methodologies that employ only classification or only ranking.
{"title":"Identifying fact-checkable microblogs during disasters: a classification-ranking approach","authors":"Divyank Barnwal, Siddharth Ghelani, Rohit Krishna, Moumita Basu, Saptarshi Ghosh","doi":"10.1145/3288599.3295587","DOIUrl":"https://doi.org/10.1145/3288599.3295587","url":null,"abstract":"Microblogging sites are increasingly playing an important role in real-time disaster management. However, rumors and fake news often spread on such platforms, which if not detected, can derail the rescue operations. Therefore, it becomes imperative to verify some of the information posted on social media during disaster situations. To this end, it is necessary to correctly identify fact-checkable posts, so that their information content can be verified. In the present work, we address the problem of identifying fact-checkable posts on the Twitter microblogging site. We organized a shared task in the FIRE 2018 conference to study the problem of identification of fact-checkable tweets posted during a particular disaster event (the 2015 Nepal earthquake). This paper describes the dataset used in the shared task, and compares the performance of different methodologies for identifying fact-checkable tweets. We primarily experiment with two different types of approaches - classification-based and ranking-based. Our experiments show that a hybrid methodology involving both classification and ranking performs well and outperforms the methodologies that employ only classification or only ranking.","PeriodicalId":346177,"journal":{"name":"Proceedings of the 20th International Conference on Distributed Computing and Networking","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123117654","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}
In this paper, the problem of minimizing the utilization of resources at regenerators under dynamic environment in translucent optical networks has been studied. The problem is an NP-complete one the solution of which remains intractable as the network size increases. A heuristic approach is proposed here to route each incoming request in a way to reduce the number of regenerations at regenerating nodes under dynamic scenario to the extent possible. Input to this algorithmic approach is the regenerator positions obtained from the output of execution of another heuristic CLR [14] which actually selects minimum possible number of regenerator nodes in the network. Performance comparisons show that the proposed heuristic provide a significant improvement over the existing one both in terms of maximum number of regenerations that occur amongst all the regenerator nodes and also connection blocking probability.
{"title":"An efficient heuristic to minimize number of regenerations in translucent optical network under dynamic scenario","authors":"Ira Nath, U. Bhattacharya, M. Chatterjee","doi":"10.1145/3288599.3295578","DOIUrl":"https://doi.org/10.1145/3288599.3295578","url":null,"abstract":"In this paper, the problem of minimizing the utilization of resources at regenerators under dynamic environment in translucent optical networks has been studied. The problem is an NP-complete one the solution of which remains intractable as the network size increases. A heuristic approach is proposed here to route each incoming request in a way to reduce the number of regenerations at regenerating nodes under dynamic scenario to the extent possible. Input to this algorithmic approach is the regenerator positions obtained from the output of execution of another heuristic CLR [14] which actually selects minimum possible number of regenerator nodes in the network. Performance comparisons show that the proposed heuristic provide a significant improvement over the existing one both in terms of maximum number of regenerations that occur amongst all the regenerator nodes and also connection blocking probability.","PeriodicalId":346177,"journal":{"name":"Proceedings of the 20th International Conference on Distributed Computing and Networking","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127611004","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}
The emerging Internet of Things (IoT) has several salient characteristics that differentiate it from existing wireless networking architectures. These include the deployment of very large numbers of (possibly) low-complexity terminals; the need for low-latency, short-packet communications (e.g., to support automation); light or no infrastructure; and primary applications of data gathering, inference and control. These characteristics have motivated the development of new fundamentals that can provide insights into the limits of communication in this regime. This paper discusses two issues in this context, namely security and low-latency, through the respective lenses of physical layer security and finite-blocklength information theory.
{"title":"Fundamentals for IoT networks: secure and low-latency communications","authors":"H. Poor, Mario Goldenbaum, Wei Yang","doi":"10.1145/3288599.3288643","DOIUrl":"https://doi.org/10.1145/3288599.3288643","url":null,"abstract":"The emerging Internet of Things (IoT) has several salient characteristics that differentiate it from existing wireless networking architectures. These include the deployment of very large numbers of (possibly) low-complexity terminals; the need for low-latency, short-packet communications (e.g., to support automation); light or no infrastructure; and primary applications of data gathering, inference and control. These characteristics have motivated the development of new fundamentals that can provide insights into the limits of communication in this regime. This paper discusses two issues in this context, namely security and low-latency, through the respective lenses of physical layer security and finite-blocklength information theory.","PeriodicalId":346177,"journal":{"name":"Proceedings of the 20th International Conference on Distributed Computing and Networking","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122513398","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}
Load balanced transaction scheduling in on-demand computing system is known to be NP-hard problem. In order to solve this problem, this paper introduces a hybrid approach named cuckoo search-ant colony optimization. The approach dynamically generates an optimal schedule by clustering the on-demand computing resources considering their load and completes the transaction execution within their deadlines. The approach also balances the load of the system before scheduling the transactions. For clustering the resources we use cuckoo search method. We use ant colony optimization for selecting the appropriate and optimal resources. We evaluate the performance of the proposed algorithm with six existing algorithms.
{"title":"Load balanced transaction scheduling in on-demand computing using cuckoo search-ant colony optimization","authors":"D. P. Mahato","doi":"10.1145/3288599.3298791","DOIUrl":"https://doi.org/10.1145/3288599.3298791","url":null,"abstract":"Load balanced transaction scheduling in on-demand computing system is known to be NP-hard problem. In order to solve this problem, this paper introduces a hybrid approach named cuckoo search-ant colony optimization. The approach dynamically generates an optimal schedule by clustering the on-demand computing resources considering their load and completes the transaction execution within their deadlines. The approach also balances the load of the system before scheduling the transactions. For clustering the resources we use cuckoo search method. We use ant colony optimization for selecting the appropriate and optimal resources. We evaluate the performance of the proposed algorithm with six existing algorithms.","PeriodicalId":346177,"journal":{"name":"Proceedings of the 20th International Conference on Distributed Computing and Networking","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130354499","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}
A Delay Tolerant Network being a facilitator of communication establishment in heterogeneous networking environments may present an efficient solution of communication in a Wireless Sensor Network that may exist within the ambit of the DTN. WSNs may be found easily in a DTN like those temporarily created using sensor-deployment over drowned places or villages, etc. Collecting information from those cut-off areas is of utmost importance to provide efficient rescue and relief operation. Current work suggests distributing Delsar Life Detection Sensors for probing such cut-off areas for tracing of struck or trapped life. Localization techniques have been used to locate the exact positions of the victims so that appropriate help could be administered to them with efficiency. At the time of distributing the sensors, one or two tag sensors with high power are positioned strategically in the cut-off areas that collect data from the sensors and from where data is further collected using some data mules. The results have been obtained both over simulation in the NS2 simulator and over a practical field implementation. Results suggest that the proposed architecture is able to predict presence of life with more than 70 percent accuracy. This shows that the proposed novel solution to WSN assisted DTN is practicable and efficient for implementation during disasters to communicate with cut-off and far-off remote areas.
{"title":"Sensor node assisted DTN for a post-disaster scenario","authors":"A. Gupta, J. K. Mandal, Indrajit Bhattacharya","doi":"10.1145/3288599.3295590","DOIUrl":"https://doi.org/10.1145/3288599.3295590","url":null,"abstract":"A Delay Tolerant Network being a facilitator of communication establishment in heterogeneous networking environments may present an efficient solution of communication in a Wireless Sensor Network that may exist within the ambit of the DTN. WSNs may be found easily in a DTN like those temporarily created using sensor-deployment over drowned places or villages, etc. Collecting information from those cut-off areas is of utmost importance to provide efficient rescue and relief operation. Current work suggests distributing Delsar Life Detection Sensors for probing such cut-off areas for tracing of struck or trapped life. Localization techniques have been used to locate the exact positions of the victims so that appropriate help could be administered to them with efficiency. At the time of distributing the sensors, one or two tag sensors with high power are positioned strategically in the cut-off areas that collect data from the sensors and from where data is further collected using some data mules. The results have been obtained both over simulation in the NS2 simulator and over a practical field implementation. Results suggest that the proposed architecture is able to predict presence of life with more than 70 percent accuracy. This shows that the proposed novel solution to WSN assisted DTN is practicable and efficient for implementation during disasters to communicate with cut-off and far-off remote areas.","PeriodicalId":346177,"journal":{"name":"Proceedings of the 20th International Conference on Distributed Computing and Networking","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130363051","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}
N. Rao, Qiang Liu, S. Sen, Zhengchun Liu, R. Kettimuthu, Ian T Foster
Distributed scientific and big-data computations are becoming increasingly dependent on access to remote files. Wide-area file transfers are supported by two basic schemes: (i) application-level tools, such as GridFTP, that provide transport services between file systems housed at geographically separated sites, and (ii) file systems mounted over wide-area networks, using mechanisms such as LNet routers that make them transparently available. In both cases, the file transfer performance critically depends on the configuration consisting of host, file, IO, and disk subsystems, which are complex by themselves, as well as on their complex compositions implemented using buffers and IO-network data transitions. We present extensive file transfer rate measurements collected over dedicated 10 Gbps connections with 0-366 ms round-trip times, using GridFTP and XDD file transfer tools, and Lustre file system extended over wide-area networks using LNet routers. Our test configurations are composed of: three types of host systems; XFS, Lustre, and ext3 file systems; and Ethernet and SONET wide-area connections. We present analytics based on the convexity-concavity of throughput profiles which provide insights into throughput and its superior or inferior trend compared to linear interpolations. We propose the utilization-concavity coefficient, a scalar metric that characterizes the overall performance of any file transfer method consisting of specific configuration and scheme. Our results enable performance optimizations by highlighting the significant roles of (i) buffer sizes and parallelism in GridFTP and XDD, and (ii) buffer utilization and credit mechanism in LNet routers.
{"title":"Measurements and analytics of wide-area file transfers over dedicated connections","authors":"N. Rao, Qiang Liu, S. Sen, Zhengchun Liu, R. Kettimuthu, Ian T Foster","doi":"10.1145/3288599.3288641","DOIUrl":"https://doi.org/10.1145/3288599.3288641","url":null,"abstract":"Distributed scientific and big-data computations are becoming increasingly dependent on access to remote files. Wide-area file transfers are supported by two basic schemes: (i) application-level tools, such as GridFTP, that provide transport services between file systems housed at geographically separated sites, and (ii) file systems mounted over wide-area networks, using mechanisms such as LNet routers that make them transparently available. In both cases, the file transfer performance critically depends on the configuration consisting of host, file, IO, and disk subsystems, which are complex by themselves, as well as on their complex compositions implemented using buffers and IO-network data transitions. We present extensive file transfer rate measurements collected over dedicated 10 Gbps connections with 0-366 ms round-trip times, using GridFTP and XDD file transfer tools, and Lustre file system extended over wide-area networks using LNet routers. Our test configurations are composed of: three types of host systems; XFS, Lustre, and ext3 file systems; and Ethernet and SONET wide-area connections. We present analytics based on the convexity-concavity of throughput profiles which provide insights into throughput and its superior or inferior trend compared to linear interpolations. We propose the utilization-concavity coefficient, a scalar metric that characterizes the overall performance of any file transfer method consisting of specific configuration and scheme. Our results enable performance optimizations by highlighting the significant roles of (i) buffer sizes and parallelism in GridFTP and XDD, and (ii) buffer utilization and credit mechanism in LNet routers.","PeriodicalId":346177,"journal":{"name":"Proceedings of the 20th International Conference on Distributed Computing and Networking","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128652812","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
扫码关注我们
求助内容：
应助结果提醒方式：