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

{"title":"BITS Darshini: A Modular, Concurrent Protocol Analyzer Workbench","authors":"Prasad Talasila, Mihir Kakrambe, Anurag Rai, Sebastin Santy, Neena Goveas, Bharat M. Deshpande","doi":"10.1145/3154273.3154316","DOIUrl":"https://doi.org/10.1145/3154273.3154316","url":null,"abstract":"Network measurements are essential for troubleshooting and active management of networks. Protocol analysis of captured network packet traffic is an important passive network measurement technique used by researchers and network operations engineers. In this work, we present a measurement workbench tool named BITS Darshini (Darshini in short) to enable scientific network measurements. We have created Darshini as a modular, concurrent web application that stores experimental meta-data and allows users to specify protocol parse graphs. Darshini performs protocol analysis on a concurrent pipeline architecture, persists the analysis to a database and provides the analysis results via a REST API service. We formulate the problem of mapping protocol parse graph to a concurrent pipeline as a graph embedding problem. Our tool, Darshini, performs protocol analysis up to transport layer and is suitable for the study of small and medium-sized networks. Darshini enables secure collaboration and consultations with experts.","PeriodicalId":276042,"journal":{"name":"Proceedings of the 19th International Conference on Distributed Computing and Networking","volume":"55 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":"126630551","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 Complete Visibility Problem for Fat Robots with Lights","authors":"Gokarna Sharma, Rusul Alsaedi, C. Busch, S. Mukhopadhyay","doi":"10.1145/3154273.3154319","DOIUrl":"https://doi.org/10.1145/3154273.3154319","url":null,"abstract":"We consider the distributed setting of N autonomous mobile robots that operate in Look-Compute-Move cycles and communicate with other robots using colored lights (the robots with lights model). We study the fundamental problem of repositioning N autonomous robots on a plane so that each robot is visible to all others (the Complete Visibility problem) on this model. We consider obstructed visibility under which a robot cannot see another robot if a third robot is positioned between then on the straight line connecting them. The literature solves this problem on the robots with lights model for point robots. In this paper, we study this problem, for the very first time, on the robots with lights model for fat robots, i.e., the robots which have physical extents. In particular, we present and analyze an algorithm for the fat robots of unit disc size extents that solves Complete Visibility in O(N) time using 9 colors in the fully synchronous setting avoiding robot collisions.","PeriodicalId":276042,"journal":{"name":"Proceedings of the 19th International Conference on Distributed Computing and Networking","volume":"1 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":"130890902","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 Complexity of Leader Election: A Chasm at Diameter Two","authors":"Soumyottam Chatterjee, Gopal Pandurangan, Peter Robinson","doi":"10.1145/3154273.3154308","DOIUrl":"https://doi.org/10.1145/3154273.3154308","url":null,"abstract":"Leader election is one of the fundamental problems in distributed computing. In its implicit version, only the leader must know who is the elected leader. This paper focuses on studying the message complexity of leader election in synchronous distributed networks, in particular, in networks of diameter two. Kutten et al. [JACM 2015] showed a fundamental lower bound of Ω(m) (m is the number of edges in the network) on the message complexity of (implicit) leader election that applied also to Monte Carlo randomized algorithms with constant success probability; this lower bound applies for graphs that have diameter at least three. On the other hand, for complete graphs (i.e., diameter 1), Kutten et al. [TCS 2015] established a tight bound of Θ(√n)1 on the message complexity of randomized leader election (n is the number of nodes in the network). For graphs of diameter two, the complexity was not known. In this paper, we settle this complexity by showing a tight bound of Θ(n) on the message complexity of leader election in diameter-two networks. We first give a simple randomized Monte-Carlo leader election algorithm that with high probability (i.e., probability at least 1 -- n-c, for some positive constant c) succeeds and uses O (n log3 n) messages and runs in O (1) rounds; this algorithm works without knowledge of n (and hence needs no global knowledge). We then show that any algorithm (even Monte Carlo randomized algorithms with large enough constant success probability) needs Ω(n) messages (even when n is known), regardless of the number of rounds. We also present an O (n log n) messages deterministic algorithm that takes O (log n) rounds (but needs knowledge of n); we show that this message complexity is tight for deterministic algorithms. Our results show that leader election can be solved in diameter-two graphs in (essentially) linear (in n) message complexity and thus the Ω(m) lower bound does not apply to diameter-two graphs. Together with the two previous results of Kutten et al., our results fully characterize the message complexity of leader election vis-à-vis the graph diameter.","PeriodicalId":276042,"journal":{"name":"Proceedings of the 19th International Conference on Distributed Computing and Networking","volume":"18 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":"121930810","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":"Countering Control Message Manipulation Attacks on OLSR","authors":"P. Singh, K. Kar","doi":"10.1145/3154273.3154339","DOIUrl":"https://doi.org/10.1145/3154273.3154339","url":null,"abstract":"In this work we utilize a Reputation Routing Model (RRM), which we developed in an earlier work, to mitigate the impact of three different control message based blackhole attacks in Optimized Link State Routing (OLSR) for Mobile Ad Hoc Networks (MANETs). A malicious node can potentially introduce three types of blackhole attacks on OLSR, namely TC-Blackhole attack, HELLO-Blackhole attack and TC-HELLO-Blackhole attack, by modifying its TC and HELLO messages with false information and disseminating them in the network in order to fake its advertisement. This results in node(s) diverting their messages toward the malicious node, therefore posing great security risks. Our solution reduces the risk posed by such bad nodes in the network and tries to isolate such links by feeding correct link state information to OLSR. We evaluate the performance of our model by emulating network scenarios on Common Open Research Emulator (CORE) for static as well as dynamic topologies. From our findings, it is observed that our model diminishes the effect of all three blackhole attacks on OLSR protocol in terms of packet delivery rates, especially at static and low mobility.","PeriodicalId":276042,"journal":{"name":"Proceedings of the 19th International Conference on Distributed Computing and Networking","volume":"51 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":"115680457","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":"MDTC Video Transmission using Channel Aware Multipath Routing in Wireless Mesh Networks","authors":"Raga Bharani Chenna, Chetna Singhal, S. De","doi":"10.1145/3154273.3154338","DOIUrl":"https://doi.org/10.1145/3154273.3154338","url":null,"abstract":"In a mesh network, there are many paths available between two nodes depending on their location. To explore this property of path diversity, the information can be split into chunks and sent over different paths. An image or video when packetized and sent, there are chances that few packets may be corrupted in transmission. Spatial Correlation property of images and videos can be used to split an image or video frame into different descriptions so that spatial neighbors fall into different descriptions which can be sent independent of each other thus preserving the details better. Also, by inserting a recovery stage in between, we can overcome the existing errors to some extent with the help of their spatial/transformed neighbors. Hence, to achieve error resilience in wireless mesh networks by the virtue of path diversity and spatial correlation, Multiple Description Transform Coding (MDTC) was formulated for images and extended to videos. Multiple paths are selected based on channel state (packet error information). Intermediate recovery is added to increase the robustness of MDTC. The proposed scheme improves the PSNR of the received video and reduces end to end transmission delay in a wireless mesh network.","PeriodicalId":276042,"journal":{"name":"Proceedings of the 19th International Conference on Distributed Computing and Networking","volume":"1 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":"128887571","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":"Cloud-Fog Interoperability in IoT-enabled Healthcare Solutions","authors":"Md. Redowan Mahmud, F. Koch, R. Buyya","doi":"10.1145/3154273.3154347","DOIUrl":"https://doi.org/10.1145/3154273.3154347","url":null,"abstract":"The issue of utilizing Internet of Things (IoT) in Healthcare solutions relates to the problems of latency sensitivity, uneven data load, diverse user expectations and heterogeneity of the applications. Current explorations consider Cloud Computing as the base stone to create IoT-Enable solution. Nonetheless, this environment entails limitations in terms of multi-hop distance from the data source, geographical centralized architecture, economical aspects, etc. To address these limitations, there is a surge of solutions that apply Fog Computing as an approach to bring computing resources closer to the data sources. This approach is being fomented by the growing availability of powerful edge computing at lower cost and commercial developments in the area. Nonetheless, the implementation of Cloud-Fog interoperability and integration implies in complex coordination of applications and services and the demand for intelligent service orchestrations so that solutions can make the best use of distributed resources without compromising stability, quality of services, and security. In this paper, we introduce a Fog-based IoT-Healthcare solution structure and explore the integration of Cloud-Fog services in interoperable Healthcare solutions extended upon the traditional Cloud-based structure. The scenarios are evaluated through simulations using the iFogSim simulator and the results analyzed in relation to distributed computing, reduction of latency, optimization of data communication, and power consumption. The experimental results point towards improvement in instance cost, network delay and energy usage.","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":"126422777","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 Placement of LAA/LTE-U Base Stations in Heterogeneous Wireless Networks","authors":"Anand M. Baswade, Kiran M. R. Shashi, T. B. Reddy, A. Franklin","doi":"10.1145/3154273.3154297","DOIUrl":"https://doi.org/10.1145/3154273.3154297","url":null,"abstract":"Recently, the use of LTE in the unlicensed spectrum has gained a lot of attention to address bandwidth crunch. Due to restriction on the transmission power in the unlicensed spectrum, LTE-U/LAA cells will get deployed mostly inside residential and office buildings to provide high data rates for indoor User Equipments (UEs). The UEs with high Signal-to-Interference plus Noise Ratio (SINR) experience good throughput, but the SINR decreases significantly due to walls and other obstacles that are present in the communication path. The coverage difference of licensed and unlicensed spectrum leads to different SINRs so, efficient placement of LAA Base Stations (BSs) inside the buildings is very crucial for attaining desirable SINR for the indoor UEs. Our primary objective is to find the optimal number of LAA/LTE-U BSs with minimum SINR requirements in the unlicensed band, and the secondary objective is to maximize the minimum SINR inside the building in the licensed band with power control. To do this, we formulate an optimization model (MinLF) to find the minimum number of LAA/LTE-U BSs along with their positions in indoor scenarios which resulted in Mixed Integer Linear Programming (MILP) problem. Further, to maximize the minimum SINR in the licensed spectrum, we formulate MinLPower model to find the optimal transmission power of each LTE-U/LAA cell inside the building which resulted in Mixed Integer Non-Linear Programming (MINLP) problem. Our proposed models achieve optimal placement with a maximum energy saving of 88% compared to the maximum power scheme.","PeriodicalId":276042,"journal":{"name":"Proceedings of the 19th International Conference on Distributed Computing and Networking","volume":"131 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":"128234195","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":"Software Defined Underlay-aware Structured Peer-to-Peer Overlay","authors":"N. Shukla, Anurag Bamal, S. Srivastava, M. Pandey","doi":"10.1145/3154273.3154310","DOIUrl":"https://doi.org/10.1145/3154273.3154310","url":null,"abstract":"Structured Peer-to-Peer (P2P) overlay networks based on Distributed Hash Table (DHT) provide self-organization and fault tolerance along with good look-up efficiency. This makes them a perfect alternative for designing distributed applications where participating entities (peers) leave or join the system dynamically. However due to continuous churn of peers, periodic maintenance of overlay structure is required resulting in large amount of network traffic. This issue becomes more critical when logical overlay topology is different from actual physical network topology which is a common phenomenon in P2P overlay networks. In this paper, we present a novel approach of designing DHT based P2P overlays using Software Defined Networks (SDN) paradigm. SDN provides flexible ways to tune the policies and rules of underlying physical network dynamically according to the application. In our approach, we have used SDN concepts to bring the overlay topology closer to actual physical topology with an aim to reduce the maintenance traffic. We have implemented an improved SDN based DHT on a smaller scale as proof of concept. The experimental results suggest and establish the applicability of our approach.","PeriodicalId":276042,"journal":{"name":"Proceedings of the 19th International Conference on Distributed Computing and Networking","volume":"18 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":"132808032","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":"Encoded Vector Clock: Using Primes to Characterize Causality in Distributed Systems","authors":"A. Kshemkalyani, A. Khokhar, Min Shen","doi":"10.1145/3154273.3154305","DOIUrl":"https://doi.org/10.1145/3154273.3154305","url":null,"abstract":"The vector clock is a fundamental tool for tracking causality in distributed applications. Unfortunately, it does not scale well to large systems because each process needs to maintain a vector of size n, where n is the total number of processes in the system. To address this problem, we propose the encoding of the vector clock using prime numbers to use a single number to represent vector time. We propose the operations on the encoded vector clock (EVC). We then show how to timestamp global states and how to perform operations on the global states using the EVC. We also discuss scalability issues of the EVC.","PeriodicalId":276042,"journal":{"name":"Proceedings of the 19th International Conference on Distributed Computing and Networking","volume":"14 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":"121294904","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":"Auto-Resource Provisioning for MapReduce-Based Multiple Object Tracking in Video","authors":"Gurinderbeer Singh, S. Majumdar, S. Rajan","doi":"10.1145/3154273.3154340","DOIUrl":"https://doi.org/10.1145/3154273.3154340","url":null,"abstract":"Use of complex image analysis and globally optimal techniques make the current Multiple Object Tracking (MOT) methods for video analysis computationally slow. An important issue in this context is meeting the specific latency requirement for a given application while processing large scale video data. This is especially important in emergency situations such as accidents, natural calamities, and terrorist attacks. This paper introduces a latency reducing MapReduce/Hadoop-based parallel solution for MOT. The system includes an Auto-Resource Provisioning technique for determining the number of Hadoop nodes required to process the MOT job within a user specified deadline. The estimated number of nodes are then provisioned by the system and the MOT application is executed on the Hadoop cluster comprising the desired number of nodes. A prototype is built using the AWS EC2 cloud. A performance analysis is performed using measurements made on the prototype and insights gained into system behavior and performance are presented.","PeriodicalId":276042,"journal":{"name":"Proceedings of the 19th International Conference on Distributed Computing and Networking","volume":"23 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":"124880231","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}