发布求助
文献互助 智能选刊 最新文献

2021 IEEE 46th Conference on Local Computer Networks (LCN)最新文献

筛选
英文 中文
Improved Monte Carlo Tree Search for Virtual Network Embedding 虚拟网络嵌入的改进蒙特卡罗树搜索
2021 IEEE 46th Conference on Local Computer Networks (LCN) Pub Date : 2021-10-01 DOI: 10.1109/lcn52139.2021.9524975
Maxime Elkael, Hind Castel-Taleb, B. Jouaber, Andrea Araldo, Massinissa Ait Aba
{"title":"Improved Monte Carlo Tree Search for Virtual Network Embedding","authors":"Maxime Elkael, Hind Castel-Taleb, B. Jouaber, Andrea Araldo, Massinissa Ait Aba","doi":"10.1109/lcn52139.2021.9524975","DOIUrl":"https://doi.org/10.1109/lcn52139.2021.9524975","url":null,"abstract":"In this paper, we consider the Virtual Network Embedding (VNE) problem for 5G networks slicing. This consists in optimally allocating multiple Virtual Networks (VN) on a substrate virtualized physical network while maximizing among others, resource utilization, maximum number of placed VNs and network operator's benefit. We solve the online version of the problem where slices arrive over time. We propose the use of the Nested Rollout Policy Adaptation (NRPA) algorithm, a variant of the well known Monte Carlo Tree Search (MCTS). Both algorithms learn by randomly simulating the embedding, but NRPA also learns how to perform better simulations over time. Performance analysis with different scenarios, show that NRPA improves acceptance and reward ratios (by up to 69% and 65%). We also show how a smart initialization of the learning process can help improve the results furthermore (up to a 12.5% increase of acceptance ratio).","PeriodicalId":222740,"journal":{"name":"2021 IEEE 46th Conference on Local Computer Networks (LCN)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133706852","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}
引用次数: 4
Optimal Placement of Recurrent Service Chains on Distributed Edge-Cloud Infrastructures 分布式边缘云基础设施上循环服务链的优化配置
2021 IEEE 46th Conference on Local Computer Networks (LCN) Pub Date : 2021-10-01 DOI: 10.1109/LCN52139.2021.9524997
A. Mahjoubi, J. Taheri, Karl-Johan Grinnemo, Shuiguang Deng
{"title":"Optimal Placement of Recurrent Service Chains on Distributed Edge-Cloud Infrastructures","authors":"A. Mahjoubi, J. Taheri, Karl-Johan Grinnemo, Shuiguang Deng","doi":"10.1109/LCN52139.2021.9524997","DOIUrl":"https://doi.org/10.1109/LCN52139.2021.9524997","url":null,"abstract":"By increasing the number of IoT-devices, cloud-computing faces challenges for some computation and time-sensitive applications. Edge-computing has emerged to enable IoT-devices offload their computation tasks. Offloading tasks is a complex and challenging issue. We propose a comprehensive model including user, edge and cloud layers for scheduling continuous offering of services. Furthermore, we modeled the tasks of service as recurrent (repetitive) with a given frequency. The service-placement problem is formulated as a Mixed-Integer Linear Programming problem that aims to minimize the total delay of all services. We solve the problem with CPLEX, and proposed four fast heuristics to find near-optimal solutions. We compared the results of our proposed heuristics with the result obtained with CPLEX, in terms of problem-solving speed and accuracy, as well as resource utilization of all nodes. The results show that two of our proposed heuristics produce near-optimal solutions in a fraction of the time taken by CPLEX.","PeriodicalId":222740,"journal":{"name":"2021 IEEE 46th Conference on Local Computer Networks (LCN)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127158922","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}
引用次数: 3
Less Is More: Choosing Fair Network Coding Parameters 少即是多:选择公平的网络编码参数
2021 IEEE 46th Conference on Local Computer Networks (LCN) Pub Date : 2021-10-01 DOI: 10.1109/lcn52139.2021.9525026
Stefanie Thieme, Bertram Schütz, N. Aschenbruck
{"title":"Less Is More: Choosing Fair Network Coding Parameters","authors":"Stefanie Thieme, Bertram Schütz, N. Aschenbruck","doi":"10.1109/lcn52139.2021.9525026","DOIUrl":"https://doi.org/10.1109/lcn52139.2021.9525026","url":null,"abstract":"TCP still is the prevailing transport protocol on the Internet. It does, however, suffer from severe performance issues on links with non-congestion losses. Instead of relying on the RTT-sensitive ARQ mechanism of TCP, network coding (NC) uses linear combinations of packets to correct forward erasures. Several approaches were developed to incorporate NC into TCP. While they are able to improve the offered service, their lack of deployability and fairness in modern environments is not desirable. To mitigate this, we propose TCPyNC, a Python-based intra-session NC user space shim layer for TCP. Not only are its gains equally high, but it is also more flexible regarding the use of TCP options and parameters. We use a numerical analysis and a testbed evaluation to determine parameters that enable a fair use of TCP in conjunction with Forward Erasure Correction (FEC). In order to reach this goal, we found the maxim less is more to be a sensible orientation. For scenarios with 10% random loss, instead of choosing a high redundancy rate and a large generation size in order to gain the best loss reduction, choosing redundancy rates that leave between 1% and 6% loss for TCP’s ARQ to correct and generation sizes below 32 when using default TCP parameters, yields fair results.","PeriodicalId":222740,"journal":{"name":"2021 IEEE 46th Conference on Local Computer Networks (LCN)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129479270","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
Progressive Mesh-based HTTP Adaptive Augmented Reality Streaming System 基于渐进式网格的HTTP自适应增强现实流系统
2021 IEEE 46th Conference on Local Computer Networks (LCN) Pub Date : 2021-10-01 DOI: 10.1109/LCN52139.2021.9524992
Hyunmin Noh, Gi Seok Park, Hwangjun Song
{"title":"Progressive Mesh-based HTTP Adaptive Augmented Reality Streaming System","authors":"Hyunmin Noh, Gi Seok Park, Hwangjun Song","doi":"10.1109/LCN52139.2021.9524992","DOIUrl":"https://doi.org/10.1109/LCN52139.2021.9524992","url":null,"abstract":"This work presents a progressive mesh-based HTTP adaptive augmented reality (AR) streaming system that provides high quality AR streaming services with low latency over a time-varying wireless network. In the proposed system, a progressive mesh is employed to support the scalability of AR streaming services, a novel meta-file is proposed to efficiently provide the rate and view-dependent quality information. By using this meta-file, the proposed system determines the next request chunk to enhance human visual perceptual quality considering the view-dependent projected images of AR objects on the screen. The proposed system is realized using open sources (e.g., Android, OpenCV, OpenGL, and Nexus). Finally, experimental results are given to verify the performance improvement of the proposed system.","PeriodicalId":222740,"journal":{"name":"2021 IEEE 46th Conference on Local Computer Networks (LCN)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129347755","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
Virtual Framework for Development and Testing of Federation Software Stack 联邦软件栈开发与测试的虚拟框架
2021 IEEE 46th Conference on Local Computer Networks (LCN) Pub Date : 2021-10-01 DOI: 10.1109/LCN52139.2021.9524993
Anees Al-Najjar, N. Rao, N. Imam, T. Naughton, Seth D. Hitefield, Lawrence Sorrillo, J. Kohl, W. Elwasif, J. Bilheux, H. Bilheux, Swen Boehm, Jason Kincl
{"title":"Virtual Framework for Development and Testing of Federation Software Stack","authors":"Anees Al-Najjar, N. Rao, N. Imam, T. Naughton, Seth D. Hitefield, Lawrence Sorrillo, J. Kohl, W. Elwasif, J. Bilheux, H. Bilheux, Swen Boehm, Jason Kincl","doi":"10.1109/LCN52139.2021.9524993","DOIUrl":"https://doi.org/10.1109/LCN52139.2021.9524993","url":null,"abstract":"Softwarization of networked infrastructures combined with containerization of codes promises unprecedented computing capabilities distributed across the federations of computing systems and physical instruments. The development and testing of a software stack that implements these capabilities over an expensive physical production infrastructure is not cost-effective, and in the early stages, may potentially cause service disruptions. To address these aspects, we develop the Virtual Federated Science Instrument Environment (VFSIE), a digital twin of the physical infrastructure that emulates a multi-site federation. Each federated site is emulated using containers and virtual hosts that are connected over local-area networks, and the sites, in turn, are connected over an emulated wide-area network. We describe the framework design and implementation details. We also illustrate its application by emulating a federation of four laboratories that use Jupyter Notebook for computations and the EPICS software system for instrument control.","PeriodicalId":222740,"journal":{"name":"2021 IEEE 46th Conference on Local Computer Networks (LCN)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127238995","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
Iterative Soft Decoding of Single Parity Check Convolutional Concatenated Code 单奇偶校验卷积级联码的迭代软解码
2021 IEEE 46th Conference on Local Computer Networks (LCN) Pub Date : 2021-10-01 DOI: 10.1109/lcn52139.2021.9524973
Junmei Chen, Hao Chen, Zongpeng Li
{"title":"Iterative Soft Decoding of Single Parity Check Convolutional Concatenated Code","authors":"Junmei Chen, Hao Chen, Zongpeng Li","doi":"10.1109/lcn52139.2021.9524973","DOIUrl":"https://doi.org/10.1109/lcn52139.2021.9524973","url":null,"abstract":"By establishing a single parity check relationship between convolutional codewords, a concatenated code, termed single parity check convolutional code (SPC-CC), is proposed. By jointly en/decoding the SPC and CC, as well as carefully allocating redundant information between the pair, we can improve BER more promptly during iterative decoding. Each codeword in SPC-CC consists of only one SISO decoder, which generates one extrinsic information. The key is to simulate another using extrinsic information from other decoders. Then iteratively feed back extrinsic information to each other in a manner similar to a Turbo engine. We design en/decoding scheme of the SPC-CC, and then analyze its performance and complexity. Simulation results show that SPC-CC can effectively improve communication reliability with a moderate complexity. In addition, thanks to SPC code, SPC-CC can correct packet erasures due to fading or interference.","PeriodicalId":222740,"journal":{"name":"2021 IEEE 46th Conference on Local Computer Networks (LCN)","volume":"221 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122514353","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
KDST: K-Anonymous Node Discovery Using Separation of Trust 使用信任分离的k -匿名节点发现
2021 IEEE 46th Conference on Local Computer Networks (LCN) Pub Date : 2021-10-01 DOI: 10.1109/LCN52139.2021.9524963
Ali Kabeel, Amr H. El Mougy
{"title":"KDST: K-Anonymous Node Discovery Using Separation of Trust","authors":"Ali Kabeel, Amr H. El Mougy","doi":"10.1109/LCN52139.2021.9524963","DOIUrl":"https://doi.org/10.1109/LCN52139.2021.9524963","url":null,"abstract":"The cybersecurity community has always sought low-latency high-throughput anonymous systems. A common problem between all approaches to the problem of anonymity is the discovery process of an anonymous path between the sender and receiver. Currently, the most robust model for anonymous path discovery is TOR directory servers. Despite being distributed, TOR directory servers force clients to expose themselves to a potentially malicious directory. In this paper, we present KDST (K-Anonymous Node Discovery Using Separation of Trust), a model that provides a methodology to have true anonymous path discovery. The model is based on the separation of trust, and thus exposing the client would require full compromise of the system. Even with a fully compromised system, our approach incorporates K-anonymity to frustrate such de-anonymization attacks. We implement our model and assess its performance and security. Our analysis shows that KDST is very effective in solving the problem of anonymous node discovery.","PeriodicalId":222740,"journal":{"name":"2021 IEEE 46th Conference on Local Computer Networks (LCN)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125183636","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
DEMONS: Extended Manufacturer Usage Description to Restrain Malicious Smartphone Apps 恶魔:扩展制造商使用描述，以限制恶意智能手机应用程序
2021 IEEE 46th Conference on Local Computer Networks (LCN) Pub Date : 2021-10-01 DOI: 10.1109/lcn52139.2021.9524879
I. Fink, Martin Serror, Klaus Wehrle
{"title":"DEMONS: Extended Manufacturer Usage Description to Restrain Malicious Smartphone Apps","authors":"I. Fink, Martin Serror, Klaus Wehrle","doi":"10.1109/lcn52139.2021.9524879","DOIUrl":"https://doi.org/10.1109/lcn52139.2021.9524879","url":null,"abstract":"The growing popularity of the consumer IoT intensifies the risks for security and privacy breaches. It typically suffices to successfully attack a single IoT device to access the home network illicitly. This observation emphasizes the need for in-network security, complementing each device’s security mechanisms with additional network-layer protection. Recently, the IETF proposed Manufacturer Usage Description (MUD) to limit network traffic of IoT devices to their required minimum. However, the tangled communication of IoT devices, e.g., connections to smartphones and smart speakers, is not covered by MUD. We propose Distributed Enforcement of MUD on Smartphones (DEMONS), extending central enforcement of MUD with distributed enforcement at authenticated smartphones to mitigate the threats of malicious apps and IoT devices by filtering malicious traffic close to its origin and preventing further spread. We discuss the security gains and demonstrate that the introduced overhead regarding latency, bandwidth, and power consumption has a negligible performance impact.","PeriodicalId":222740,"journal":{"name":"2021 IEEE 46th Conference on Local Computer Networks (LCN)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132135077","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
Low-Cost Search in Tree-Structured P2P Overlays: The Null-Balance Benefit 树结构P2P覆盖中的低成本搜索:零平衡的好处
2021 IEEE 46th Conference on Local Computer Networks (LCN) Pub Date : 2021-10-01 DOI: 10.1109/LCN52139.2021.9525004
Peter Detzner, Jana Gödeke, Steffen Bondorf
{"title":"Low-Cost Search in Tree-Structured P2P Overlays: The Null-Balance Benefit","authors":"Peter Detzner, Jana Gödeke, Steffen Bondorf","doi":"10.1109/LCN52139.2021.9525004","DOIUrl":"https://doi.org/10.1109/LCN52139.2021.9525004","url":null,"abstract":"Peer-to-Peer (P2P) networks are one way to create large-scale distributed systems. A single peer has only a limited view on other peers. Thus, efficient searching for other peers or their content is a key performance indicator. In this paper, we investigate the search efficiency in an m-ary tree-structured P2P overlay. While previous work aimed for balancing the maximum height of a node's sub-trees, we show that keeping the height balanced throughout the overall network – a property called null-balance – will increase search performance considerably. Simulations using the ns-3 discrete-event simulator show 50% better performance w.r.t. required routing hops in these null-balanced trees. Therefore, we develop algorithms that keep a tree null-balanced if a node joins or departures. I.e., we prevent the need for restructuring. As we show, the cost of our efficient structure-preserving algorithms is easily set off by a relatively small number of search operations.","PeriodicalId":222740,"journal":{"name":"2021 IEEE 46th Conference on Local Computer Networks (LCN)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134550944","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}
引用次数: 3
Distributed Task Migration Optimization in MEC by Deep Reinforcement Learning Strategy 基于深度强化学习策略的MEC分布式任务迁移优化
2021 IEEE 46th Conference on Local Computer Networks (LCN) Pub Date : 2021-10-01 DOI: 10.1109/LCN52139.2021.9524987
Yu-ya Cui, De-gan Zhang, Jie Zhang, Ting Zhang, Lixiang Cao, Lu Chen
{"title":"Distributed Task Migration Optimization in MEC by Deep Reinforcement Learning Strategy","authors":"Yu-ya Cui, De-gan Zhang, Jie Zhang, Ting Zhang, Lixiang Cao, Lu Chen","doi":"10.1109/LCN52139.2021.9524987","DOIUrl":"https://doi.org/10.1109/LCN52139.2021.9524987","url":null,"abstract":"Mobile management is a challenging technology in Mobile Edge Computing (MEC). When the device is moving, computation tasks need to be dynamically migrated between multiple edge servers to maintain service continuity. This paper proposes a migration optimization of distributed task in MEC by deep reinforcement learning solution to optimize delay. In Multi-agent Deep Reinforcement Learning (MADRL), we construct an adaptive weight deep deterministic policy gradient (AWDDPG) algorithm to optimize the migration cost and service delay, and adopt centralized training and distributed execution to solve the high-dimensional problem. Experiments show that our algorithm greatly reduces the service delay compared with the related algorithms.","PeriodicalId":222740,"journal":{"name":"2021 IEEE 46th Conference on Local Computer Networks (LCN)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114576920","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}
引用次数: 3
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信
小红书