{"title":"Machine Learning for Aggregate Computing: a Research Roadmap","authors":"Gianluca Aguzzi, Roberto Casadei, Mirko Viroli","doi":"10.1109/ICDCSW56584.2022.00032","DOIUrl":"https://doi.org/10.1109/ICDCSW56584.2022.00032","url":null,"abstract":"Aggregate computing is a macro-approach for programming collective intelligence and self-organisation in distributed systems. In this paradigm, a single “aggregate program” drives the collective behaviour of the system, provided that the agents follow an execution protocol consisting of asynchronous sense-compute-act rounds. For actual execution, a proper aggregate computing middleware or platform has to be deployed across the nodes of the target distributed system, to support the services needed for the execution of applications. Overall, the engineering of aggregate computing applications is a rich activity that spans multiple concerns including designing the aggregate program, developing reusable algorithms, detailing the execution model, and choosing a deployment based on available infrastructure. Traditionally, these activities have been carried out through ad-hoc designs and implementations tailored to specific contexts and goals. To overcome the complexity and cost of manually tailoring or fixing algorithms, execution details, and deployments, we propose to use machine learning techniques, to automatically create policies for applications and their management. To support such a goal, we detail a rich research roadmap, showing opportunities and challenges of integrating aggregate computing and learning.","PeriodicalId":357138,"journal":{"name":"2022 IEEE 42nd International Conference on Distributed Computing Systems Workshops (ICDCSW)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123405615","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":"Decentralized Self-Adaption With Epidemic Algorithms for Agent-Based Transportation","authors":"S. Schmid, A. Harth","doi":"10.1109/ICDCSW56584.2022.00028","DOIUrl":"https://doi.org/10.1109/ICDCSW56584.2022.00028","url":null,"abstract":"We investigate epidemic algorithms to enable agent-based transporters to be self-adaptive to disturbances and avoid centralized communication mechanisms. We conduct simulation experiments of a shop floor to compare the ability of mobile agents with limited perception to deliver items and adapt to a randomly disturbed environment by communicating decentralized with epidemic algorithms, and centralized via blackboard and direct messages. For evaluation of their adaption, we measure their task performance and communication efficiency. We conclude that agent-based transportation with epidemic algorithms can self-adapt to a disturbed environment, can still perform close to centralized ones, and avoid monolithic components.","PeriodicalId":357138,"journal":{"name":"2022 IEEE 42nd International Conference on Distributed Computing Systems Workshops (ICDCSW)","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122084060","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}
João Monteiro, P. Costa, J. Leitao, Alfonso de la Rocha, Yiannis Psaras
{"title":"Enriching Kademlia by Partitioning","authors":"João Monteiro, P. Costa, J. Leitao, Alfonso de la Rocha, Yiannis Psaras","doi":"10.1109/ICDCSW56584.2022.00016","DOIUrl":"https://doi.org/10.1109/ICDCSW56584.2022.00016","url":null,"abstract":"Decentralizing the Web is becoming an increasingly interesting endeavor that aims at improving user security and privacy as well as providing guaranteed ownership of content. One such endeavor that pushes towards this reality, is Protocol Labs' Inter-Planetary File System (IPFS) network, that provides a decentralized large scale file system to support the decentralized Web. To achieve this, the IPFS network leverages the Kademlia DHT to route and store pointers to content stored by network members (i.e., peers). However, due to the large number of network peers, content, and accesses, the DHT routing needs to be efficient and quick to enable a decentralized web that is competitive. In this paper, we present work in progress that aims at improving the Kademlia DHT performance through the manipulation of DHT identifiers by adding prefixes to identifiers. With this, we are able to bias the DHT topological organization towards locality (which can be either geographical or applicational), which creates partitions in the DHT and enables faster and more efficient query resolution on local content. We designed prototypes that implement our proposal, and performed a first evaluation of our work in an emulated network testbed composed of 5000 nodes. Our results show that our proposal can benefit the DHT look up on data with locality with minimal overhead.","PeriodicalId":357138,"journal":{"name":"2022 IEEE 42nd International Conference on Distributed Computing Systems Workshops (ICDCSW)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130332998","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":"You Only Look & Listen Once: Towards Fast and Accurate Visual Grounding","authors":"Qing Du, Yucheng Luo","doi":"10.1109/ICDCSW56584.2022.00035","DOIUrl":"https://doi.org/10.1109/ICDCSW56584.2022.00035","url":null,"abstract":"Visual Grounding (VG) aims to locate the most relevant region in an image, based on a flexible natural language query but not a pre-defined label, thus it can be a useful technique in practice. Most methods in VG operate in a two-stage manner, wherein the first stage an object detector is adopted to generate a set of object proposals from the input image and the second stage is simply formulated as a cross-modal matching problem. There might be hundreds of proposals produced in the first stage that need to be compared in the second stage, which is infeasible for real-time VG applications, and the performance of the second stage may be affected by the first stage. In this paper, we propose a much more elegant one-stage detection based method that joints the region proposal and matching stage as a single detection network. The detection is conditioned on the input query with a stack of novel Relation-to-Attention modules that transform the image-to-query relationship to a relation map, which is used to predict the bounding box directly without proposing large numbers of useless region proposals. During the inference, our approach is about 20 x ~ 30 x faster than previous methods and, remarkably, it achieves comparable performance on several benchmark datasets.","PeriodicalId":357138,"journal":{"name":"2022 IEEE 42nd International Conference on Distributed Computing Systems Workshops (ICDCSW)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128997266","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":"Automatic and Personalized Sequencing of Music Playlists","authors":"M. Furini, M. Montangero","doi":"10.1109/ICDCSW56584.2022.00046","DOIUrl":"https://doi.org/10.1109/ICDCSW56584.2022.00046","url":null,"abstract":"Music playlists are appreciated by users, music artists and service providers for various reasons (i.e., no need to waste time choosing what to listen to, showcase to increase popularity, engage users to the provided services). However, despite their ever-increasing centrality, in literature there is no precise definition on how to produce them. Often, playlists are produced by music recommendation algorithms that focus on the songs selection process and don't give enough importance to songs sequencing. Indeed, until a few years ago the listening order was not considered important. In this paper, we address the songs sequencing problem in a novel way. Through dynamic programming, we transform a set of non-ordered songs into a user-tailored sequence of songs that meets the user's musical preferences. To the best of our knowledge, this approach has never been used in the literature.","PeriodicalId":357138,"journal":{"name":"2022 IEEE 42nd International Conference on Distributed Computing Systems Workshops (ICDCSW)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130951712","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":"Temperature Annealing Knowledge Distillation from Averaged Teacher","authors":"Xiaozhe Gu, Zixun Zhang, Tao Luo","doi":"10.1109/ICDCSW56584.2022.00034","DOIUrl":"https://doi.org/10.1109/ICDCSW56584.2022.00034","url":null,"abstract":"Despite the success of deep neural networks (DNNs) in almost every field, their deployment on edge devices has been restricted due to the significant memory and computational resource requirements. Among various model compression techniques for DNNs, Knowledge Distillation (KD) is a simple but effective one, which transfers the knowledge of a large teacher model to a smaller student model. However, as pointed out in the literature, the student is unable to mimic the teacher perfectly even when it has sufficient capacity. As a result, the student may not be able to retain the teacher's accuracy. What's worse, the student performance may be impaired by the wrong knowledge and potential over- regularization effect of the teacher. In this paper, we propose a novel method TAKDAT which is short for Temperature Annealing Knowledge Distillation from A veraged Teacher. Specifically, TAKDAT comprises of two con-tributions: 1) we propose to use an averaged teacher, which is an equally weighted average of model checkpoints traversed by SGD, in the distillation. Compared to a normal teacher, an averaged teacher provides richer similarity information and has less wrong knowledge; 2) we propose a temperature annealing scheme to gradually reduce the regularization effect of the teacher. Finally, extensive experiments verify the effectiveness of TAKDAT, e.g., it achieves a test accuracy of 74.31 % on CIFARI00 for ResNet32.","PeriodicalId":357138,"journal":{"name":"2022 IEEE 42nd International Conference on Distributed Computing Systems Workshops (ICDCSW)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132776358","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 Royal Game of Ur: A Digital Reproduction of an Ancient Sumerian Game","authors":"Mirko Franco, Marco Nardelotto, C. Palazzi","doi":"10.1109/ICDCSW56584.2022.00049","DOIUrl":"https://doi.org/10.1109/ICDCSW56584.2022.00049","url":null,"abstract":"The game industry is continuing to grow and users can enjoy this kind of products on diverse platforms (e.g., PC, game consoles, smartphones, tablets). While there are many developers working on modern game genres for pure entertainment, it is also interesting to exploit the attractiveness of games for serious purposes. To this aim, we have devised a mobile game able to merge the rediscovery of an ancient board game played by ancient Sumerians with the pleasure to play on mobile devices. The goal of the project is also to raise the interest of fourth graders in history, in particular in Sumerians, through the digital version of a game that was played thousands of years ago. Our game includes the possibility for teachers to add historical trivia shown to the players while using the application.","PeriodicalId":357138,"journal":{"name":"2022 IEEE 42nd International Conference on Distributed Computing Systems Workshops (ICDCSW)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131959756","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}
Haoqian Zhang, Louis-Henri Merino, Vero Estrada-Galiñanes, B. Ford
{"title":"Flash Freezing Flash Boys: Countering Blockchain Front-Running","authors":"Haoqian Zhang, Louis-Henri Merino, Vero Estrada-Galiñanes, B. Ford","doi":"10.1109/ICDCSW56584.2022.00026","DOIUrl":"https://doi.org/10.1109/ICDCSW56584.2022.00026","url":null,"abstract":"Front-running, the practice of benefiting from advanced knowledge of pending transactions, has proliferated in the cryptocurrency space with the emergence of decentralized finance. Front-running causes devastating losses to honest participants—estimated at $280M each month—and endangers the fairness of the ecosystem. We present Flash Freezing Flash Boys (F3B), an architecture to address front-running attacks by relying on a commit-and-reveal scheme where the contents of a transaction are encrypted and later revealed by a decentralized secret-management committee (SMC) when the transaction has been committed by the underlying consensus layer. To maintain legacy compatibility, we design F3B to be agnostic to the underlying consensus algorithm and compatible with existing smart contracts. A preliminary exploration of F3B shows that with a secret-management committee consisting of 8 and 128 members, F3B presents between 0.1 and 2.2 seconds of transaction-processing latency, respectively.","PeriodicalId":357138,"journal":{"name":"2022 IEEE 42nd International Conference on Distributed Computing Systems Workshops (ICDCSW)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129763752","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}
M. Usman, S. Basharat, H. Pervaiz, S. Hassan, Haejoon Jung
{"title":"On the BER Performance of RIS-Enhanced NOMA-Assisted Backscatter Communication under Nakagami-m Fading","authors":"M. Usman, S. Basharat, H. Pervaiz, S. Hassan, Haejoon Jung","doi":"10.1109/ICDCSW56584.2022.00039","DOIUrl":"https://doi.org/10.1109/ICDCSW56584.2022.00039","url":null,"abstract":"Backscatter communication (BackCom) has been envisioned as a prospective candidate for enabling the sustained operation of battery-constrained Internet-of- Things (IoT) devices. This approach involves the transmission of information by a backscatter node (BSN) through passive reflection and modulation of an impinging radio-frequency (RF) signal. However, the short operational range and low data rates of contemporary BackCom systems render them insufficient on their own to provide ubiquitous connectivity among the plethora of IoT devices. Meanwhile, wireless networks are rapidly evolving towards the smart radio paradigm. Thus, to enhance the coverage range and capacity, reconfigurable intelligent surfaces (RISs) can be incorporated into the existing BackCom systems. RISs employ passive reflective elements to adaptively configure the stochastic wireless environment in a cost-effective and energy- efficient manner. Furthermore, non-orthogonal multiple access (NOMA) can be exploited to improve the spectral efficiency of the BackCom systems. In this paper, we present the design and bit error rate (BER) analysis of an RIS-enhanced NOMA-assisted bistatic BackCom system under Nakagami-m fading channel. Our extensive simulation results reveal the effectiveness of the proposed system over the conventional NOMA-assisted BackCom system without RIS, and demonstrate the impact of various factors, including the power-reflection coefficients, RIS phase-shift designs, number of reflecting elements, RIS location, and split factor, on the BER performance of the proposed RIS-assisted system.","PeriodicalId":357138,"journal":{"name":"2022 IEEE 42nd International Conference on Distributed Computing Systems Workshops (ICDCSW)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127037573","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}