Proceedings of the 22nd International Conference on Distributed Computing and Networking最新文献

Node Classification and Geographical Analysis of the Lightning Cryptocurrency Network 闪电加密货币网络节点分类与地理分析

Proceedings of the 22nd International Conference on Distributed Computing and Networking Pub Date : 2020-12-25 DOI: 10.1145/3427796.3427837

Philipp Zabka, Klaus-Tycho Förster, S. Schmid, Christian Decker

{"title":"Node Classification and Geographical Analysis of the Lightning Cryptocurrency Network","authors":"Philipp Zabka, Klaus-Tycho Förster, S. Schmid, Christian Decker","doi":"10.1145/3427796.3427837","DOIUrl":"https://doi.org/10.1145/3427796.3427837","url":null,"abstract":"Off-chain networks provide an attractive solution to the scalability challenges faced by cryptocurrencies such as Bitcoin. While first interesting networks are emerging, we currently have relatively limited insights into the structure and distribution of these networks. Such knowledge, however is useful, when reasoning about possible performance improvements or the security of the network. For example, information about the different node types and implementations in the network can help when planning the distribution of critical software updates. This paper reports on a large measurement study of Lightning, a leading off-chain network, considering recorded network messages over a period of more than two years. In particular, we present an approach and classification of the node types (LND, C-Lightning and Eclair) in the network, and find that we can determine the implementation of 99.9% of nodes in our data set. We also report on geographical aspects of the Lightning network, showing that proximity is less relevant, and that the Lightning network is particularly predominant in metropolitan areas. As a contribution to the research community, we will release our experimental data together with this paper.","PeriodicalId":335477,"journal":{"name":"Proceedings of the 22nd International Conference on Distributed Computing and Networking","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116899917","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 5

Autonomous Distributed Systems of Myopic Mobile Robots with Lights 带灯的近视移动机器人自主分布式系统

Proceedings of the 22nd International Conference on Distributed Computing and Networking Pub Date : 2020-12-25 DOI: 10.1145/3427796.3432715

S. Kamei

{"title":"Autonomous Distributed Systems of Myopic Mobile Robots with Lights","authors":"S. Kamei","doi":"10.1145/3427796.3432715","DOIUrl":"https://doi.org/10.1145/3427796.3432715","url":null,"abstract":"The cooperation of swarming autonomous mobile robots has received significant interests in recent years. The common goal of research on it is to clarify the minimum capabilities for robots to achieve a given task. Thus, algorithms for mobile robots have been considered on a theoretical model with negative assumptions about each robot capabilities[4, 6]. Concerning the assumptions, each robot is identical (i.e., all robots run the same algorithm), anonymous (i.e., each robot has no IDs to distinguish two robots), oblivious (i.e., each robot has no memory to record past situation) and silent (i.e., each robot has no direct means of communication). In the initial model described above, because of fundamentally weak capabilities, it is known that most tasks cannot be solved without some additional assumptions even if the model considers the unlimited visibility. However, we may not need to assume completely oblivious robots considering their implementations on real devices because persistent memory is widely available. Thus, recently, luminous robots have attracted attention in order to improve robot capability [1, 7]. A luminous robot maintains a non-volatile visible light, and emits the chosen light color among a set of colors to other robots. That is, a luminous robot uses the light to memorize its state and communicate with other robots. On the other hand, for the assumption of unlimited visibility of the initial model, each robot has a too strong observation device. Therefore, several recent studies focus on myopic robots to consider the implementation of the robot system [2, 3, 5]. A myopic robot has limited visibility, i.e., it can take a snapshot only within a certain fixed distance. In this talk, we consider myopic robots with lights as a more realistic model and briefly show some recent results on the model.","PeriodicalId":335477,"journal":{"name":"Proceedings of the 22nd International Conference on Distributed Computing and Networking","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124926490","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

Certification of an Exact Worst-Case Self-Stabilization Time 精确的最坏情况自稳定时间的认证

Proceedings of the 22nd International Conference on Distributed Computing and Networking Pub Date : 2020-12-25 DOI: 10.1145/3427796.3427832

K. Altisen, P. Corbineau, Stéphane Devismes

引用次数: 1

Early Classification Approaches for Sensors Generated Multivariate Time Series with Different Challenges 具有不同挑战的传感器多变量时间序列早期分类方法

Proceedings of the 22nd International Conference on Distributed Computing and Networking Pub Date : 2020-12-25 DOI: 10.1145/3427796.3430001

Ashish Gupta, Hari Prabhat Gupta, Bhaskar Biswas

{"title":"Early Classification Approaches for Sensors Generated Multivariate Time Series with Different Challenges","authors":"Ashish Gupta, Hari Prabhat Gupta, Bhaskar Biswas","doi":"10.1145/3427796.3430001","DOIUrl":"https://doi.org/10.1145/3427796.3430001","url":null,"abstract":"Early classification of Multivariate Time Series (MTS) that generated from sensors, has received a great attention as it has potential to solve time-critical problems of many areas including healthcare, industries, and intelligent transportation. A time series is also called as component if it is part or dimension of MTS. Unlike the existing work on early classification, this work considers following major challenges of MTS: 1) different length components, 2) faulty components, and 3) presence of unknown (unseen) class labels. We proposed different approaches for addressing these challenges of MTS in the framework of early classification. We also demonstrated the effectiveness of the approaches for the real-world applications such as road surface classification, human activity classification, and identification of faults in the washing machines. The experimental results showed that the proposed early classification approaches can achieve significant earliness with a marginal compromise of accuracy. Currently, we are working on the early classification of network applications such as Youtube, Firefox, and Skype, using the traffic flow of packets.","PeriodicalId":335477,"journal":{"name":"Proceedings of the 22nd International Conference on Distributed Computing and Networking","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115235597","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}

引用次数: 0

Processing Distributed Transactions in a Predefined Order 以预定义的顺序处理分布式事务

Proceedings of the 22nd International Conference on Distributed Computing and Networking Pub Date : 2020-12-25 DOI: 10.1145/3427796.3427819

Pavan Poudel, Shishir Rai, Gokarna Sharma

{"title":"Processing Distributed Transactions in a Predefined Order","authors":"Pavan Poudel, Shishir Rai, Gokarna Sharma","doi":"10.1145/3427796.3427819","DOIUrl":"https://doi.org/10.1145/3427796.3427819","url":null,"abstract":"Consider distributed transactional memory systems where transactions residing at nodes of a communication graph operate on shared, mobile objects. A transaction requests the objects it needs, executes once those objects have been assembled, and then forwards those objects to other waiting transactions. We study the predefined order scheduling problem of committing transactions according to their priorities. This problem naturally arises in areas, such as loop parallelization and state-machine-based computing, where producing executions equivalent to a priority order is needed to satisfy certain properties. Specifically, we study predefined order scheduling considering two performance metrics fundamental to any distributed system: (i) execution time - total time to commit all the transactions and (ii) communication cost - the total distance messages travel. We design scheduling algorithms that are simultaneously efficient for both the metrics and rigorously evaluate them through several benchmarks on random and grid graphs, validating their efficiency. To the best of our knowledge, this is the first study of predefined order scheduling in distributed systems.","PeriodicalId":335477,"journal":{"name":"Proceedings of the 22nd International Conference on Distributed Computing and Networking","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124532267","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}

引用次数: 3

Practical Experience Report: Cassandra+: Trading-Off Consistency, Latency, and Fault-tolerance in Cassandra 实践经验报告:Cassandra+:在Cassandra中权衡一致性、延迟和容错性

Proceedings of the 22nd International Conference on Distributed Computing and Networking Pub Date : 2020-12-25 DOI: 10.1145/3427796.3427816

Guo-Shu Gao, K. Konwar, Juan Mantica, Haochen Pan, D. Kish, Lewis Tseng, Zezhi Wang, Yingjian Wu

引用次数: 1

Network Decomposition and Distributed Derandomization 网络分解与分布式非随机化

Proceedings of the 22nd International Conference on Distributed Computing and Networking Pub Date : 2020-12-25 DOI: 10.1145/3427796.3433934

M. Ghaffari

引用次数: 2

Intelligent Reconfigurable Wideband Spectrum Characterization for 5G Applications 面向5G应用的智能可重构宽带频谱表征

Proceedings of the 22nd International Conference on Distributed Computing and Networking Pub Date : 2020-12-25 DOI: 10.1145/3427796.3430005

H. Joshi, S. Darak

{"title":"Intelligent Reconfigurable Wideband Spectrum Characterization for 5G Applications","authors":"H. Joshi, S. Darak","doi":"10.1145/3427796.3430005","DOIUrl":"https://doi.org/10.1145/3427796.3430005","url":null,"abstract":"3GPP 5G New Radios are expected to operate not only on the licensed bands but also on the unlicensed and shared bands. To process such a wideband spectrum, the base stations (BS) should be capable of characterizing the wideband spectrum. Moreover, since multi-antenna and beamforming are de-facto approaches in 5G, characterization of spectrum is desired over both time as well as spatial domains. In this research work, we develop an intelligent and reconfigurable architecture for non-contiguous wideband spectrum characterization (WSC) which involves the recovery of wideband band spectrum and the determination of occupancy status, carrier frequencies and direction of arrivals of the detected busy bands. Here, reconfigurability allows the BS to digitize selected non-contiguous frequency bands by performing sub-Nyquist sampling. Whereas intelligence allows the selection of desired frequency bands such that characterization failure does not occur. To check the applicability of the proposed WSC in the real radio environment, we also developed its NI-USRP based hardware prototype. This research work has found significant traction both with academia as well as industry given the multitude of use cases in 5G requiring efficient sensing and spectrum characterization for enhanced system operation.","PeriodicalId":335477,"journal":{"name":"Proceedings of the 22nd International Conference on Distributed Computing and Networking","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120958755","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}

引用次数: 0

Operator Data Driven Cell-Selection in LTE-LAA Coexistence Networks LTE-LAA共存网络中运营商数据驱动的小区选择

Proceedings of the 22nd International Conference on Distributed Computing and Networking Pub Date : 2020-12-25 DOI: 10.1145/3427796.3427818

Srikant Manas Kala, V. Sathya, Eitaro Yamatsuta, H. Yamaguchi, T. Higashino

{"title":"Operator Data Driven Cell-Selection in LTE-LAA Coexistence Networks","authors":"Srikant Manas Kala, V. Sathya, Eitaro Yamatsuta, H. Yamaguchi, T. Higashino","doi":"10.1145/3427796.3427818","DOIUrl":"https://doi.org/10.1145/3427796.3427818","url":null,"abstract":"Efficient cell-selection is essential to realize the gains in network performance promised by LTE Licensed Assisted Access (LAA) in the 5GHz unlicensed band. However, the SINR and transmission power based cell-selection mechanisms employed in LTE HetNets are not suited for LTE-LAA deployments. Further, the impact of cell-association on the performance of the LTE-LAA network and its individual components has not been studied through cellular-operator data. In this work, we address these challenges. We gather a large sample of LTE-LAA deployment data for three cellular operators in the Chicago region, i.e., AT&T, T-Mobile, and Verizon. With the help of operator data, we study the effect of cell-selection on LTE-LAA capacity and network feature relationships through several machine learning techniques. We demonstrate the impact of cell-selection on a combined LTE-LAA system and its licensed and unlicensed components. We show a direct correlation between a cell-quality metric derived from operator data and network performance. Finally, we implement two state-of-the-art cell-association and resource-allocation solutions to show that operator-data-driven cell-selection leads to reduced association time (by as much as 34.89%) and enhanced network capacity (by up to 90.41%).","PeriodicalId":335477,"journal":{"name":"Proceedings of the 22nd International Conference on Distributed Computing and Networking","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125599020","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 9

Optimal Exclusive Perpetual Grid Exploration by Luminous Myopic Opaque Robots with Common Chirality 具有共手性的发光近视不透明机器人的最优独占永久网格探索

Proceedings of the 22nd International Conference on Distributed Computing and Networking Pub Date : 2020-12-25 DOI: 10.1145/3427796.3427834

Quentin Bramas, P. Lafourcade, Stéphane Devismes

引用次数: 4