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

{"title":"Fast Handoff based on Enhancement of Network-assisted Radio Signature in 802.11 Dense WMNs","authors":"G. Yao, Jiannong Cao, Xuefeng Liu, J. Siebert","doi":"10.1145/3154273.3154342","DOIUrl":"https://doi.org/10.1145/3154273.3154342","url":null,"abstract":"Recently the deployment of IEEE 802.11 Wireless Mesh Networks (WMNs) has been growing exponentially because of emerging of sharing economy of WiFi. As a result, the handoff delay caused by mobile client (MC) probing for the next preferred AP becomes more challenging in a dense WMN. In this paper, we propose a fast handoff scheme T-NRS (Temporal-NRS) which leverages historical knowledge of APs associated in time series to assist in handoff decision in addition to the Network-assisted Radio Signature(NRS) technique based on spatial knowledge. The enhancement improves the performance whilst eliminates the inflexibility. We implement and evaluate the mechanism in about 200 APs in shopping malls. The results prove the performance of the proposed scheme.","PeriodicalId":276042,"journal":{"name":"Proceedings of the 19th International Conference on Distributed Computing and Networking","volume":"76 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":"124415007","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}

{"title":"QoS-Aware Dynamic Caching for Destroyed Virtual Machines in Sensor-Cloud Architecture","authors":"Arijit Roy, S. Misra, Sayan Ghosh","doi":"10.1145/3154273.3154341","DOIUrl":"https://doi.org/10.1145/3154273.3154341","url":null,"abstract":"In this work, we propose a scheme, named Quality-of-Service (QoS) Aware Dynamic Caching for Destroyed Virtual Machines in Sensor-Cloud Architecture, which enables efficient caching in sensor-cloud, in the presence of heterogeneous sensor nodes. This work is one of the first attempt of its type, in which a special cache is introduced for the efficient use of sensor data in the sensor-cloud architecture, in order to maintain QoS. Considering the reutilization of sensor data, the proposed scheme is capable of keeping data of a Virtual Machine (VM) for a certain duration of time, even if it is destroyed. Therefore, the data from SDC can be used in future, if any further requests arrive, which consists of same configurations of physical sensors inside a virtual sensor. We compared the proposed caching mechanism, Dynamic Caching for Destroyed VMs, with the existing mechanism proposed by Chatterjee and Misra [1]. We observe that the cache hit percentage increases at least double the number of times exhibited by the existing scheme of caching. On the other hand the energy consumption and message overhead decrease by 50% and 17% respectively.","PeriodicalId":276042,"journal":{"name":"Proceedings of the 19th International Conference on Distributed Computing and Networking","volume":"112 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":"115250250","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}

{"title":"Collaborative Similarity Search Across Multi-party Repositories","authors":"Malek Athamnah, Anis Alazzawe, K. Kant","doi":"10.1145/3154273.3154352","DOIUrl":"https://doi.org/10.1145/3154273.3154352","url":null,"abstract":"The expanding role of online data collection and analytics from a variety of sources in the operation of emerging cyber and cyberphysical systems brings in two crucial issues: (a) collaboration across multiple parties that generate and own parts of the data with only limited access rights to others, and (b) need to efficiently identify suitable patterns in the data in order to drive the decision making. In this paper, we examine such scenarios where we assume that all collected data is organized in form of a database and the relevant patterns are those that concern similarities across the entities represented by the data. An entity of interest is either a physical or logical item with multiple attributes (e.g., a shipped product with price and size as attributes, traffic sensors measuring the volume of traffic and weather conditions at intersections). We assume a that all data regarding the entities is maintained in a standard relational form so that it is possible to describe the queries on it precisely. The similarities are then considered in terms of attribute values. In some cases, the attributes of the entities may themselves be partitioned across parties and thus stored on different nodes. We consider queries in this environment that must comply with access rules across parties and seek entities that are similar to a given entity in terms of their attributes. We propose efficient methods for getting similar entities across multiple attributes when the threshold for similarity may vary across searches. Through extensive experimentation, we show that our mechanism is significantly more efficient than a direct search through the entire dataset.","PeriodicalId":276042,"journal":{"name":"Proceedings of the 19th International Conference on Distributed Computing and Networking","volume":"46 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":"116355503","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}

{"title":"On the Importance of Synchronization Primitives with Low Consensus Numbers","authors":"P. Khanchandani, Roger Wattenhofer","doi":"10.1145/3154273.3154306","DOIUrl":"https://doi.org/10.1145/3154273.3154306","url":null,"abstract":"The consensus number of a synchronization primitive is the maximum number of processes for which the primitive can solve consensus. This has been the traditional measure of power of a synchronization primitive. Thus, the compare-and-swap primitive, which has infinite consensus number, is considered most powerful and has been the primitive of choice for implementing concurrent data structures. In this work, we show that the synchronization primitives with low consensus numbers can also be potentially powerful by using them along with the compare-and-swap primitive to design an O (√n) time wait-free and linearizable concurrent queue. The best known time bound for a wait-free and linearizable concurrent queue using only the compare-and-swap primitive is O(n). Here, n is the total number of processes that can access the queue. The queue object maintains a sequence of elements and supports the operations enqueue(x) and dequeue(). The wait-free property implies that every call to enqueue(x) and dequeue() finishes in a bounded number of steps irrespective of the schedule of other n --1 processes. The linearizable property implies that the enqueue(x) and dequeue() calls appear to be instantaneously applied within the duration of respective calls. We design a wait-free and a linearizable concurrent queue using shared memory registers that support the compare-and-swap primitive and two other primitives of consensus number one and two respectively. The enqueue(x) and dequeue() operations take O (√n) steps each. The total number of registers required are O(nm) of O (max{log n, log m }) bits each, where m is a bound on the total number of enqueue(x) operations.","PeriodicalId":276042,"journal":{"name":"Proceedings of the 19th International Conference on Distributed Computing and Networking","volume":"25 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":"126373441","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}

{"title":"A Foundational Framework for Certified Impossibility Results with Mobile Robots on Graphs","authors":"Thibaut Balabonski, Robin Pelle, Lionel Rieg, S. Tixeuil","doi":"10.1145/3154273.3154321","DOIUrl":"https://doi.org/10.1145/3154273.3154321","url":null,"abstract":"Swarms of mobile robots recently attracted the focus of the Distributed Computing community. One of the fundamental problems in this context is that of exploration: the robots must coordinate to visit all locations that are reachable from their initial positions. Despite its apparent simplicity, this problem proved quite hard to characterise fully, due to many model variants, leading to informal error-prone reasoning. Over the past few years, a significant effort permitted to set up a formal framework, relying on the Coq proof assistant, which was used to provide certified results when robots evolve in a continuous bi-dimensional Euclidean space. However, the most challenging issues with exploration arise in the discrete setting (a.k.a. graph), where locations are modeled as vertices and where edges between vertices denote the ability for a robot to move from one location to the next. We present a formal model to tackle problems and reason about robot algorithms arising in the discrete setting. Our approach extends and generalises previous research efforts focusing on the continuous model. As case studies, we consider fundamental impossibility results for exploration with stop in the discrete model. To our knowledge, those are the first certified results in this context. This framework paves the way for a general certification workflow dedicated to mobile robots on graphs.","PeriodicalId":276042,"journal":{"name":"Proceedings of the 19th International Conference on Distributed Computing and Networking","volume":"5 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":"128035755","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}

{"title":"Compressive Sensing of Internet Traffic Matrices using CUR Decomposition","authors":"Awnish Kumar, V. Saradhi, T. Venkatesh","doi":"10.1145/3154273.3154315","DOIUrl":"https://doi.org/10.1145/3154273.3154315","url":null,"abstract":"Missing values in traffic matrix (TM) is a well known fact which needs to be interpolated with least error as TM is a key input to various network operations and management tasks. Compressive sensing deals with the reconstruction of missing observations by taking advantage of the presence of low-rank structure in TMs. Matrix decomposition techniques, more specifically singular value decomposition (SVD) and its variants such as sparsity regularized matrix factorization (SRMF) and sparsity regularized SVD (SRSVD), has attracted considerable attention in the field of compressive sensing of traffic matrices. However, SVD suffers from two limitations stemmed in its assumptions, which involves an assumption of continuous random variables and lack of interpretability of decomposed matrices. In the present work, in order to address the above-identified limitations we develop a simple yet powerful compressive sensing framework with two key components: i) Temporally Local Interpolation (TLI) and ii) CUR decomposition. We utilize a publicly available real traffic matrix obtained from Abilene network. Results show that i) our preprocessing technique, TLI, outperforms existing baseline approximation in terms of exhibiting least error in reconstruction of missing values with loss rates ranging from 1% to 98%. ii) The proposed framework can reconstruct up to 98% of the pure random missing data with an error of 29.8%, which is found to be comparatively better than SVD-based approaches. iii) When augmented with k-Nearest Neighbors (KNN), the proposed framework can reconstruct up to 98% of the pure random missing data with an error of 28.9%, which is comparatively better than (SRMF + KNN) and (SRSVDB + KNN). iv) The proposed framework is also found to be computationally efficient in terms of low computational time as it takes less than 0.7 seconds (using Matlab on a 3.20 GHz Windows machine), which is the least computational time taken as compared to SRMF (3.02 seconds), NMF (1.01 seconds), SRSVD (1.00 second) and SRSVD base (0.83 seconds).","PeriodicalId":276042,"journal":{"name":"Proceedings of the 19th International Conference on Distributed Computing and Networking","volume":"135 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":"127431464","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}

{"title":"SPIN: A Fast and Scalable Matrix Inversion Method in Apache Spark","authors":"Chandan Misra, Sourangshu Bhattacharya, S. Ghosh","doi":"10.1145/3154273.3154300","DOIUrl":"https://doi.org/10.1145/3154273.3154300","url":null,"abstract":"The growth of big data in domains such as Earth Sciences, Social Networks, Physical Sciences, etc. has lead to an immense need for efficient and scalable linear algebra operations, e.g. Matrix inversion. Existing methods for efficient and distributed matrix inversion using big data platforms rely on LU decomposition based block-recursive algorithms. However, these algorithms are complex and require a lot of side calculations, e.g. matrix multiplication, at various levels of recursion. In this paper, we propose a different scheme based on Strassen's matrix inversion algorithm (mentioned in Strassen's original paper in 1969), which uses far fewer operations at each level of recursion. We implement the proposed algorithm, and through extensive experimentation, show that it is more efficient than the state of the art methods. Furthermore, we provide a detailed theoretical analysis of the proposed algorithm, and derive theoretical running times which match closely with the empirically observed wall clock running times, thus explaining the U-shaped behaviour w.r.t. block-sizes.","PeriodicalId":276042,"journal":{"name":"Proceedings of the 19th International Conference on Distributed Computing and Networking","volume":"11 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":"115603957","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}

{"title":"The Assignment Problem","authors":"C. Delporte-Gallet, H. Fauconnier, Eli Gafni, Giuliano Losa","doi":"10.1145/3154273.3154303","DOIUrl":"https://doi.org/10.1145/3154273.3154303","url":null,"abstract":"In the allocation problem, asynchronous processors must partition a set of items so that each processor leave knowing all items exclusively allocated to it. We introduce a new variant of the allocation problem called the assignment problem, in which processors might leave having only partial knowledge of their assigned items. The missing items in a processor's assignment must eventually be announced by other processors. While allocation has consensus power 2, we show that the assignment problem is solvable read-write wait-free when k processors compete for at least 2k --1 items. Moreover, we propose a long-lived read-write wait-free assignment algorithm which is fair, allocating no more than 2 items per processor, and in which a slow processor may delay the assignment of at most n items, where n is the number of processors. The assignment problem and its read-write solution may be of practical interest for implementing resource allocators and work queues, which are pervasive concurrent programming patterns, as well as stream-processing systems.","PeriodicalId":276042,"journal":{"name":"Proceedings of the 19th International Conference on Distributed Computing and Networking","volume":"26 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":"129494801","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}

{"title":"Dolus: Cyber Defense using Pretense against DDoS Attacks in Cloud Platforms","authors":"R. Neupane, Travis Neely, Nishant Chettri, Mark Vassell, Yuanxun Zhang, P. Calyam, Ramakrishnan Durairajan","doi":"10.1145/3154273.3154346","DOIUrl":"https://doi.org/10.1145/3154273.3154346","url":null,"abstract":"Cloud-hosted services are being increasingly used in online businesses in e.g., retail, healthcare, manufacturing, entertainment due to benefits such as scalability and reliability. These benefits are fueled by innovations in orchestration of cloud platforms that make them totally programmable as Software Defined everything Infrastructures (SDxI). At the same time, sophisticated targeted attacks such as Distributed Denial-of-Service (DDoS) are growing on an unprecedented scale threatening the availability of online businesses. In this paper, we present a novel defense system called Dolus to mitigate the impact of DDoS attacks launched against high-value services hosted in SDxI-based cloud platforms. Our Dolus system is able to initiate a 'pretense' in a scalable and collaborative manner to deter the attacker based on threat intelligence obtained from attack feature analysis in a two-stage ensemble learning scheme. Using foundations from pretense theory in child play, Dolus takes advantage of elastic capacity provisioning via 'quarantine virtual machines' and SDxI policy co-ordination across multiple network domains to deceive the attacker by creating a false sense of success. From the time gained through pretense initiation, Dolus enables cloud service providers to decide on a variety of policies to mitigate the attack impact, without disrupting the cloud services experience for legitimate users. We evaluate the efficacy of Dolus using a GENI Cloud testbed and demonstrate its real-time capabilities to: (a) detect DDoS attacks and redirect attack traffic to quarantine resources to engage the attacker under pretense, and (b) coordinate SDxI policies to possibly block DDoS attacks closer to the attack source(s).","PeriodicalId":276042,"journal":{"name":"Proceedings of the 19th International Conference on Distributed Computing and Networking","volume":"17 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":"129822368","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}

{"title":"Joint Virtual Machine Placement and Path Selection in a Virtualized Datacenter Environment","authors":"Shruti Gandhi, Y. Viniotis","doi":"10.1145/3154273.3154325","DOIUrl":"https://doi.org/10.1145/3154273.3154325","url":null,"abstract":"Today's multi-tenant shared datacenter environments guarantee compute resources over a best-effort intra-datacenter network. Bursty traffic in such a network implies higher delays and losses for tenants. This may result in unpredictable network performance, potentially hurting the tenant's overall application performance. Motivated by these concerns, in this work we propose a Service Level Agreement (SLA) that along with compute capacity, explicitly guarantees intra-datacenter network bandwidth to the tenants in a virtualized, multi-tenant datacenter environment. We design a modified greedy approach that uses virtual machine placement and path selection to solve the joint resource allocation problem. In recent years, several algorithms have been proposed for resource allocation problems to meet a specific SLA. However they do not provide any practical recommendations for the realization of these solutions from a datacenter designer's standpoint. Another main contribution of our work is the design of a rigorous simulation setup to derive a definitive set of guidelines for the datacenter designer implementing the proposed SLA. The guideline answers questions of key practical importance to datacenter designers and enables derivation of effective estimates about the switch fabric and server capacity to be bought and installed, as a function of tenant demands.","PeriodicalId":276042,"journal":{"name":"Proceedings of the 19th International Conference on Distributed Computing and Networking","volume":"9 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":"115450681","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}