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

One-class Classification Using Autoencoder Feature Residuals for Improved IoT Network Intrusion Detection 基于自编码器残差的一类分类改进物联网网络入侵检测

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

B. Lewandowski, R. Paffenroth

引用次数: 0

SkABNet: A Data Structure for Efficient Discovery of Streaming Data for IoT SkABNet:高效发现物联网流数据的数据结构

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

Philipp Kisters, Heiko Bornholdt, Janick Edinger

{"title":"SkABNet: A Data Structure for Efficient Discovery of Streaming Data for IoT","authors":"Philipp Kisters, Heiko Bornholdt, Janick Edinger","doi":"10.1109/ICCCN58024.2023.10230169","DOIUrl":"https://doi.org/10.1109/ICCCN58024.2023.10230169","url":null,"abstract":"Applications in the Internet of Things often make use of large networks of independent sensor nodes that generate streams of volatile data. A major challenge in these decentralized networks is to efficiently discover relevant data providers, which might be characterized by properties such as their data type, location, or ownership. Most existing approaches use distributed data structures, such as distributed hash tables, for the organization of sensor nodes. However, these systems lack the ability to consider contextual properties when identifying relevant data sources. SkipNet a prominent architecture for data storage and retrieval, provides a scalable overlay network composed of doubly-linked rings. While the data structure allows to locate individual nodes in logarithmic complexity, it fails to identify groups of nodes that share similar characteristics. Thus, in this paper, we propose SkABNet, an attribute-based extension for SkipNet which enhances the semantics of the node identifiers in the network. We introduce additional operators that allow SkABNet to accept complex search queries including multi-attribute selections, ranges, and wildcards to find relevant data providers in its decentralized data structure. Further, we define a search algorithm that performs searches with significantly less messages than comparable searches in SkipNet.","PeriodicalId":132030,"journal":{"name":"2023 32nd International Conference on Computer Communications and Networks (ICCCN)","volume":"1 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":"129005609","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

Social Equality-Aware Resource Allocation for Post-Disaster Communication Restoration 基于社会公平的灾后通信恢复资源配置

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

Jianqing Liu, Shangjia Dong, Thomas Morris, Yuguang Fang

{"title":"Social Equality-Aware Resource Allocation for Post-Disaster Communication Restoration","authors":"Jianqing Liu, Shangjia Dong, Thomas Morris, Yuguang Fang","doi":"10.1109/ICCCN58024.2023.10230184","DOIUrl":"https://doi.org/10.1109/ICCCN58024.2023.10230184","url":null,"abstract":"Disasters are constant threats to humankind, and beyond losses in lives, they may cause many implicit yet profound societal issues such as wealth disparity and digital divide. Among those recovery measures in the aftermath of disasters, restoring communication services is of vital importance. Although existing works have proposed many architectural and protocol designs, none of them have taken human factors and social equality into consideration. Recent sociological studies have shown that people from marginalized groups (e.g., low income) are more vulnerable to communication outages. In this paper, we make efforts in integrating human factors – extracted from our collected dataset after Hurricane Harvey in 2017 in Texas, US – into an empirical optimization model to determine strategies for post-disaster communication restoration. We cast the design into a mix-integer non-linear programming problem, which captures the essential features of the design but is proven too complex to be solved. To find approximate solutions, we leverage a suite of convex relaxations and then develop heuristic algorithms to efficiently solve the transformed optimization problem. Based on our collected dataset, we further evaluate and demonstrate how our design could prioritize communication services for vulnerable people and promote social equality compared with an existing modeling benchmark.","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":"116256770","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

List of Reviewers for Workshops 研讨会评审人员名单

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

引用次数: 0

PAROS: The Missing “Puzzle” in Smart Home Router Operating Systems PAROS:智能家庭路由器操作系统中缺失的“谜题”

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

Keyang Yu, Dong Chen

{"title":"PAROS: The Missing “Puzzle” in Smart Home Router Operating Systems","authors":"Keyang Yu, Dong Chen","doi":"10.1109/ICCCN58024.2023.10230103","DOIUrl":"https://doi.org/10.1109/ICCCN58024.2023.10230103","url":null,"abstract":"The Internet of Things (IoT) devices have been increasingly deployed in smart homes for automation. Unfortunately, extensive recent research shows that external on-path adversaries can infer and fingerprint user sensitive in-home activities by analyzing IoT network traffic rates alone. Most recent traffic padding-based defending approaches cannot sufficiently protect user privacy with reasonable traffic overhead. In addition, these approaches typically assume the installation of additional hub hardware in smart homes to host their traffic padding-based defending approaches. To address these problems, we design a new open-source traffic reshaping system—privacy as a router operating system service (PAROS) that enables smart home users to significantly reduce private information leaked through IoT network traffic rates. PAROS does not assume the installation of any additional hardware device. We evaluate PAROS on open-source router Operating System (OS)—OpenWrt enabled virtual machine and also two real best-selling home routers. We find that PAROS can effectively prevent a wide range of state-of-the-art adversarial machine learning-based user in-home activity inference attacks, with near-zero system overhead increasing.","PeriodicalId":132030,"journal":{"name":"2023 32nd International Conference on Computer Communications and Networks (ICCCN)","volume":"28 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":"132963360","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

List of Reviewer by Tracks 按轨道列出的审阅者列表

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

引用次数: 0

A Self-Distributing System Framework for the Computing Continuum 计算连续体的自分布系统框架

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

Roberto Rodrigues Filho, Renato S. Dias, J. Serôdio, Barry Porter, Fábio M. Costa, E. Borin, L. Bittencourt

{"title":"A Self-Distributing System Framework for the Computing Continuum","authors":"Roberto Rodrigues Filho, Renato S. Dias, J. Serôdio, Barry Porter, Fábio M. Costa, E. Borin, L. Bittencourt","doi":"10.1109/ICCCN58024.2023.10230110","DOIUrl":"https://doi.org/10.1109/ICCCN58024.2023.10230110","url":null,"abstract":"Applications such as autonomous vehicles, virtual reality, augmented reality, and heavy machine learning-based applications are becoming popular and demanding more flexible deployment environments. The computing continuum, a hierarchical hybrid infrastructure comprehending user devices (smartphones, sensors, laptops, etc.), edge data centers, and cloud platforms, offers a wide range of deployment possibilities with a full range of varying computing resources. To take full advantage of such infrastructure, application development is faced with many challenges, the most important being the implementation of a transparent and generalized mechanism for code offloading and mobility throughout the continuum. To tackle such issues, this paper presents the Self-Distributing Systems (SDS) framework, a self-distribution framework that supports generalized code-offloading capabilities at the application level with a machine learning agent for deciding where to place components and a component-based model to enable seamless distribution of an application's components at runtime. We describe the framework, show its applicability in different application scenarios, and report our preliminary results. We conclude the paper with a list of challenges and invite the systems community to join the effort to further investigate them.","PeriodicalId":132030,"journal":{"name":"2023 32nd International Conference on Computer Communications and Networks (ICCCN)","volume":"64 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":"117334374","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

Traffic-Aware In-Network Aggregation Placement for Multi-Tenant Distributed Machine Learning 面向多租户分布式机器学习的流量感知网络聚合布局

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

H. Kim, Hochan Lee, Sangheon Pack

{"title":"Traffic-Aware In-Network Aggregation Placement for Multi-Tenant Distributed Machine Learning","authors":"H. Kim, Hochan Lee, Sangheon Pack","doi":"10.1109/ICCCN58024.2023.10230140","DOIUrl":"https://doi.org/10.1109/ICCCN58024.2023.10230140","url":null,"abstract":"Distributed machine learning is an effective method to alleviate intensive computation costs of training; however it suffers from network bottlenecks while gathering local results. Recent advent of programmable data planes opened a new avenue, in-network aggregation, which executes gradient aggregations in the middle of the network resolving network bottlenecks and further accelerates distributed machine learning. However, due to resource-constrained features of current programmable data planes, installation of in-network aggregation functionalities throughout the network would impose unacceptable burden, posing a need for sophisticated deployment. In this paper, we consider a problem of deploying in-network aggregation functionalities, so as to minimize the total network traffic in multi-tenant distributed machine learning. Since the formulated problem is an integer linear programming problem, which is known as NP-hard, we propose a traffic aware placement of in-network aggregation (TAPINA) algorithm with lower complexity and near-optimal performance. TAPINA decides aggregation points of multiple tenants sequentially in order of their expected traffics and reuses the already selected aggregation points by other tenants to reduce the overall deployment cost. Simulation results demonstrate that TAPINA shows near-optimal performance, achieving up to 20 % traffic reduction compared to the state-of-the-art algorithm in most cases.","PeriodicalId":132030,"journal":{"name":"2023 32nd International Conference on Computer Communications and Networks (ICCCN)","volume":"15 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":"127154382","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

List of Workshops/Program Chairs 研讨会/项目主席名单

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

引用次数: 0

Evaluating the Joint Use of Alternate Internet Delivery Models in Deterministic Rural Networks 评估在确定性农村网络中交替互联网交付模型的联合使用

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

Esther Max-Onakpoya, Corey E. Baker

{"title":"Evaluating the Joint Use of Alternate Internet Delivery Models in Deterministic Rural Networks","authors":"Esther Max-Onakpoya, Corey E. Baker","doi":"10.1109/ICCCN58024.2023.10230107","DOIUrl":"https://doi.org/10.1109/ICCCN58024.2023.10230107","url":null,"abstract":"Rural residents are often faced with the problem of expensive yet unreliable Internet connectivity. This coupled with the sparse population/business density, poses a detriment to the general development of such communities. In mitigating this disparity, some rural areas have adopted alternate Internet models to improve access to Internet services within their community. Such alternate models include communal access points, delay tolerant networks, and resource sharing networks. Thus, this work investigates the joint use of the aforementioned alternate Internet models for improving connectivity. Further, this work explores methods of routing time-dependent data in quasi-deterministic scenarios within these challenged rural environments. We formulate the routing problem as a maximum unsplittable multicommodity flow problem and propose an approximation algorithm. Using data representative of a rural Appalachian region, we evaluate our approximation algorithm and find that it performs close to optimal. We also propose a routing protocol based on our approximation algorithm. Using the same data, the results show that the proposed routing protocol performs comparably well with state-of-the-art routing protocols in delivering messages under time constraints. Additionally, the proposed routing protocol offers an overhead cost that is at least 3 times lower, on average, than other well-known routing protocols.","PeriodicalId":132030,"journal":{"name":"2023 32nd International Conference on Computer Communications and Networks (ICCCN)","volume":"22 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":"132071407","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