2023 32nd International Conference on Computer Communications and Networks (ICCCN)最新文献_第2页

Delay Fairness in 5G Networks with SD-RAN 基于SD-RAN的5G网络延迟公平性研究

2023 32nd International Conference on Computer Communications and Networks (ICCCN) Pub Date : 2023-07-01 DOI: 10.1109/ICCCN58024.2023.10230164

Fidan Mehmeti, W. Kellerer

{"title":"Delay Fairness in 5G Networks with SD-RAN","authors":"Fidan Mehmeti, W. Kellerer","doi":"10.1109/ICCCN58024.2023.10230164","DOIUrl":"https://doi.org/10.1109/ICCCN58024.2023.10230164","url":null,"abstract":"The possibility of decoupling the operation of control plane from data plane in RANs, which became possible with the introduction of Software-Defined Networks in 5G, brought a paradigm shift in cellular network operation. The key element that enables this is a centralized controller, located away from base stations. This yields increased flexibility in the functioning of cellular networks, resulting in considerable enhancements compared to classical pre-5G resource allocation approaches. However, so far the range these improvements span is known only in terms of throughput. The advantages in terms of other metrics and objectives, like delay fairness, are not yet known. Therefore, in this paper, we derive analytically the resource allocation policies that lead to different delay fairness definitions among the entities in an SD-RAN-enabled network and show the advantages compared to the classical pre-5G approaches. We do this for different scenarios. First, we consider the minimum potential delay fairness in the network. Then, we consider the min-max delay fairness among base stations, and also the min-max delay fairness among users. We evaluate performance extensively with input data from a dataset. The results indicate that the introduction of SD-RAN improves the objective value up to 6× compared to policies without SD-RAN.","PeriodicalId":132030,"journal":{"name":"2023 32nd International Conference on Computer Communications and Networks (ICCCN)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126868498","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

Improving Fairness of NDN Congestion Control from Resource Pooling Perspective 从资源池的角度提高NDN拥塞控制的公平性

2023 32nd International Conference on Computer Communications and Networks (ICCCN) Pub Date : 2023-07-01 DOI: 10.1109/ICCCN58024.2023.10230208

Kai Sakamoto, Yusaku Hayamizu, M. Yamamoto

引用次数: 0

How Can Equitable Peering be Achieved Between ISPs and Content Providers? 如何在互联网服务提供商和内容提供商之间实现公平对等?

2023 32nd International Conference on Computer Communications and Networks (ICCCN) Pub Date : 2023-07-01 DOI: 10.1109/ICCCN58024.2023.10230173

A. Nikkhah, S. Jordan

{"title":"How Can Equitable Peering be Achieved Between ISPs and Content Providers?","authors":"A. Nikkhah, S. Jordan","doi":"10.1109/ICCCN58024.2023.10230173","DOIUrl":"https://doi.org/10.1109/ICCCN58024.2023.10230173","url":null,"abstract":"Disagreements between Internet Service Providers (ISPs) and content providers over peering fees have risen to the level of potential government regulation. ISPs assert that content providers should pay peering fees based on the volume of downstream traffic. Content providers assert that consumers pay ISPs to transmit the content they request, and thus peering agreements should be settlement-free. We determine the fair peering fee between an ISP and a transit provider or content provider. We first consider cost sharing between an ISP and a transit provider. We derive the peering fee that equalizes their net backbone transportation costs. We illustrate how the peering fee depends on the traffic ratio and the amount of localization of that content. We then derive the peering fee between an ISP and a content provider that results in the same net cost to the ISP, and illustrate how the peering fee depends on the number of interconnection points and the amount of localization. We use these results to dispense with the ISP argument that they should be paid regardless of the amount of localization of content.","PeriodicalId":132030,"journal":{"name":"2023 32nd International Conference on Computer Communications and Networks (ICCCN)","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127810671","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

INSPIRE: Instance-Level Privacy-Pre Serving Transformation for Vehicular Camera Videos INSPIRE:车载摄像头视频的实例级隐私预服务转换

2023 32nd International Conference on Computer Communications and Networks (ICCCN) Pub Date : 2023-07-01 DOI: 10.1109/ICCCN58024.2023.10230162

Zhouyu Li, Ruozhou Yu, Anupam Das, Shaohu Zhang, Huayue Gu, Xiaojian Wang, Fangtong Zhou, Aafaq Sabir, Dilawer Ahmed, Ahsan Zafar

{"title":"INSPIRE: Instance-Level Privacy-Pre Serving Transformation for Vehicular Camera Videos","authors":"Zhouyu Li, Ruozhou Yu, Anupam Das, Shaohu Zhang, Huayue Gu, Xiaojian Wang, Fangtong Zhou, Aafaq Sabir, Dilawer Ahmed, Ahsan Zafar","doi":"10.1109/ICCCN58024.2023.10230162","DOIUrl":"https://doi.org/10.1109/ICCCN58024.2023.10230162","url":null,"abstract":"The wide spread of vehicular cameras has raised broad privacy concerns. Ubiquitous vehicular cameras capture bystanders like people or cars nearby without their awareness. To address privacy concerns, most existing works either blur out direct identifiers such as vehicle license plates and human faces, or obfuscate whole video frames. However, the former solution is vulnerable to re-identification attacks based on general features, and the latter severely impacts utility of the transformed videos. In this paper, we propose an INStance-level PrIvacy-pREserving (INSPIRE) video transformation framework for vehicular camera videos. INSPIRE leverages deep neural network models to detect and replace sensitive object instances in vehicular videos with their non-existent counterparts. We design INSPIRE as a modular framework to enable flexible customization of protected instance categories and their protection modules. An implementation of INSPIRE focused on protecting people and cars is described, which we tested on six re-identification datasets and three real-world vehicular video datasets to evaluate its privacy protection and utility preservation capability. Results show that INSPIRE can thwart 97% of re-identification attacks for people and cars while maintaining a 0.75 object detection mean average precision on transformed instances. We also demonstrate experimentally that INSPIRE is robust against model inversion attacks. Compared to solutions that provide comparable privacy protection, INSPIRE achieves relatively 1.76 times higher counting accuracy and 31.61% higher object detection mean average precision.","PeriodicalId":132030,"journal":{"name":"2023 32nd International Conference on Computer Communications and Networks (ICCCN)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131874696","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

On the Harmful Effects of Active Network Probing 论主动网络探测的有害影响

2023 32nd International Conference on Computer Communications and Networks (ICCCN) Pub Date : 2023-07-01 DOI: 10.1109/ICCCN58024.2023.10230205

Alamin Mohammed, Theo Karagioules, Emir Halepovic, Shangyue Zhu, A. Striegel

{"title":"On the Harmful Effects of Active Network Probing","authors":"Alamin Mohammed, Theo Karagioules, Emir Halepovic, Shangyue Zhu, A. Striegel","doi":"10.1109/ICCCN58024.2023.10230205","DOIUrl":"https://doi.org/10.1109/ICCCN58024.2023.10230205","url":null,"abstract":"Active network probing, commonly known as a speed test, is the prevalent network speed measurement and diagnostic method. Speed tests primarily measure achievable throughput by conducting bulk downloads that saturate the bottleneck link. However, the impact of speed tests on user Quality of Experience (QoE) has not been thoroughly explored. In this paper, we investigate the effects of active network probing on user QoE during two common activities: file downloading and video streaming, focusing on key QoE metrics such as download time, video bitrate, and buffering. Our analysis reveals that the standard speed test significantly extends download times (by up to 88% in WiFi and 46% in cellular networks) and adversely affects various video QoE metrics, particularly bitrate, resulting in an average bitrate reduction ranging from 46% to 60%. Moreover, we assess the outcomes of typical speed test scenarios, such as single and double tests, and establish that both variants impair QoE, with double tests causing greater disruptions. Our findings offer a comprehensive insight into the ramifications of active network probing on user applications and emphasize the necessity for approaches to alleviate its detrimental effects on QoE.","PeriodicalId":132030,"journal":{"name":"2023 32nd International Conference on Computer Communications and Networks (ICCCN)","volume":"279 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133848158","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

Cost-Effective Joint Establishment of Fronthaul and Virtual Base Stations in a Stochastic C-RAN 随机C-RAN中前传和虚拟基站的经济有效联合建立

2023 32nd International Conference on Computer Communications and Networks (ICCCN) Pub Date : 2023-07-01 DOI: 10.1109/ICCCN58024.2023.10230143

Yunyi Wu, Yongbing Zhang

{"title":"Cost-Effective Joint Establishment of Fronthaul and Virtual Base Stations in a Stochastic C-RAN","authors":"Yunyi Wu, Yongbing Zhang","doi":"10.1109/ICCCN58024.2023.10230143","DOIUrl":"https://doi.org/10.1109/ICCCN58024.2023.10230143","url":null,"abstract":"Cloud radio access network (CRAN) offers low-latency and high-speed services to mobile end-users by locating remote radio heads (RRHs) near end-users and centralizing the baseband units (BBUs) corresponding to the RRHs in a central cloud. However, considering the time-varying traffic loads, a self-adjustable base station (BS) can respond to changing traffic loads for meeting user demands is needed. This paper focuses on minimizing the cost of fronthaul establishment and bandwidth consumption in forming a self-adjustable virtual BS (VBS). Since the fronthaul is critical infrastructure of CRAN connecting BBUs and RRHs that affects the VBS formation but cannot be adjusted dynamically, we jointly consider their decision making and formulate it as a two-stage stochastic problem. Since this problem can be linearized to an integer linear program (ILP) but is difficult to solve given a large network scale, we propose an approach called FEBD inspired by Benders decomposition (BD) to achieve the optimal fronthaul connection. Furthermore, we propose a heuristic approach that can quickly adjust the VBS formation in response to user demand. The numerical experiments show that the combined use of FEBD and the heuristic approach provides results that are close to the ILP results with a significantly shorter computation time.","PeriodicalId":132030,"journal":{"name":"2023 32nd International Conference on Computer Communications and Networks (ICCCN)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129404678","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

Analysis of Evil Twin, Deauthentication, and Disassociation Attacks on Wi-Fi Cameras Wi-Fi摄像头的“邪恶孪生”、“去认证”和“解关联”攻击分析

2023 32nd International Conference on Computer Communications and Networks (ICCCN) Pub Date : 2023-07-01 DOI: 10.1109/ICCCN58024.2023.10230183

Z. Neal, Kewei Sha

引用次数: 0

Addressing Concept Drift of Dynamic Traffic Environments through Rapid and Self-Adaptive Bandwidth Allocation 通过快速自适应带宽分配解决动态业务环境的概念漂移

2023 32nd International Conference on Computer Communications and Networks (ICCCN) Pub Date : 2023-07-01 DOI: 10.1109/ICCCN58024.2023.10230123

Lihua Ruan, Elaine Wong

{"title":"Addressing Concept Drift of Dynamic Traffic Environments through Rapid and Self-Adaptive Bandwidth Allocation","authors":"Lihua Ruan, Elaine Wong","doi":"10.1109/ICCCN58024.2023.10230123","DOIUrl":"https://doi.org/10.1109/ICCCN58024.2023.10230123","url":null,"abstract":"Passive optical networks are envisioned to become increasingly complex as they support more and more diverse and immersive services that have different capacity, latency, and reliability needs. In the near term, they are expected to support the delivery of a diverse and immersive set of services including mixed reality, holographic communication, human-to-machine/robot communications, Tactile Internet, and digital sensing. However, in supporting these diverse and immersive services, traffic on the network will become increasingly dynamic across a range of different time scales. The upstream bandwidth in a passive optical network is typically shared by a group of end users, meaning that the uplink latency performance as experienced by each end user is thus highly dependent on the amount and when bandwidth to that end user is allocated. Machine learning enhanced bandwidth allocation algorithms have been proposed but are typically stationary, primarily-designed or pre-trained based on certain network configurations. In dynamic network conditions where traffic can evolve over time, concept drift, a phenomenon whereby the underlying distribution of the training data will no longer be representative of that in deployment, may occur. In view of future dynamic network conditions, we present a novel online reinforcement learning based bandwidth allocation scheme to address concept drift in machine learning enhanced passive optical network. The scheme facilitates self-adaptive decisions in real-time to accommodate dynamic network environments with varying traffic types and network loads. Results from comprehensive performance evaluation of the scheme show that rapid and self-adaptive bandwidth decisions can be achieved, yielding ~ 60% latency improvement in dynamic traffic environments.","PeriodicalId":132030,"journal":{"name":"2023 32nd International Conference on Computer Communications and Networks (ICCCN)","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127852224","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}

引用次数: 2

Underprovisioned GPUs: On Sufficient Capacity for Real-Time Mission-Critical Perception gpu供应不足:实时关键任务感知的足够容量

2023 32nd International Conference on Computer Communications and Networks (ICCCN) Pub Date : 2023-07-01 DOI: 10.1109/ICCCN58024.2023.10230127

Yigong Hu, Ila Gokarn, Shengzhong Liu, Archan Misra, T. Abdelzaher

{"title":"Underprovisioned GPUs: On Sufficient Capacity for Real-Time Mission-Critical Perception","authors":"Yigong Hu, Ila Gokarn, Shengzhong Liu, Archan Misra, T. Abdelzaher","doi":"10.1109/ICCCN58024.2023.10230127","DOIUrl":"https://doi.org/10.1109/ICCCN58024.2023.10230127","url":null,"abstract":"Recent work suggests that computing resources, such as GPUs in real-time edge-based perception systems, need not have sufficient capacity to keep up with the input frame rates of all input devices (e.g., cameras) at their full-frame resolution. Rather, they can be under-provisioned because only parts of any given frame need to be inspected (i.e., paid attention to). This paper derives an attention allocation policy, called canvas-based attention scheduling that decides which parts of each frame of each device to inspect, and a corresponding schedulability condition that relates the spatiotemporal properties of surrounding objects to the ability of the edge-based perception subsystem to keep up with the state of the environment in real-time. It provides a quantitative estimate of adequate computing capacity for the expected perception workload. We implement a canvas-based attention scheduler for an object detection application and perform an empirical comparative study based on actual GPU hardware and surveillance videos. Results show that canvas-based attention scheduling keeps up with the environment while using a much smaller GPU capacity, compared with prior approaches.","PeriodicalId":132030,"journal":{"name":"2023 32nd International Conference on Computer Communications and Networks (ICCCN)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116769364","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

ICCCN 2023 Workshop Program Overview ICCCN 2023研讨会计划概述

2023 32nd International Conference on Computer Communications and Networks (ICCCN) Pub Date : 2023-07-01 DOI: 10.1109/icccn58024.2023.10230148

引用次数: 0