P. Paul, C. Mukherjee, B. Ghosh, Sudipta Pandit, Sujoy Saha, S. Nandi
Modeling the demand and supply during an absolute catastrophe is a major challenge for any disaster manager. This paper demonstrates implementation of an easily deployable end-to-end system, by which, various situational data can be collected by the stakeholders during any post-disaster circumstances, and a general summarized view can be plotted on crisis map. The proposed Four Tier Hybrid Ad hoc Network Architecture does not require an Internet backbone but can conduct the complete process in 'offline' mode. Periodic Merging of GIS data enriches the quality of the summarized view. Here we have tried to evaluate the system based on some initial results on a dummy challenged network scenario.
{"title":"On designing a fast-deployable 'localized' GIS platform for using 'offline' during post-disaster situation","authors":"P. Paul, C. Mukherjee, B. Ghosh, Sudipta Pandit, Sujoy Saha, S. Nandi","doi":"10.1145/3288599.3295592","DOIUrl":"https://doi.org/10.1145/3288599.3295592","url":null,"abstract":"Modeling the demand and supply during an absolute catastrophe is a major challenge for any disaster manager. This paper demonstrates implementation of an easily deployable end-to-end system, by which, various situational data can be collected by the stakeholders during any post-disaster circumstances, and a general summarized view can be plotted on crisis map. The proposed Four Tier Hybrid Ad hoc Network Architecture does not require an Internet backbone but can conduct the complete process in 'offline' mode. Periodic Merging of GIS data enriches the quality of the summarized view. Here we have tried to evaluate the system based on some initial results on a dummy challenged network scenario.","PeriodicalId":346177,"journal":{"name":"Proceedings of the 20th International Conference on Distributed Computing and Networking","volume":"191 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":"123382233","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}
More than 200 million people across the globe are affected by Diabetes Mellitus (DM), which is one of the most common endocrine disorders. DM progression is dangerous as it leads to several life-threatening complications within 5--15 years of onset, depending on the care and management that they receive for DM. Hence, it is important for the public and healthcare policymakers to look proactively at managing the onset of the disease and delay associated complications as far as possible. Proactive management would result in significant reductions in the healthcare expenses. The fight against DM is multidisciplinary and research-oriented. Computer and data scientists can collaborate with medical researchers to augment research and management by using the power of big data analytics, machine learning, IoT (Internet of Things), and cloud computing. Computing principles and techniques can be used to efficiently collect, manage, and analyse data to derive meaningful insights, which can then be used for efficient management of the health concerns of patients. This paper describes the need for diabetes management and reviews technological interventions and related research directions in proactive diabetes management.
{"title":"Proactive diabetes management: research directions","authors":"Merlin George, A. Chacko, Sudeep Koshy Kurien","doi":"10.1145/3288599.3297119","DOIUrl":"https://doi.org/10.1145/3288599.3297119","url":null,"abstract":"More than 200 million people across the globe are affected by Diabetes Mellitus (DM), which is one of the most common endocrine disorders. DM progression is dangerous as it leads to several life-threatening complications within 5--15 years of onset, depending on the care and management that they receive for DM. Hence, it is important for the public and healthcare policymakers to look proactively at managing the onset of the disease and delay associated complications as far as possible. Proactive management would result in significant reductions in the healthcare expenses. The fight against DM is multidisciplinary and research-oriented. Computer and data scientists can collaborate with medical researchers to augment research and management by using the power of big data analytics, machine learning, IoT (Internet of Things), and cloud computing. Computing principles and techniques can be used to efficiently collect, manage, and analyse data to derive meaningful insights, which can then be used for efficient management of the health concerns of patients. This paper describes the need for diabetes management and reviews technological interventions and related research directions in proactive diabetes management.","PeriodicalId":346177,"journal":{"name":"Proceedings of the 20th International Conference on Distributed Computing and Networking","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124900978","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
We consider high performance computing infrastructures consisting of multiple sites connected over a wide-area network. These sites house heterogeneous computing systems, 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 recursive system of systems, wherein the basic systems at the finest levels are composed of discrete cyber and physical components. These components may be disabled by cyber and physical disruptions, and their reinforcements protect against them albeit at a cost. We utilize results from a game formulation based on (i) characterizing the disruptions between systems at each level of recursion using aggregate failure correlation functions, and within basic systems using the multiplier functions, and (ii) using utility functions expressed in terms of the number of basic system components attacked and reinforced. At Nash Equilibrium, we derive expressions for the expected capacity of the infrastructure given by the number of computing nodes that are operational and connected to the network.
{"title":"Defense strategies and expected capacity of high performance computing infrastructures","authors":"N. Rao, N. Imam, Chris Y. T. Ma, Fei He","doi":"10.1145/3288599.3288625","DOIUrl":"https://doi.org/10.1145/3288599.3288625","url":null,"abstract":"We consider high performance computing infrastructures consisting of multiple sites connected over a wide-area network. These sites house heterogeneous computing systems, 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 recursive system of systems, wherein the basic systems at the finest levels are composed of discrete cyber and physical components. These components may be disabled by cyber and physical disruptions, and their reinforcements protect against them albeit at a cost. We utilize results from a game formulation based on (i) characterizing the disruptions between systems at each level of recursion using aggregate failure correlation functions, and within basic systems using the multiplier functions, and (ii) using utility functions expressed in terms of the number of basic system components attacked and reinforced. At Nash Equilibrium, we derive expressions for the expected capacity of the infrastructure given by the number of computing nodes that are operational and connected to the network.","PeriodicalId":346177,"journal":{"name":"Proceedings of the 20th International Conference on Distributed Computing and Networking","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124164629","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}
Arunabha Sen, V. Goliber, K. Basu, Chenyang Zhou, Sumitava Ghosh
We study a monitoring problem on the surface of the earth for significant environmental, social/political and extreme events using satellites as sensors. We assume that the surface of the earth is divided into a set of regions, where a region may be a continent, a country, or a set of neighboring countries. We also assume that, the impact of a significant event spills into neighboring regions and there will be corresponding indicators of such events. Careful deployment of sensors, utilizing Identifying Codes, can ensure that even though the number of deployed sensors is fewer than the number of regions, it may be possible to uniquely identify the region where the event has taken place. We assume that an event is confined to a region. As Earth is almost a sphere, we use a soccer ball (a sphere) as a model. From the model, we construct a Soccer Ball Graph (SBG), and show that the SBG has at least 26 sets of Identifying Codes of cardinality ten, implying that there are at least 26 different ways to deploy ten satellites to monitor the Earth. Finally, we also show that the size of the minimum Identifying Code for the SBG is at least nine.
{"title":"On upper and lower bounds of identifying code set for soccer ball graph with application to satellite deployment","authors":"Arunabha Sen, V. Goliber, K. Basu, Chenyang Zhou, Sumitava Ghosh","doi":"10.1145/3288599.3288632","DOIUrl":"https://doi.org/10.1145/3288599.3288632","url":null,"abstract":"We study a monitoring problem on the surface of the earth for significant environmental, social/political and extreme events using satellites as sensors. We assume that the surface of the earth is divided into a set of regions, where a region may be a continent, a country, or a set of neighboring countries. We also assume that, the impact of a significant event spills into neighboring regions and there will be corresponding indicators of such events. Careful deployment of sensors, utilizing Identifying Codes, can ensure that even though the number of deployed sensors is fewer than the number of regions, it may be possible to uniquely identify the region where the event has taken place. We assume that an event is confined to a region. As Earth is almost a sphere, we use a soccer ball (a sphere) as a model. From the model, we construct a Soccer Ball Graph (SBG), and show that the SBG has at least 26 sets of Identifying Codes of cardinality ten, implying that there are at least 26 different ways to deploy ten satellites to monitor the Earth. Finally, we also show that the size of the minimum Identifying Code for the SBG is at least nine.","PeriodicalId":346177,"journal":{"name":"Proceedings of the 20th International Conference on Distributed Computing and Networking","volume":"62 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":"128533752","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}
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}
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}
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
扫码关注我们
求助内容：
应助结果提醒方式：