Chaogang Tang, Chunsheng Zhu, Xianglin Wei, Qing Li, J. Rodrigues
{"title":"Task Caching in Vehicular Edge Computing","authors":"Chaogang Tang, Chunsheng Zhu, Xianglin Wei, Qing Li, J. Rodrigues","doi":"10.1109/INFOCOMWKSHPS51825.2021.9484498","DOIUrl":"https://doi.org/10.1109/INFOCOMWKSHPS51825.2021.9484498","url":null,"abstract":"Vehicular edge computing combines mobile edge computing with vehicular ad hoc networks and endeavors to mitigate the workloads of vehicles. Inspired by the content-centric mobile edge caching, we in this paper propose a cache enabled task offloading in the vehicular edge computing in hope to jointly optimize the response delay and the energy consumption at the road side unit. To be specific, both the communication and computation models are refined and a greedy algorithm is then put forward to solve the optimization problem. Numeric results have shown the advantages of the algorithm with regards to response latency and energy consumption in comparison with other related strategies.","PeriodicalId":109588,"journal":{"name":"IEEE INFOCOM 2021 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129029442","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":"Can AoI and Delay be Minimized Simultaneously with Short-Packet Transmission?","authors":"Jie Cao, Xu Zhu, Yufei Jiang, Zhongxiang Wei","doi":"10.1109/INFOCOMWKSHPS51825.2021.9484518","DOIUrl":"https://doi.org/10.1109/INFOCOMWKSHPS51825.2021.9484518","url":null,"abstract":"Age of information (AoI) and delay are both critical performance metrics to enable emerging applications such as remote estimation and real-time control in factory automation. In particular, it remains an open question whether AoI and delay can be minimized simultaneously in short-packet transmission for factory automation etc., as they are affected by block length and update rate in a complex manner. Motivated by the open issue, we derive closed-form expressions and tight approximations for the average AoI and the average delay for a short-packet Last-Come First-Served system with the retransmission scheme and non-preemption policy. It is proved that there exists a strong tradeoff between AoI and delay with given block length, and that the two performance metrics can be minimized simultaneously with given status update rate. With the goal of minimizing delay and AoI simultaneously, the weighted sum of delay and AoI is formulated and proved to be convex with respect to block length and update rate, respectively. A low-complexity optimization algorithm is developed with the closed-form expression of the optimal update rate and optimal block length, whose performance approaches the Pareto boundary of the AoI-delay region.","PeriodicalId":109588,"journal":{"name":"IEEE INFOCOM 2021 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"45 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131356969","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":"Secure Decentralized Access Control Policy for Data Sharing in Smart Grid","authors":"Yadi Ye, Leyou Zhang, Y. Mu, Wenting You","doi":"10.1109/INFOCOMWKSHPS51825.2021.9484474","DOIUrl":"https://doi.org/10.1109/INFOCOMWKSHPS51825.2021.9484474","url":null,"abstract":"Smart grid has improved the security, efficiency of the power system and balanced the supply and demand by intelligent management, which enhanced stability and reliability of power grid. The key point to achieve them is real-time data and consumption data sharing by using fine-grained policies. But it will bring the leakage of the privacy of the users and the loss of data control rights of the data owner. The reported solutions can not give the best trade-off among the privacy protection, control over the data shared and confidentiality. In addition, they can not solve the problems of large computation overhead and dynamic management such as users’ revocation. This paper aims at these problems and proposes a decentralized attribute-based data sharing scheme. The proposed scheme ensures the secure sharing of data while removing the central authority and hiding user’s identity information. It uses attribute-based signcryption (ABSC) to achieve data confidentiality and authentication. Under this model, attribute-based encryption gives the access policies for users and keeps the data confidentiality, and the attribute-based signature is used for authentication of the primary ciphertext-integrity. It is more efficient than \"encrypt and then sign\" or \"sign and then encrypt\". In addition, the proposed scheme enables user’s revocation and public verifiability. Under the random oracle model, the security and the unforgeability against adaptive chosen message attack are demonstrated.","PeriodicalId":109588,"journal":{"name":"IEEE INFOCOM 2021 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126493433","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":"Achieving Variable 5G Uplink Bandwidth for IoT Applications","authors":"Yuxiang Lin, Jiamei Lv, Yi Gao, Wei Dong","doi":"10.1109/INFOCOMWKSHPS51825.2021.9484631","DOIUrl":"https://doi.org/10.1109/INFOCOMWKSHPS51825.2021.9484631","url":null,"abstract":"As video surveillance cameras and various sensors have reached near-universal adoption for IoT applications, the uplink bandwidth demands for cellular networks are diverse and growing fast. Due to the popularity of 5G devices and the increasing deployment of 5G infrastructure, 5G has become a promising technology to meet such uplink demands. However, existing 5G uplink strategies mainly consider the practical 5G coverage issues, and have not focused on meeting the heavy and variable uplink bandwidth demands in the IoT field. In this paper, through introductions on the flexible air interface configuration of 5G NR, we reveal the feasibility of achieving variable uplink bandwidth in 5G cellular networks. We then propose an uplink bandwidth adaptation approach to dynamically set the uplink to downlink time slot ratio through signaling messages for different uplink tasks. Preliminary evaluation results show that our approach can adapt well to the variable uplink throughput of a smart home application. We envision this paper as a brief primer on 5G uplink bandwidth adaptation for interested readers to develop 5G uplink strategies with high user experience.","PeriodicalId":109588,"journal":{"name":"IEEE INFOCOM 2021 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121031543","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":"Predicting Throughput of Cloud Network Infrastructure Using Neural Networks","authors":"Derek Phanekham, S. Nair, N. Rao, Mike Truty","doi":"10.1109/INFOCOMWKSHPS51825.2021.9484520","DOIUrl":"https://doi.org/10.1109/INFOCOMWKSHPS51825.2021.9484520","url":null,"abstract":"Throughput prediction of network infrastructures is an important aspect of capacity planning, scheduling, resource management, route selection and other network functions. In this paper, we describe throughput measurements collected over a network infrastructure that supports cloud computing spanning the globe. We train deep learning models to predict TCP throughput using these measurements, which show performance improvements with buffer tuning and parallel streams. We also compare the accuracy of machine learning and conventional methods in predicting both single thread and mutli-stream throughput in a public cloud environment.","PeriodicalId":109588,"journal":{"name":"IEEE INFOCOM 2021 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131504180","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":"Enabling Virtual Network Functions in Named Data Networking","authors":"Puming Fang, T. Wolf","doi":"10.1109/INFOCOMWKSHPS51825.2021.9484495","DOIUrl":"https://doi.org/10.1109/INFOCOMWKSHPS51825.2021.9484495","url":null,"abstract":"Virtual network functions, which are placed logically in the path of a network connection, implement important processing steps, such as content inspection, load balancing, etc. While these types of operations are well-understood in the context of the current, connection-oriented Internet architecture, it is unclear if and how such functions can be enabled in emerging architectures, such as Named Data Networking (NDN). In this paper, we argue that virtual network functions can provide benefits to NDN. We present a novel way to use transformations to names in NDN to invoke network functions. We show that network functions can be called either explicitly (e.g., by an end-system) or transparently by intermediate nodes (e.g., by an edge router). We believe that enabling virtual network functions significantly expands the capabilities of Named Data Networking.","PeriodicalId":109588,"journal":{"name":"IEEE INFOCOM 2021 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127654186","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":"A Consensus Protocol With Deterministic Finality","authors":"Yahya Hassanzadeh-Nazarabadi, Sanaz Taheri Boshrooyeh","doi":"10.1109/INFOCOMWKSHPS51825.2021.9484527","DOIUrl":"https://doi.org/10.1109/INFOCOMWKSHPS51825.2021.9484527","url":null,"abstract":"Proof-of-Validation (PoV) is a fair, immutable, and fully decentralized blockchain consensus protocol with an O(1) asymptotic message complexity. The original PoV proposal lacks deterministic finality, which guarantees that a valid block will not be revoked once it is committed to the blockchain. Supporting deterministic finality yields a fork-resistant blockchain. In this extended abstract, we pitch the architectural outline of our proposed Finalita, which is the extension of PoV that enables deterministic finality. Blockchains running with Finalita feature deterministic finality, in addition to all qualities supported by the original PoV.","PeriodicalId":109588,"journal":{"name":"IEEE INFOCOM 2021 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133725001","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}
Berat Can Senel, Maxime Mouchet, Justin Cappos, Olivier Fourmaux, T. Friedman, R. McGeer
{"title":"EdgeNet: the Global Kubernetes Cluster Testbed","authors":"Berat Can Senel, Maxime Mouchet, Justin Cappos, Olivier Fourmaux, T. Friedman, R. McGeer","doi":"10.1109/INFOCOMWKSHPS51825.2021.9484475","DOIUrl":"https://doi.org/10.1109/INFOCOMWKSHPS51825.2021.9484475","url":null,"abstract":"EdgeNet is a software-only distributed systems testbed in the family of PlanetLab. It is realized as a multitenant global Kubernetes cluster running on volunteered virtual machines. In this paper, we describe our modifications to Kubernetes which enable trusted execution with accountability on untrusted, volunteered hardware, user control of the placement of Kubernetes pods, and control of a global cluster from a single central head node.","PeriodicalId":109588,"journal":{"name":"IEEE INFOCOM 2021 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133907946","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":"Secrecy in Aerial Networking: a Stochastic Geometry Approach","authors":"Xian Liu","doi":"10.1109/INFOCOMWKSHPS51825.2021.9484516","DOIUrl":"https://doi.org/10.1109/INFOCOMWKSHPS51825.2021.9484516","url":null,"abstract":"Stochastic geometry has been widely applied to planar networking analysis. With the emergence of unmanned aerial vehicles, it is imperative to extend the SG facility to three-dimensional space. In this paper, an effort is made to combine secrecy analysis with UAV and 3D SG. One of the new features is the relaxation of integer path-loss exponents or their ratio. This is an inherent challenging issue. With the aid of Meijer’s G-function, a closed-form expression is derived for the probability of strictly positive secrecy capacity. Several numerical results are presented and discussed.","PeriodicalId":109588,"journal":{"name":"IEEE INFOCOM 2021 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133908575","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}
Bintia Keita, A. Srivastava, Fraida Fund, S. Panwar
{"title":"A controlled, reproducible, and extensible experiment for evaluating the impact of Tor latency","authors":"Bintia Keita, A. Srivastava, Fraida Fund, S. Panwar","doi":"10.1109/INFOCOMWKSHPS51825.2021.9484448","DOIUrl":"https://doi.org/10.1109/INFOCOMWKSHPS51825.2021.9484448","url":null,"abstract":"The Tor anonymity network is an essential protection for those living in oppressive regimes, who may be persecuted for their speech or other activities on the Internet. However, its usability is severely affected by high latency. Furthermore, because of the difficulty associated with conducting research evaluations on the Tor network, there has been insufficient research aimed at this problem. To address this, we develop a CloudLab profile that instantiates a private Tor testing network for easy, reproducible experimental evaluations on Tor. We demonstrate how to use this CloudLab profile to measure the page load time of selected web pages over a Tor network under different network conditions representative of typical Tor usage.","PeriodicalId":109588,"journal":{"name":"IEEE INFOCOM 2021 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133935992","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}