IEEE INFOCOM 2021 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)最新文献_第2页

Optimal Peak-Minimizing Online Algorithms for Large-Load Users with Energy Storage 基于储能的大负荷用户在线最优减峰算法

IEEE INFOCOM 2021 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2021-05-10 DOI: 10.1109/INFOCOMWKSHPS51825.2021.9484511

Yanfang Mo, Qiulin Lin, Minghua Chen, S. Qin

引用次数: 8

A Metric for Machine Learning Vulnerability to Adversarial Examples 机器学习对抗性例子脆弱性的度量

IEEE INFOCOM 2021 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2021-05-10 DOI: 10.1109/INFOCOMWKSHPS51825.2021.9484430

M. Bradley, Shengjie Xu

引用次数: 0

Zero trust using Network Micro Segmentation 零信任使用网络微分段

IEEE INFOCOM 2021 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2021-05-10 DOI: 10.1109/INFOCOMWKSHPS51825.2021.9484645

Nabeela I. Sheikh, M. Pawar, Victor Lawrence

引用次数: 6

A lightweight Compression-based Energy-Efficient Smart Metering System in Long-Range Network 基于轻量级压缩的远程网络节能智能计量系统

IEEE INFOCOM 2021 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2021-05-10 DOI: 10.1109/INFOCOMWKSHPS51825.2021.9484533

Preti Kumari, Hari Prabhat Gupta, Tanima Dutta

引用次数: 0

Demo Abstract: WLAN Standard-based Non-Coherent FSO Transmission over 100m Indoor and Outdoor Environments 摘要:基于WLAN标准的100m室内外非相干FSO传输

IEEE INFOCOM 2021 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2021-05-10 DOI: 10.1109/INFOCOMWKSHPS51825.2021.9484548

Jong-Min Kim, Ju-Hyung Lee, Young-Chai Ko

引用次数: 0

Quality Assessment of VANETs-Supported Video Dissemination of Critical Urban Events vanets支持的城市重大事件视频传播质量评估

IEEE INFOCOM 2021 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2021-05-10 DOI: 10.1109/INFOCOMWKSHPS51825.2021.9484551

Everaldo Andrade, F. Matos, P. D. Maciel, M. N. Lima, A. Santos

{"title":"Quality Assessment of VANETs-Supported Video Dissemination of Critical Urban Events","authors":"Everaldo Andrade, F. Matos, P. D. Maciel, M. N. Lima, A. Santos","doi":"10.1109/INFOCOMWKSHPS51825.2021.9484551","DOIUrl":"https://doi.org/10.1109/INFOCOMWKSHPS51825.2021.9484551","url":null,"abstract":"In the video transmission of critical urban events, e.g., heart attacks, supported by VANETs, intermittent connections, delays, packet losses, and the number of vehicles in collaboration naturally impair the dissemination of data, and hence affect the quality of received video at the destination. Crowdsensing solutions become a real option in helping to handle these events. In this paper, we evaluate the impact of the characteristics of urban VANETs on the human perception of the spatio-temporal context from monitored videos of critical events. We use the MINUET system to assess the quality of videos disseminated and delivered to city authorities, using QoS and QoE metrics, and under different traffic scenarios. Simulated results indicate the system achieves quality levels from satisfactory to good in most of the evaluated scenarios, i.e. average PSNR values between [25-40]dB and average SSIM values between [0.5-1]. In addition, even in adverse situations for detecting the event, video was delivered with a level of quality sufficient to recognize the event.","PeriodicalId":109588,"journal":{"name":"IEEE INFOCOM 2021 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"47 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":"114639863","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

Demo: AIML-as-a-Service for SLA management of a Digital Twin Virtual Network Service 演示:用于数字孪生虚拟网络服务SLA管理的AIML-as-a-Service

IEEE INFOCOM 2021 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2021-05-10 DOI: 10.1109/INFOCOMWKSHPS51825.2021.9484610

J. Baranda, J. Mangues‐Bafalluy, E. Zeydan, C. Casetti, C. Chiasserini, M. Malinverno, C. Puligheddu, M. Groshev, C. Guimarães, Konstantin Tomakh, D. Kucherenko, O. Kolodiazhnyi

引用次数: 6

Computing-aided Update for Information Freshness in the Internet of Things 基于计算的物联网信息更新

IEEE INFOCOM 2021 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2021-05-10 DOI: 10.1109/INFOCOMWKSHPS51825.2021.9484521

Minghao Fang, Xijun Wang, Chao Xu, H. Yang, Tony Q. S. Quek

{"title":"Computing-aided Update for Information Freshness in the Internet of Things","authors":"Minghao Fang, Xijun Wang, Chao Xu, H. Yang, Tony Q. S. Quek","doi":"10.1109/INFOCOMWKSHPS51825.2021.9484521","DOIUrl":"https://doi.org/10.1109/INFOCOMWKSHPS51825.2021.9484521","url":null,"abstract":"Age of information (AoI), a notion that measures the information freshness, is an important performance metric for real-time applications in Internet of Things (IoT). With the surge of computing resources at the IoT devices, it is possible to preprocess the information packets that contain the status update before sending them to the destination so as to lighten the transmission burden. However, the additional time and energy expenditure induced by computing also make the optimal updating a non-trivial problem. In this paper, we consider a real-time IoT monitoring system, where the computing-aided IoT device is capable of preprocessing the status update. A joint preprocessing and transmission policy is devised to minimize the average AoI at the destination and the energy consumption at the IoT device. Due to the difference in the processing rate and the transmission rate and the difference in the idle duration and the active duration, this problem is formulated as an average cost semi-Markov decision process (SMDP) and then transformed into a discrete-time Markov decision process (MDP). We show that the optimal policy is of threshold type with respect to the AoI. Equipped with this, a low-complexity relative policy iteration algorithm is proposed to obtain the optimal policy of the SMDP. Finally, simulation results demonstrate the optimal policy structure in different cases and show that the proposed policy outperforms two baseline policies.","PeriodicalId":109588,"journal":{"name":"IEEE INFOCOM 2021 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"67 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":"127626509","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

Support for Differentiated Airtime in Wireless Networks 支持无线网络中的差异化通话时间

IEEE INFOCOM 2021 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2021-05-10 DOI: 10.1109/INFOCOMWKSHPS51825.2021.9484546

Daniel J Kulenkamp, V. Syrotiuk

引用次数: 1

Disaster-Resilient Service Function Chain Embedding Based on Multi-Path Routing 基于多路径路由的容灾业务功能链嵌入

IEEE INFOCOM 2021 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2021-05-10 DOI: 10.1109/INFOCOMWKSHPS51825.2021.9484438

Sixu Cai, Fen Zhou, Zonghua Zhang, A. Meddahi

{"title":"Disaster-Resilient Service Function Chain Embedding Based on Multi-Path Routing","authors":"Sixu Cai, Fen Zhou, Zonghua Zhang, A. Meddahi","doi":"10.1109/INFOCOMWKSHPS51825.2021.9484438","DOIUrl":"https://doi.org/10.1109/INFOCOMWKSHPS51825.2021.9484438","url":null,"abstract":"By using virtualization technology, Network Function Virtualization (NFV) decouples the traditional Network Functions (NFs) from dedicated hardware, which allows the software to progress separately from the hardware. One of the major challenges for NFV deployment is to map Service Function Chains (SFCs), which are chains of sequenced Virtual Network Functions (VNFs), onto the physical network components. Meanwhile, network availability faces the threats of various natural disasters, one of which makes all network devices in the Disaster Zone (DZ) fail if it occurs. Thus, it is critical to establish an efficient disaster protection scheme for NFV deployment.In this paper, we introduce a novel disaster protection scheme for SFC embedding using multi-path routing. The major advantage of this scheme is to cut at least half of the reserved bandwidth on the backup path by balancing the SFC traffic load on multiple simultaneous DZ-disjoint working paths. The studied problem involves VNF entity placement, SFCs routing, content splitting and protection mechanisms. The objective is to minimize the network resource consumption, including bandwidth consumption for requests routing and computing resource for VNF execution. As we treat an optimization problem of multiple dimensions (i.e., NF placement, routing and protection), it is a challenging work to obtain the optimal solution. To this end, we propose a novel flow-based integer linear program (ILP) to model the SFC protection leveraging multi-path routing and the concept of layered graph. Numerical results demonstrate that our proposed multi-path based SFC protection strategy outperforms the traditional dedicated protection in terms of bandwidth and processing resources, saving up to 21.4% total network cost.","PeriodicalId":109588,"journal":{"name":"IEEE INFOCOM 2021 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"11 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":"134103648","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}

引用次数: 11