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

Communication Costs in a Geometric Communication Network 几何通信网络中的通信代价

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

Sima Hajiaghaei Shanjani, Valerie King

引用次数: 0

Poster: Twins, a Middleware for Adaptive Streaming Provenance at the Edge 海报:Twins，边缘自适应流来源的中间件

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

Mikael Gordani Shahri, A. Erlandsson, Dimitris Palyvos-Giannas, Vincenzo Gulisano

引用次数: 0

MILP-Based Charging and Route Selection of Electric Vehicles in Smart Grid 基于milp的智能电网电动汽车充电与路径选择

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

A. Yadav, J. Mukherjee

{"title":"MILP-Based Charging and Route Selection of Electric Vehicles in Smart Grid","authors":"A. Yadav, J. Mukherjee","doi":"10.1145/3427796.3427820","DOIUrl":"https://doi.org/10.1145/3427796.3427820","url":null,"abstract":"Widely accepted as an eco-friendly alternative to conventional vehicles, electric vehicles (EVs), however, have a limitation, such as a charging schedule is necessary for its journey since overloading at a charging station may cause grid failure. Also, despite the current advancement in technology, the battery capacity of EVs is still limited, which affects the cruise range of the vehicles, and it can be solved by en route charging of EVs. However, the charging rate may vary across different public charging stations. This may motivate electric vehicle owners to follow a route that is different from the traditional shortest route. In this paper, we consider a joint charging and route optimization problem, where a transport operator has a number of EVs at a warehouse, and he/she is supposed to deliver certain goods or services to different delivery locations. We have proposed two mixed-integer linear programming (MILP) models, where the delivery locations are first distributed among the EVs, and second, routes for the EVs are determined that minimizes the total travel time, while charging on the route. We prove that the problem is NP-complete. Detailed simulation has been carried out on a realistic dataset [4][19], and solved using the commercial solver CPLEX, and IBM’s drop-solved platform. The results show that an even distribution of delivery locations among EVs along with their partial charging at different charging stations en route proves to be a useful model for fast delivery of services/goods while minimizing their total travel time.","PeriodicalId":335477,"journal":{"name":"Proceedings of the 22nd International Conference on Distributed Computing and Networking","volume":"51 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":"131983937","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

A new Reconfigurable Filtered-OFDM Based L-Band Digital Aeronautical Communication System for Next Generation Air to Ground Communication 一种新的基于可重构滤波ofdm的l波段数字航空通信系统，用于下一代地空通信

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

N. Agrawal

引用次数: 0

P4Fuzz: Compiler Fuzzer forDependable Programmable Dataplanes P4Fuzz:可编程数据平面的编译器Fuzzer

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

Andrei-Alexandru Agape, Madalin Claudiu Danceanu, René Rydhof Hansen, S. Schmid

{"title":"P4Fuzz: Compiler Fuzzer forDependable Programmable Dataplanes","authors":"Andrei-Alexandru Agape, Madalin Claudiu Danceanu, René Rydhof Hansen, S. Schmid","doi":"10.1145/3427796.3427798","DOIUrl":"https://doi.org/10.1145/3427796.3427798","url":null,"abstract":"Emerging software-defined networks and programmable dataplanes promise to render communication networks more dependable, overcoming today’s manual and error-prone approach to operate networks. Indeed, programmable dataplanes such as P4 provide great opportunities for improving network performance and developing innovative security features, by allowing programmers to reconfigure and tailor switches towards their needs. However, extending programmability to the dataplane also introduces new threat models. In this paper, using a systematic security analysis, we identify a particularly worrisome vulnerability: the automated program compilers which lie at the core of programmable dataplanes. The dataplane compilers introduce a risk of persistent threats which are covert and hard to detect, and may be exploited for large-scale attacks, affecting many devices. Our main contribution is P4Fuzz, a compiler fuzzer to find bugs and vulnerabilities in P4 compilers, in an efficient and automated manner. We discuss the challenges involved in designing such a compiler fuzzer for P4, present our fuzzing and taming algorithms, and report on experiments with our prototype implementation, considering the standard compilers of BMv2, eBPF, and NetFPGA. Our experiments confirm that P4Fuzz is able to generate and test the validity of dozens of P4 programs per minute. Using P4Fuzz, we also successfully found several bugs which have been acknowledged and fixed by the community.","PeriodicalId":335477,"journal":{"name":"Proceedings of the 22nd International Conference on Distributed Computing and Networking","volume":"1 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":"128243397","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}

引用次数: 7

Proceedings of the 22nd International Conference on Distributed Computing and Networking 第22届分布式计算与网络国际会议论文集

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

引用次数: 1

Arbitrary Pattern Formation on Infinite Regular Tessellation Graphs 无限正则镶嵌图上任意图案的形成

Proceedings of the 22nd International Conference on Distributed Computing and Networking Pub Date : 2020-10-27 DOI: 10.1145/3427796.3427833

Serafino Cicerone, A. D. Fonso, G. Stefano, A. Navarra

引用次数: 25

DeHiDe: Deep Learning-based Hybrid Model to Detect Fake News using Blockchain✱ DeHiDe:基于深度学习的混合模型，在美国使用区块链检测假新闻

Proceedings of the 22nd International Conference on Distributed Computing and Networking Pub Date : 2020-10-17 DOI: 10.1145/3427796.3430003

Prashansa Agrawal, Parwat Singh Anjana, Sathya Peri

引用次数: 4

Self-Stabilizing Indulgent Zero-degrading Binary Consensus 自我稳定放纵零退化二元共识

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

Oskar Lundström, M. Raynal, E. Schiller

{"title":"Self-Stabilizing Indulgent Zero-degrading Binary Consensus","authors":"Oskar Lundström, M. Raynal, E. Schiller","doi":"10.1145/3427796.3427836","DOIUrl":"https://doi.org/10.1145/3427796.3427836","url":null,"abstract":"Guerraoui proposed an indulgent solution for the binary consensus problem. Namely, he showed that an arbitrary behavior of the failure detector never violates safety requirements even if it compromises liveness. Consensus implementations are often used in a repeated manner. Dutta and Guerraoui proposed a zero-degrading solution, i.e., during system runs in which the failure detector behaves perfectly, a node failure during one consensus instance has no impact on the performance of future instances. Our study, which focuses on indulgent zero-degrading binary consensus, aims at the design of an even more robust communication abstraction. We do so through the lenses of self-stabilization—a very strong notion of fault-tolerance. In addition to node and communication failures, self-stabilizing algorithms can recover after the occurrence of arbitrary transient faults; these faults represent any violation of the assumptions according to which the system was designed to operate (as long as the algorithm code stays intact). This work proposes the first, to the best of our knowledge, self-stabilizing algorithm for indulgent zero-degrading binary consensus for time-free message-passing systems prone to detectable process failures. The proposed algorithm has an stabilization time (in terms of asynchronous cycles) from arbitrary transient faults. Since the proposed solution uses an Ω failure detector, we also present the first, to the best of our knowledge, self-stabilizing asynchronous Ω failure detector, which is a variation on the one by Mostéfaoui, Mourgaya, and Raynal.","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-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130116588","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}

引用次数: 8

Fast Flexible Paxos: Relaxing Quorum Intersection for Fast Paxos 快速灵活Paxos:放松快速Paxos的仲裁交集

Proceedings of the 22nd International Conference on Distributed Computing and Networking Pub Date : 2020-08-06 DOI: 10.1145/3427796.3427815

H. Howard, Aleksey Charapko, R. Mortier

引用次数: 12