Nowadays, many enterprise applications with a global coverage, huge volume and dense communication are deployed in the cloud. Federated data center (DC), where multiple cloud providers (CPs) share their resources, presents a scalable platform to serve such applications [1]. The main goal CPs is minimizing the operating cost. Energy consumption contributes a major fraction of operating cost; up to 50% [2]. Further, enterprise applications contain a large number of virtual machines (VMs) with huge data exchange up to 500 TB per day [3]. Subsequently, energy and bandwidth must be considered during VM placement to minimize the operating cost.
{"title":"A cost-aware algorithm for placement of enterprise applications in federated cloud data center","authors":"Moustafa Najm, V. Tamarapalli","doi":"10.1145/3288599.3299725","DOIUrl":"https://doi.org/10.1145/3288599.3299725","url":null,"abstract":"Nowadays, many enterprise applications with a global coverage, huge volume and dense communication are deployed in the cloud. Federated data center (DC), where multiple cloud providers (CPs) share their resources, presents a scalable platform to serve such applications [1]. The main goal CPs is minimizing the operating cost. Energy consumption contributes a major fraction of operating cost; up to 50% [2]. Further, enterprise applications contain a large number of virtual machines (VMs) with huge data exchange up to 500 TB per day [3]. Subsequently, energy and bandwidth must be considered during VM placement to minimize the operating cost.","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":"128561877","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 a distributed network, we consider two special nodes called the sender S and the receiver R that are connected by n node-disjoint (except for S and R) bi-directional wires. Out of these n wires, the adversary can control at most t wires (of its choice) in Byzantine fashion. In this setting, our goal is to design a message transmission protocol Π that assures the following two conditions hold: (1) by the end of the protocol Π, R gets the correct message m transmitted by S without any error (perfect reliability), and (2) the adversary learns no information about m, whatsoever, in information theoretic sense (perfect secrecy). Protocols that satisfy these two conditions are known as the Perfectly Secure Message Transmission (PSMT) protocols. However, out of the n wires that exist, if some number of wires say ns, fortunately, happen to be synchronous (serendipitous synchrony) then we ask under what conditions do PSMT protocols tolerating t-Byzantine faults exist. In the literature, it is known that, if either ns > 2t or n > 3t then PSMT protocols trivially exist. Therefore, we consider the case where we have at most 2t synchronous wires (i.e., ns ≤ 2t) and at most 3t wires overall (i.e., n ≤ 3t). Interestingly, we prove that in this case, no PSMT protocol exists. This concludes that, in designing PSMT protocols (tolerating the given fixed number of faults), either (serendipitous) synchronous wires alone are sufficient or we get absolutely no extra advantage of a wire being synchronous over asynchronous.
{"title":"Perfectly secure message transmission over partially synchronous networks","authors":"R. Kishore, Anupriya Inumella, K. Srinathan","doi":"10.1145/3288599.3288612","DOIUrl":"https://doi.org/10.1145/3288599.3288612","url":null,"abstract":"In a distributed network, we consider two special nodes called the sender S and the receiver R that are connected by n node-disjoint (except for S and R) bi-directional wires. Out of these n wires, the adversary can control at most t wires (of its choice) in Byzantine fashion. In this setting, our goal is to design a message transmission protocol Π that assures the following two conditions hold: (1) by the end of the protocol Π, R gets the correct message m transmitted by S without any error (perfect reliability), and (2) the adversary learns no information about m, whatsoever, in information theoretic sense (perfect secrecy). Protocols that satisfy these two conditions are known as the Perfectly Secure Message Transmission (PSMT) protocols. However, out of the n wires that exist, if some number of wires say ns, fortunately, happen to be synchronous (serendipitous synchrony) then we ask under what conditions do PSMT protocols tolerating t-Byzantine faults exist. In the literature, it is known that, if either ns > 2t or n > 3t then PSMT protocols trivially exist. Therefore, we consider the case where we have at most 2t synchronous wires (i.e., ns ≤ 2t) and at most 3t wires overall (i.e., n ≤ 3t). Interestingly, we prove that in this case, no PSMT protocol exists. This concludes that, in designing PSMT protocols (tolerating the given fixed number of faults), either (serendipitous) synchronous wires alone are sufficient or we get absolutely no extra advantage of a wire being synchronous over asynchronous.","PeriodicalId":346177,"journal":{"name":"Proceedings of the 20th International Conference on Distributed Computing and Networking","volume":"84 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":"116400636","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 Steiner tree problem is a classical and fundamental problem in combinatorial optimization. The best known deterministic distributed algorithm for the Steiner tree problem in the CONGEST model was proposed by Lenzen and Patt-Shamir [25] that constructs a Steiner tree whose cost is optimal upto a factor of 2 and the round complexity is [MATH HERE] for a graph of n nodes and t terminals, where S is the shortest path diameter of the graph. Note here that the Õ (·) notation hides polylogarithmic factors in n. In this paper we present a simple deterministic distributed algorithm for constructing a Steiner tree in the CONGEST model with an approximation factor [MATH HERE] of the optimal where ℓ is the number of terminal leaf nodes in the optimal Steiner tree. The round complexity of our algorithm is [MATH HERE] and the message complexity is O(Δ(n − t)S + n3/2, where Δ is the maximum degree of a vertex in the graph. Our algorithm is based on the computation of a sub-graph called the shortest path forest for which we present a separate deterministic distributed algorithm with round and message complexities of O(S) and O(Δ(n - t)S) respectively.
{"title":"A simple 2(1-1/l) factor distributed approximation algorithm for steiner tree in the CONGEST model","authors":"Parikshit Saikia, S. Karmakar","doi":"10.1145/3288599.3288629","DOIUrl":"https://doi.org/10.1145/3288599.3288629","url":null,"abstract":"The Steiner tree problem is a classical and fundamental problem in combinatorial optimization. The best known deterministic distributed algorithm for the Steiner tree problem in the CONGEST model was proposed by Lenzen and Patt-Shamir [25] that constructs a Steiner tree whose cost is optimal upto a factor of 2 and the round complexity is [MATH HERE] for a graph of n nodes and t terminals, where S is the shortest path diameter of the graph. Note here that the Õ (·) notation hides polylogarithmic factors in n. In this paper we present a simple deterministic distributed algorithm for constructing a Steiner tree in the CONGEST model with an approximation factor [MATH HERE] of the optimal where ℓ is the number of terminal leaf nodes in the optimal Steiner tree. The round complexity of our algorithm is [MATH HERE] and the message complexity is O(Δ(n − t)S + n3/2, where Δ is the maximum degree of a vertex in the graph. Our algorithm is based on the computation of a sub-graph called the shortest path forest for which we present a separate deterministic distributed algorithm with round and message complexities of O(S) and O(Δ(n - t)S) respectively.","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":"131087976","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}
Occasionaly, every society needs to reach a decision among its members. For this, it may use a voting mechanism, i.e., collect the votes of the group members and output a decision that best expresses the group's will. To make up their minds, individuals often discuss the issue with friends before taking their votes, thus mutually affecting each other's votes. Individuals are also, to some extent, influenced by the opinions of key figures in their culture, such as politicians, publicists, etc., commonly considered as the "elite" of the society. This work studies the "power of the elite": to what extent can the elite of a social network influence the rest of society to accept its opinion, and thus become a monopoly. We present an empirical study of local majority voting in social networks, where the elite forms a coalition against all other (common) nodes. The results, obtained on several social networks, indicate that an elite of size [MATH HERE] (where m is the number of connections) has disproportionate power, relative to its size, with respect to the rest of society: it wins the majority voting and remains stable over time.
{"title":"Majority vote and monopolies in social networks","authors":"C. Avin, Zvi Lotker, Assaf Mizrachi, D. Peleg","doi":"10.1145/3288599.3288633","DOIUrl":"https://doi.org/10.1145/3288599.3288633","url":null,"abstract":"Occasionaly, every society needs to reach a decision among its members. For this, it may use a voting mechanism, i.e., collect the votes of the group members and output a decision that best expresses the group's will. To make up their minds, individuals often discuss the issue with friends before taking their votes, thus mutually affecting each other's votes. Individuals are also, to some extent, influenced by the opinions of key figures in their culture, such as politicians, publicists, etc., commonly considered as the \"elite\" of the society. This work studies the \"power of the elite\": to what extent can the elite of a social network influence the rest of society to accept its opinion, and thus become a monopoly. We present an empirical study of local majority voting in social networks, where the elite forms a coalition against all other (common) nodes. The results, obtained on several social networks, indicate that an elite of size [MATH HERE] (where m is the number of connections) has disproportionate power, relative to its size, with respect to the rest of society: it wins the majority voting and remains stable over time.","PeriodicalId":346177,"journal":{"name":"Proceedings of the 20th International Conference on Distributed Computing and Networking","volume":"42 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":"132561216","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}
This article presents a part of the work being carried out under the Department of Science & Technology (DST)-funded project, titled Advanced Urban Public Transportation System. The solutions designed for real-time tracking of metro buses in urban areas of India, detecting bus-stops automatically, and predicting the arrival time of buses accurately are elaborated. The proposed system addresses the challenges related to GPS outage, unknown schedule and stoppages of buses, and unavailability of real time traffic information along the bus-route. The system is evaluated using multiple-trip data collected over a 32 kilometer long route during the peak and off-peak hour traffic conditions. The bus-stop detection accuracy of 75% (6 out of 8 bus-stops are accurately detected) could be achieved using an arbitrary set of trips conducted over the route. The arrival time prediction error of 7% (5 minutes) has been reported. The scalability assessment of the system shows that it can support the transit of more than ten thousand buses and over one million subscribers/commuters.
{"title":"Advanced urban public transportation system for Indian scenarios","authors":"Pruthvish Rajput, Manish Chaturvedi, Pankesh Patel","doi":"10.1145/3288599.3288624","DOIUrl":"https://doi.org/10.1145/3288599.3288624","url":null,"abstract":"This article presents a part of the work being carried out under the Department of Science & Technology (DST)-funded project, titled Advanced Urban Public Transportation System. The solutions designed for real-time tracking of metro buses in urban areas of India, detecting bus-stops automatically, and predicting the arrival time of buses accurately are elaborated. The proposed system addresses the challenges related to GPS outage, unknown schedule and stoppages of buses, and unavailability of real time traffic information along the bus-route. The system is evaluated using multiple-trip data collected over a 32 kilometer long route during the peak and off-peak hour traffic conditions. The bus-stop detection accuracy of 75% (6 out of 8 bus-stops are accurately detected) could be achieved using an arbitrary set of trips conducted over the route. The arrival time prediction error of 7% (5 minutes) has been reported. The scalability assessment of the system shows that it can support the transit of more than ten thousand buses and over one million subscribers/commuters.","PeriodicalId":346177,"journal":{"name":"Proceedings of the 20th International Conference on Distributed Computing and Networking","volume":"1997 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":"128217159","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}
Swarm robot is a collection of tiny identical autonomous mobile robots who collaboratively perform a given task. One of the main objectives of swarm robots is to place themselves on a geographic region forming a particular geometric pattern in order to execute some jobs in cooperation, e.g., covering or guarding a region, moving a big object. This paper proposes a deterministic distributed algorithm for a set of tiny disc shaped swarm robots (also known as fat robots) to form a straight line and then moving this line by coordinating the motion of the robots. This phenomenon of moving of robots while maintaining the straight line formation, is known as Flocking of robots. The robots are homogeneous, autonomous, anonymous. They need very less computational power. They sense their surrounding, compute destinations to move to and move there. They do not have any explicit message sending or receiving capability. They forget their past sensed and computed data. The robots do not agree on any global coordinate system or origin. The robots are not aware of the total number of robots in the system. All these disabilities of the robots make them less expensive in cost as well as simple in software and hardware requirements. The algorithm presented in this paper assures collision free movements of the robots.
{"title":"Flocking along line by autonomous oblivious mobile robots","authors":"S. Chaudhuri","doi":"10.1145/3288599.3295583","DOIUrl":"https://doi.org/10.1145/3288599.3295583","url":null,"abstract":"Swarm robot is a collection of tiny identical autonomous mobile robots who collaboratively perform a given task. One of the main objectives of swarm robots is to place themselves on a geographic region forming a particular geometric pattern in order to execute some jobs in cooperation, e.g., covering or guarding a region, moving a big object. This paper proposes a deterministic distributed algorithm for a set of tiny disc shaped swarm robots (also known as fat robots) to form a straight line and then moving this line by coordinating the motion of the robots. This phenomenon of moving of robots while maintaining the straight line formation, is known as Flocking of robots. The robots are homogeneous, autonomous, anonymous. They need very less computational power. They sense their surrounding, compute destinations to move to and move there. They do not have any explicit message sending or receiving capability. They forget their past sensed and computed data. The robots do not agree on any global coordinate system or origin. The robots are not aware of the total number of robots in the system. All these disabilities of the robots make them less expensive in cost as well as simple in software and hardware requirements. The algorithm presented in this paper assures collision free movements of the robots.","PeriodicalId":346177,"journal":{"name":"Proceedings of the 20th International Conference on Distributed Computing and Networking","volume":"102 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":"133236426","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 thirst of acquiring and sharing the knowledge has been increased exponentially in these days due to the availability of the Internet at the finger tips. As a consequence, the need of privacy at various levels and various contexts has been comprehensively studied by various cryptographers. One of the user privacy preserving concepts called Private Information Retrieval (PIR) also provides user privacy at various levels. Several years of efforts on PIR have succeeded to provide almost practical communication efficient privacy preserving solutions.
由于互联网触手可及，获取和分享知识的渴望在这些日子里呈指数级增长。因此，各种密码学家对不同层次和不同背景下的隐私需求进行了全面的研究。私有信息检索(Private Information Retrieval, PIR)是保护用户隐私的概念之一，它也在不同层次上提供用户隐私。多年来在PIR方面的努力已经成功地提供了几乎实用的通信高效隐私保护解决方案。
{"title":"An efficient user privacy preserving multi-server private information retrieval: an efficient privacy preserving information storage and retrieval framework","authors":"Radhakrishna Bhat, N. Sunitha","doi":"10.1145/3288599.3299724","DOIUrl":"https://doi.org/10.1145/3288599.3299724","url":null,"abstract":"The thirst of acquiring and sharing the knowledge has been increased exponentially in these days due to the availability of the Internet at the finger tips. As a consequence, the need of privacy at various levels and various contexts has been comprehensively studied by various cryptographers. One of the user privacy preserving concepts called Private Information Retrieval (PIR) also provides user privacy at various levels. Several years of efforts on PIR have succeeded to provide almost practical communication efficient privacy preserving solutions.","PeriodicalId":346177,"journal":{"name":"Proceedings of the 20th International Conference on Distributed Computing and Networking","volume":"84 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":"132167818","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}
Bapi Chatterjee, Sathya Peri, Muktikanta Sa, N. Singhal
Graph algorithms applied in many applications, including social networks, communication networks, VLSI design, graphics, and several others, require dynamic modifications - addition and removal of vertices and/or edges - in the graph. This paper presents a novel concurrent non-blocking algorithm to implement a dynamic unbounded directed graph in a shared-memory machine. The addition and removal operations of vertices and edges are lock-free. For a finite sized graph, the lookup operations are wait-free. Most significant component of the presented algorithm is the reachability query in a concurrent graph. The reachability queries in our algorithm are obstruction-free and thus impose minimal additional synchronization cost over other operations. We prove that each of the data structure operations are linearizable. We extensively evaluate a sample C/C++ implementation of the algorithm through a number of micro-benchmarks. The experimental results show that the proposed algorithm scales well with the number of threads and on an average provides 5 to 7x performance improvement over a concurrent graph implementation using coarse-grained locking.
{"title":"A simple and practical concurrent non-blocking unbounded graph with linearizable reachability queries","authors":"Bapi Chatterjee, Sathya Peri, Muktikanta Sa, N. Singhal","doi":"10.1145/3288599.3288617","DOIUrl":"https://doi.org/10.1145/3288599.3288617","url":null,"abstract":"Graph algorithms applied in many applications, including social networks, communication networks, VLSI design, graphics, and several others, require dynamic modifications - addition and removal of vertices and/or edges - in the graph. This paper presents a novel concurrent non-blocking algorithm to implement a dynamic unbounded directed graph in a shared-memory machine. The addition and removal operations of vertices and edges are lock-free. For a finite sized graph, the lookup operations are wait-free. Most significant component of the presented algorithm is the reachability query in a concurrent graph. The reachability queries in our algorithm are obstruction-free and thus impose minimal additional synchronization cost over other operations. We prove that each of the data structure operations are linearizable. We extensively evaluate a sample C/C++ implementation of the algorithm through a number of micro-benchmarks. The experimental results show that the proposed algorithm scales well with the number of threads and on an average provides 5 to 7x performance improvement over a concurrent graph implementation using coarse-grained locking.","PeriodicalId":346177,"journal":{"name":"Proceedings of the 20th International Conference on Distributed Computing and Networking","volume":"13 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":"114753034","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}
Claudio Fiandrino, A. D. Oliva, J. Widmer, Kirill Kogan
To deal with increasingly demanding services and the rapid growth in number of devices and traffic, 5G and beyond mobile networks need to provide extreme capacity and peak data rates at very low latencies. Consequently, applications and services need to move closer to the users into so-called edge data centers. At the same time, there is a trend to virtualize core and radio access network functionalities and bring them to edge data centers as well. However, as is known from conventional data centers, legacy transport protocols such as TCP are vastly suboptimal in such a setting. In this work, we present pDCell, a transport design for mobile edge computing architectures that extends data center transport approaches to the mobile network domain. Specifically, pDCell ensures that data traffic from application servers arrives at virtual radio functions (i.e., C-RAN Central Units) timely to (i) minimize queuing delays and (ii) to maximize cellular network utilization. We show that pDCell significantly improves flow completion times compared to conventional transport protocols like TCP and data center transport solutions, and is thus an essential component for future mobile networks.
{"title":"pDCell: an end-to-end transport protocol for mobile edge computing architectures","authors":"Claudio Fiandrino, A. D. Oliva, J. Widmer, Kirill Kogan","doi":"10.1145/3288599.3288636","DOIUrl":"https://doi.org/10.1145/3288599.3288636","url":null,"abstract":"To deal with increasingly demanding services and the rapid growth in number of devices and traffic, 5G and beyond mobile networks need to provide extreme capacity and peak data rates at very low latencies. Consequently, applications and services need to move closer to the users into so-called edge data centers. At the same time, there is a trend to virtualize core and radio access network functionalities and bring them to edge data centers as well. However, as is known from conventional data centers, legacy transport protocols such as TCP are vastly suboptimal in such a setting. In this work, we present pDCell, a transport design for mobile edge computing architectures that extends data center transport approaches to the mobile network domain. Specifically, pDCell ensures that data traffic from application servers arrives at virtual radio functions (i.e., C-RAN Central Units) timely to (i) minimize queuing delays and (ii) to maximize cellular network utilization. We show that pDCell significantly improves flow completion times compared to conventional transport protocols like TCP and data center transport solutions, and is thus an essential component for future mobile networks.","PeriodicalId":346177,"journal":{"name":"Proceedings of the 20th International Conference on Distributed Computing and Networking","volume":"3 5 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":"125995174","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}
Srikant Manas Kala, V. Sathya, Suhel Sajjan Magdum, Tulja Vamshi Kiran Buyakar, Hatim Lokhandwala, T. B. Reddy
AllJoyn is an open-source framework which has the potential to be the platform for next-generation proximity centric disaster network (DiNet) applications. However, its development is still in nascent stages, and one of the primary challenges is the design of efficient routing algorithms, which can ensure seamless and uninterrupted communication in an unfavorable environment. In this work, we implement a DiNet prototype using AllJoyn to highlight the challenges of multi-hop routing and propose the concept of extended proximity (e-proximity) in AllJoyn. As a first step towards solving this challenge, we carry out field experiments by implementing an AllJoyn file-transfer application on a trivial DiNet prototype. We then evaluate the performance of the AllJoyn based disaster network and demonstrate that AllJoyn can support robust and reliable DiNet applications.
{"title":"Designing infrastructure-less disaster networks by leveraging the AllJoyn framework","authors":"Srikant Manas Kala, V. Sathya, Suhel Sajjan Magdum, Tulja Vamshi Kiran Buyakar, Hatim Lokhandwala, T. B. Reddy","doi":"10.1145/3288599.3295596","DOIUrl":"https://doi.org/10.1145/3288599.3295596","url":null,"abstract":"AllJoyn is an open-source framework which has the potential to be the platform for next-generation proximity centric disaster network (DiNet) applications. However, its development is still in nascent stages, and one of the primary challenges is the design of efficient routing algorithms, which can ensure seamless and uninterrupted communication in an unfavorable environment. In this work, we implement a DiNet prototype using AllJoyn to highlight the challenges of multi-hop routing and propose the concept of extended proximity (e-proximity) in AllJoyn. As a first step towards solving this challenge, we carry out field experiments by implementing an AllJoyn file-transfer application on a trivial DiNet prototype. We then evaluate the performance of the AllJoyn based disaster network and demonstrate that AllJoyn can support robust and reliable DiNet applications.","PeriodicalId":346177,"journal":{"name":"Proceedings of the 20th International Conference on Distributed Computing and Networking","volume":"131 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":"122454903","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
扫码关注我们
求助内容：
应助结果提醒方式：