Proceedings of the 19th International Conference on Distributed Computing and Networking最新文献_第2页

Data Analysis of Cloud Security Alliance's Security, Trust & Assurance Registry 云安全联盟安全、信任与保证注册表数据分析

Proceedings of the 19th International Conference on Distributed Computing and Networking Pub Date : 2018-01-04 DOI: 10.1145/3154273.3154343

Amartya Sen, S. Madria

{"title":"Data Analysis of Cloud Security Alliance's Security, Trust & Assurance Registry","authors":"Amartya Sen, S. Madria","doi":"10.1145/3154273.3154343","DOIUrl":"https://doi.org/10.1145/3154273.3154343","url":null,"abstract":"The security of clients' applications on the cloud platforms has been of great interest. Security concerns associated with cloud computing are improving in both the domains; security issues faced by cloud providers and security issues faced by clients. However, security concerns still remain in domains like cloud auditing and migrating application components to cloud to make the process more secure and cost-efficient. To an extent, this can be attributed to a lack of detailed information being publicly present about the cloud platforms and their security policies. A resolution in this regard can be found in Cloud Security Alliance's Security, Trust, and Assurance Registry (STAR) which documents the security controls provided by popular cloud computing offerings. In this paper, we perform some descriptive analysis on STAR data in an attempt to comprehend the information publicly presented by different cloud providers. It is to help clients in more effectively searching and analyzing the required security information they need for the decision making process for hosting their applications on cloud. Based on the analysis, we outline some augmentations that can be made to STAR as well as certain specific design improvements for a cloud migration risk assessment framework.","PeriodicalId":276042,"journal":{"name":"Proceedings of the 19th International Conference on Distributed Computing and Networking","volume":"59 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123134397","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}

引用次数: 4

Optimizing distributed file storage and processing engines for CERN's Large Hadron Collider using multi criteria partitioned replication 使用多标准分区复制优化欧洲核子研究中心大型强子对撞机分布式文件存储和处理引擎

Proceedings of the 19th International Conference on Distributed Computing and Networking Pub Date : 2018-01-04 DOI: 10.1145/3154273.3154320

S. Boychenko, M. Zerlauth, J. Garnier, M. Z. Rela

{"title":"Optimizing distributed file storage and processing engines for CERN's Large Hadron Collider using multi criteria partitioned replication","authors":"S. Boychenko, M. Zerlauth, J. Garnier, M. Z. Rela","doi":"10.1145/3154273.3154320","DOIUrl":"https://doi.org/10.1145/3154273.3154320","url":null,"abstract":"Throughout the last decades, distributed file systems and processing engines have been the primary choice for applications requiring access to large amounts of data. Since the introduction of the MapReduce paradigm, relational databases are being increasingly replaced by more efficient and scalable architectures, in particular in environments where a query is expected to process TBytes or even PBytes of data in a single execution. That is the situation at CERN, where data storage systems that are critical for the safe operation, exploitation and optimization of the particle accelerator complex, are based on traditional databases or file system solutions, which are already working well beyond their initially provisioned capacity. Despite the efficiency of modern distributed data storage and processing engines in handling large amounts of data, they are not optimized for heterogeneous workloads such as they arise in the dynamic environment of one of the world's largest scientific facilities. This contribution presents a Mixed Partitioning Scheme Replication (MPSR) solution that outperforms the conventional distributed processing environment configurations at CERN for virtually the entire parameter space of the accelerator monitoring systems' workload variations. Our main strategy was to replicate the data using different partitioning schemes for each replica, whereas the individual partitioning criteria is dynamically derived from the observed workload. To assess the efficiency of this approach in a wide range of scenarios, a behavioral simulator has been developed to compare and analyze the performance of the MPSR with the current solution. Furthermore we present the first actual results of the Hadoop-based prototype running on a relatively small cluster that not only validates the simulation predictions but also confirms the higher efficiency of the proposed technique.","PeriodicalId":276042,"journal":{"name":"Proceedings of the 19th International Conference on Distributed Computing and Networking","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123410123","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}

引用次数: 1

Relay Node Placement Under Budget Constraint 预算约束下中继节点放置

Proceedings of the 19th International Conference on Distributed Computing and Networking Pub Date : 2018-01-04 DOI: 10.1145/3154273.3154302

Chenyang Zhou, Anisha Mazumder, Arun Das, K. Basu, Navid Matin-Moghaddam, S. Mehrani, Arunabha Sen

{"title":"Relay Node Placement Under Budget Constraint","authors":"Chenyang Zhou, Anisha Mazumder, Arun Das, K. Basu, Navid Matin-Moghaddam, S. Mehrani, Arunabha Sen","doi":"10.1145/3154273.3154302","DOIUrl":"https://doi.org/10.1145/3154273.3154302","url":null,"abstract":"The relay node placement problem in the wireless sensor network domain has been studied extensively over the past few years. The objective of most of these problems, is to place the fewest number of relay nodes in the deployment area so that the network, formed by the sensor and the relay nodes, is connected. Under the fixed budget scenario, the expense involved in procuring the minimum number of relay nodes to make the network connected, may exceed the budget. Although, in this case, one must give up the idea of having of a connected network but one would still like to design a network with a high level of connectedness, or a low level of disconnectedness. In this paper, we introduce the notion of disconnectivity, a measure of the \"connectedness\" of a disconnected graph. We study a family of problems whose goal is to design a network with \"maximal connectedness\" or \"minimal disconnectedness\", subject to a fixed budget constraint. We show that all problems in this family are NP-Complete and present an approximation algorithm with a performance bound of 1/10 for the problem that maximizes the size of the largest connected components, and inapproximability results for the problem that maximizes the size of the smallest connected component and the problem that minimizes the number of connected components. In addition, we present future direction of our research on this topic.","PeriodicalId":276042,"journal":{"name":"Proceedings of the 19th International Conference on Distributed Computing and Networking","volume":"183 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134372319","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}

引用次数: 14

Concurrent Linearizable Nearest Neighbour Search in LockFree-kD-tree LockFree-kD-tree中并发线性最近邻搜索

Proceedings of the 19th International Conference on Distributed Computing and Networking Pub Date : 2018-01-04 DOI: 10.1145/3154273.3154307

Bapi Chatterjee, Ivan Walulya, P. Tsigas

引用次数: 3

Defense Strategies for Multi-Site Cloud Computing Server Infrastructures 多站点云计算服务器基础设施防御策略

Proceedings of the 19th International Conference on Distributed Computing and Networking Pub Date : 2018-01-04 DOI: 10.1145/3154273.3154344

N. Rao, Chris Y. T. Ma, Fei He

{"title":"Defense Strategies for Multi-Site Cloud Computing Server Infrastructures","authors":"N. Rao, Chris Y. T. Ma, Fei He","doi":"10.1145/3154273.3154344","DOIUrl":"https://doi.org/10.1145/3154273.3154344","url":null,"abstract":"We consider cloud computing server infrastructures for big data applications, which consist of multiple server sites connected over a wide-area network. These sites house a number of servers, network elements and local-area connections, and the wide-area network plays a critical, asymmetric role of providing the vital connectivity between them. We model this infrastructure as a system of systems, wherein the sites and wide-area network are represented by their cyber and physical components. These components can be disabled by cyber and physical attacks, and also can be protected against them using component reinforcements. The effects of attacks propagate within the individual systems, and also beyond them via the wide-area network. We characterize these effects using correlations at two levels using: (a) aggregate failure correlation function that specifies the infrastructure failure probability given the failure of an individual site or network, and (b) first-order differential conditions on system survival probabilities that characterize the component-level correlations within individual systems. We formulate a game between an attacker and a provider using utility functions composed of survival probability and cost terms. At Nash Equilibrium, we derive expressions for the expected capacity of the infrastructure given by the number of operational servers connected to the network, using the sum-form, product-form and composite utility functions.","PeriodicalId":276042,"journal":{"name":"Proceedings of the 19th International Conference on Distributed Computing and Networking","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125630144","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}

引用次数: 9

Software-Defined Network Solutions for Science Scenarios: Performance Testing Framework and Measurements 科学场景的软件定义网络解决方案:性能测试框架和测量

Proceedings of the 19th International Conference on Distributed Computing and Networking Pub Date : 2018-01-04 DOI: 10.1145/3154273.3154336

N. Rao, Qiang Liu, S. Sen, R. Kettimuthu, J. Boley, B. Settlemyer, Hsing-bung Chen, D. Katramatos, Dantong Yu

{"title":"Software-Defined Network Solutions for Science Scenarios: Performance Testing Framework and Measurements","authors":"N. Rao, Qiang Liu, S. Sen, R. Kettimuthu, J. Boley, B. Settlemyer, Hsing-bung Chen, D. Katramatos, Dantong Yu","doi":"10.1145/3154273.3154336","DOIUrl":"https://doi.org/10.1145/3154273.3154336","url":null,"abstract":"High-performance scientific workflows utilize supercomputers, scientific instruments, and large storage systems. Their executions require fast setup of a small number of dedicated network connections across the geographically distributed facility sites. We present Software-Defined Network (SDN) solutions consisting of site daemons that use dpctl, Floodlight, ONOS, or OpenDaylight controllers to set up these connections. The development of these SDN solutions could be quite disruptive to the infrastructure, while requiring a close coordination among multiple sites; in addition, the large number of possible controller and device combinations to investigate could make the infrastructure unavailable to regular users for extended periods of time. In response, we develop a Virtual Science Network Environment (VSNE) using virtual machines, Mininet, and custom scripts that support the development, testing, and evaluation of SDN solutions, without the constraints and expenses of multi-site physical infrastructures; furthermore, the chosen solutions can be directly transferred to production deployments. By complementing VSNE with a physical testbed, we conduct targeted performance tests of various SDN solutions to help choose the best candidates. In addition, we propose a switching response method to assess the setup times and throughput performances of different SDN solutions, and present experimental results that show their advantages and limitations.","PeriodicalId":276042,"journal":{"name":"Proceedings of the 19th International Conference on Distributed Computing and Networking","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114391567","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}

引用次数: 5

Mobile Computation Bursting: An application partitioning and offloading decision engine 移动计算爆发:一个应用程序分区和卸载决策引擎

Proceedings of the 19th International Conference on Distributed Computing and Networking Pub Date : 2018-01-04 DOI: 10.1145/3154273.3154299

Anuradha Ravi, S. K. Peddoju

{"title":"Mobile Computation Bursting: An application partitioning and offloading decision engine","authors":"Anuradha Ravi, S. K. Peddoju","doi":"10.1145/3154273.3154299","DOIUrl":"https://doi.org/10.1145/3154273.3154299","url":null,"abstract":"Most of the today's Smartphones use multithreading and execute several application jobs in parallel. The Mobile Computation Bursting (MCB) exploits this nature of the Smartphones and aims at partitioning the jobs of a mobile application into different clusters consisting of high computation jobs from that which requires less computation, based on their frequency requirement to compute a task. The nature of a job, i.e., the frequency requirement is identified by Probability Distribution Function (PDF), that represents the number of cycles required for each job to complete the task. The novel algorithm proposed in this paper classifies these jobs using the density-based clustering algorithm using KL divergence. The offloading algorithm proposed in this paper decides whether to execute the cluster in the device or offload to the Cloud. The interaction and transportation of code and data between the mobile device and Cloud get communicated via a mobile agent, thus providing service to mobile users, even when the device moves away from the vicinity of the wireless network. The Mobile Computation Bursting technique is compared with the traditional offloading algorithms, and the results reveal that MCB proves to be more efficient and beneficial to offload the computation to Cloud.","PeriodicalId":276042,"journal":{"name":"Proceedings of the 19th International Conference on Distributed Computing and Networking","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131538689","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}

引用次数: 4

Distributed Algorithm for Balanced VM Placement for Heterogeneous Cloud Data Centers 异构云数据中心虚拟机均衡布局的分布式算法

Proceedings of the 19th International Conference on Distributed Computing and Networking Pub Date : 2018-01-04 DOI: 10.1145/3154273.3154331

Yashwant Singh Patel, R. Misra

{"title":"Distributed Algorithm for Balanced VM Placement for Heterogeneous Cloud Data Centers","authors":"Yashwant Singh Patel, R. Misra","doi":"10.1145/3154273.3154331","DOIUrl":"https://doi.org/10.1145/3154273.3154331","url":null,"abstract":"Virtual Machine (VM) placement aims to efficiently deploy the dynamically arriving VM requests on active physical servers of a data center. It is one of the most challenging and NP-complete problem [9] while considering the large number of optimization criteria and multi-resource VM requirements. In this context, most of the existing works deal only with limited trade-off among types of resources, individual criteria of optimization and homogeneous computing environment, thus resulting unnecessary activation of servers and drastically increased energy consumptions. High energy consumption will not only lead to high operational cost but also maximize the CO2 emissions to the surroundings. In order to achieve the objectives of energy-efficiency, cloud is required to be analyzed with the perspective of balanced resource utilization. Thus, in this work we propose a distributed multi-coloring model for balanced VM placement and goes beyond the current state of the art by maximizing load balancing and efficient use of computing resources. The proposed solution is extensively evaluated through simulation. Experimental results demonstrate the effectiveness of solution over the existing heuristics and show that it can minimize the number of running servers effectively while optimizing the performance metrics of energy saving, resource utilization and load balancing.","PeriodicalId":276042,"journal":{"name":"Proceedings of the 19th International Conference on Distributed Computing and Networking","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133745405","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}

引用次数: 1

Opportunistic Power Savings with Coordinated Control in Data Center Networks 数据中心网络中协调控制的机会性节能

Proceedings of the 19th International Conference on Distributed Computing and Networking Pub Date : 2018-01-04 DOI: 10.1145/3154273.3154328

Madhurima Ray, Sanjeev Sondur, J. Biswas, Amitangshu Pal, K. Kant

引用次数: 5

On the Maximum Movement of Random Sensors for Coverage and Interference on a Line 对线路上的覆盖和干扰的随机传感器的最大运动

Proceedings of the 19th International Conference on Distributed Computing and Networking Pub Date : 2018-01-04 DOI: 10.1145/3154273.3154330

Rafał Kapelko

{"title":"On the Maximum Movement of Random Sensors for Coverage and Interference on a Line","authors":"Rafał Kapelko","doi":"10.1145/3154273.3154330","DOIUrl":"https://doi.org/10.1145/3154273.3154330","url":null,"abstract":"This paper addresses the fundamental problem of time-efficient reallocation of mobile random sensors to provide good communication within the network without interference. Consider n mobile sensors placed on the half-infinite interval [0, ∞) according to the arrival times of the Poisson process with arrival rate λ > 0. Each sensor has identical sensing range r thus covering an interval of length 2r. Assume that there is interference between the signals of two sensors if their distance is less than s. If a sensor is displaced a distance equal to d, it takes the time that is proportional to the distance d traveled. Thus the time required for displacement of a system of n sensors is defined as the maximum of the displacement of individual sensors. We focus on the problem of time-efficient reallocation of the sensors so that in their final placement the sensor system: • There are no uncovered points from the origin to the last rightmost sensor, • Every two sensors are at distance greater or equal to s, and • The time required for the movement of the sensors to these final positions is minimized in expectations. In this paper the tradeoffs between the sensing radius r, the interference distance s, the number of sensors n, the arrival rate λ and the minimal maximum of the expected sensor's displacements are all derived. We discover a threshold around the interference distance s = 1/λ and the sensing radius r = 1/2λ for the minimal maximum of the expected sensor's displacements to avoid interference, and to ensure that there are no uncovered points between the origin and the location of the last rightmost sensor.","PeriodicalId":276042,"journal":{"name":"Proceedings of the 19th International Conference on Distributed Computing and Networking","volume":"15 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129762702","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}

引用次数: 5