2022 IEEE International Symposium on Local and Metropolitan Area Networks (LANMAN)最新文献

筛选
英文 中文
Exploring Performance Limits on Proactive Fair Scheduling for mmWave WLANs 探讨毫米波无线局域网主动公平调度的性能限制
2022 IEEE International Symposium on Local and Metropolitan Area Networks (LANMAN) Pub Date : 2022-07-11 DOI: 10.1109/lanman54755.2022.9820446
Ang Deng, Yuchen Liu, D. Blough
{"title":"Exploring Performance Limits on Proactive Fair Scheduling for mmWave WLANs","authors":"Ang Deng, Yuchen Liu, D. Blough","doi":"10.1109/lanman54755.2022.9820446","DOIUrl":"https://doi.org/10.1109/lanman54755.2022.9820446","url":null,"abstract":"Although the millimeter wave (mmWave) band has great potential to address ever-increasing demands for wireless bandwidth, its intrinsically unique propagation characteristics call for different scheduling strategies in order to minimize performance drops caused by blockages. A promising approach to mitigate the blockage problem is proactive scheduling, which uses blockage predictions to schedule users when they are experiencing good channel conditions. In this paper, we formulate an optimal scheduling problem with fairness constraints that allows us to find a schedule with maximum aggregate rate that achieves approximately the same fairness as the classic proportional fair scheduler. The results show that, for the problem settings studied, up to around 30% increase in aggregate rate compared to classic proportional fair scheduling (PFS) is possible with no decrease in fairness when blockages can be accurately predicted 0.5 seconds in advance. Furthermore, aggregate rate could be doubled compared to PFS if blockages can be accurately predicted 5 seconds in advance. While these results demonstrate the very promising potential of proactive scheduling, we also discuss several future research directions that must be pursued to effectively realize the approach.","PeriodicalId":439508,"journal":{"name":"2022 IEEE International Symposium on Local and Metropolitan Area Networks (LANMAN)","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116978381","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
Experimenting an Edge-Cloud Computing Model on the GPULab Fed4Fire Testbed 边缘云计算模型在GPULab Fed4Fire测试台上的实验
2022 IEEE International Symposium on Local and Metropolitan Area Networks (LANMAN) Pub Date : 2022-07-11 DOI: 10.1109/lanman54755.2022.9820006
V. Tomer, Sachin Sharma
{"title":"Experimenting an Edge-Cloud Computing Model on the GPULab Fed4Fire Testbed","authors":"V. Tomer, Sachin Sharma","doi":"10.1109/lanman54755.2022.9820006","DOIUrl":"https://doi.org/10.1109/lanman54755.2022.9820006","url":null,"abstract":"There are various open testbeds available for testing algorithms and prototypes, including the Fed4Fire testbeds. This demo paper illustrates how the GPULAB Fed4Fire testbed can be used to test an edge-cloud model that employs an ensemble machine learning algorithm for detecting attacks on the Internet of Things (IoT). We compare experimentation times and other performance metrics of our model based on different characteristics of the testbed, such as GPU model, CPU speed, and memory. Our goal is to demonstrate how an edge-computing model can be run on the GPULab testbed. Results indicate that this use case can be deployed seamlessly on the GPULAB testbed.","PeriodicalId":439508,"journal":{"name":"2022 IEEE International Symposium on Local and Metropolitan Area Networks (LANMAN)","volume":"243 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122700646","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
ML-based Cellular Service Issue Troubleshooting Using Limited Ground Truth Data 基于ml的蜂窝服务问题故障排除使用有限的地面真实数据
2022 IEEE International Symposium on Local and Metropolitan Area Networks (LANMAN) Pub Date : 2022-07-11 DOI: 10.1109/lanman54755.2022.9820585
Xiaofeng Shi, Chen Qian, Amit Sheoran, Jia Wang
{"title":"ML-based Cellular Service Issue Troubleshooting Using Limited Ground Truth Data","authors":"Xiaofeng Shi, Chen Qian, Amit Sheoran, Jia Wang","doi":"10.1109/lanman54755.2022.9820585","DOIUrl":"https://doi.org/10.1109/lanman54755.2022.9820585","url":null,"abstract":"One of the key challenges faced by cellular network customer care agents is identifying if the service problem is caused by network-related issues or user-device-related issues. Some service providers [5], [6], therefore, employ machine learning-based troubleshooting frameworks to aid care agents in identifying the root cause of service problems experienced by users. However, obtaining large-scale and comprehensive ground truth troubleshooting result data is costly and requires tremendous manual efforts from networking operators. Due to this limitation, training such a machine learning (ML) model is rather challenging as the model can easily overfit to the limited available ground truth data. In this work, we propose a novel two-stage learning framework to improve the classification accuracy of ML-based troubleshooting frameworks. Our proposed framework uses resolution action taken by the care agent coupled with network/device data collected after the care call to infer accurate ground truth which is then used to train classification models.","PeriodicalId":439508,"journal":{"name":"2022 IEEE International Symposium on Local and Metropolitan Area Networks (LANMAN)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125328160","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
Service Mesh Controller for Cooperative Load Balancing among Neighboring Edge Servers 面向相邻边缘服务器协同负载均衡的服务网格控制器
2022 IEEE International Symposium on Local and Metropolitan Area Networks (LANMAN) Pub Date : 2022-07-11 DOI: 10.1109/lanman54755.2022.9820181
Toru Furusawa, Hiroshi Abe, Kazuya Okada, A. Nakao
{"title":"Service Mesh Controller for Cooperative Load Balancing among Neighboring Edge Servers","authors":"Toru Furusawa, Hiroshi Abe, Kazuya Okada, A. Nakao","doi":"10.1109/lanman54755.2022.9820181","DOIUrl":"https://doi.org/10.1109/lanman54755.2022.9820181","url":null,"abstract":"Edge computing for connected vehicles is expected to become a reality. Compared to public clouds, the computing resources available on individual edge servers are limited: therefore, dynamically allocating computing resources as needed based on load is effective for the efficient use of edge server resources, and the auto-scale functionality using containers and Kubernetes is widely used. However, if the edge servers are overloaded when requests exceed their maximum processing capacity, long response delays and service outages may occur. Cooperative load balancing among neighboring edge servers is known as a method to prevent edge servers from overload, but standard Kubernetes does not have a control function based on server location or distance between servers, making it difficult to implement this. This paper proposes a service mesh controller to achieve cooperative load balancing among neighboring edge servers in an environment where container execution infrastructure controlled by Kubernetes runs on edge servers. Experimental results show that the proposed method with the service mesh controller reduces the median of response time by 96.3% compared with a conventional method without load balancing while also preventing overloads.","PeriodicalId":439508,"journal":{"name":"2022 IEEE International Symposium on Local and Metropolitan Area Networks (LANMAN)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129528469","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
Distance Vector Routing in Partitioned Networks 分区网络中的距离矢量路由
2022 IEEE International Symposium on Local and Metropolitan Area Networks (LANMAN) Pub Date : 2022-07-11 DOI: 10.1109/lanman54755.2022.9820113
Ammar Farooq, Murat Yuksel
{"title":"Distance Vector Routing in Partitioned Networks","authors":"Ammar Farooq, Murat Yuksel","doi":"10.1109/lanman54755.2022.9820113","DOIUrl":"https://doi.org/10.1109/lanman54755.2022.9820113","url":null,"abstract":"We present a disconnection tolerant routing protocol, Binary State Distance Vector Routing (BSDVR), that can provide unicast routing on partitioned networks. BSDVR introduces binary state information for distance vector (DV) entries to compute unicast paths even if the network is partitioned. We compare BSDVR against the traditional DV routing (TDVR) in a controlled network. Our experiments confirm that BSDVR generates more control overhead during single link failures that do not cause partitions. In terms of partition-causing link failures, BSDVR’s control overhead is less than TDVR’s by an order of magnitude, leading to much better convergence times.","PeriodicalId":439508,"journal":{"name":"2022 IEEE International Symposium on Local and Metropolitan Area Networks (LANMAN)","volume":"195 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121685508","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
Access Control with Individual Key Delivery in ICN ICN中具有单独密钥交付的访问控制
2022 IEEE International Symposium on Local and Metropolitan Area Networks (LANMAN) Pub Date : 2022-07-11 DOI: 10.1109/lanman54755.2022.9820553
Yuma Fukagawa, N. Kamiyama
{"title":"Access Control with Individual Key Delivery in ICN","authors":"Yuma Fukagawa, N. Kamiyama","doi":"10.1109/lanman54755.2022.9820553","DOIUrl":"https://doi.org/10.1109/lanman54755.2022.9820553","url":null,"abstract":"Information-centric networking (ICN), which forwards request packet on the basis of the name of the content without using the Domain Name System (DNS) and caches data packets at routers, is attracting attention as a network architecture that efficiently delivers content such as Internet of Things (IoT) data. Certain content, e.g., paid content, can be obtained by limited users, and an access-control method for determining whether the requesting user can access is required when requesting this type of content. On the current Internet, request packets reach the servers of content providers using the authoritative DNS server of content providers, so access control is easily achieved at this server. However, in ICN, access control is difficult because data packets can return from routers, and request packets cannot always reach the hosts of content providers. We propose an access-control method with which request packets can always reach the host of content providers. The overhead traffic of key distribution was derived using simple analysis models and numerically compared with an existing access-control method. We confirm that the proposed method creates approximately 7 Gbytes of control overhead traffic per day, while the existing method with which a key is periodically distributed to all users creates at least 250 Gbytes of unauthorized traffic per day.","PeriodicalId":439508,"journal":{"name":"2022 IEEE International Symposium on Local and Metropolitan Area Networks (LANMAN)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116800702","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
THORP: Choosing Ordered Neighbors To Attain Efficient Loop-Free Minimum-Hop Routing THORP:选择有序邻居以获得有效的无环最小跳路由
2022 IEEE International Symposium on Local and Metropolitan Area Networks (LANMAN) Pub Date : 2022-07-11 DOI: 10.1109/lanman54755.2022.9820398
J. Garcia-Luna-Aceves
{"title":"THORP: Choosing Ordered Neighbors To Attain Efficient Loop-Free Minimum-Hop Routing","authors":"J. Garcia-Luna-Aceves","doi":"10.1109/lanman54755.2022.9820398","DOIUrl":"https://doi.org/10.1109/lanman54755.2022.9820398","url":null,"abstract":"We introduce THORP (Totally Hop-Ordered Routing Procedure), a simple distributed algorithm for minimum-hop routing that works in much the same way as traditional distance-vector routing algorithms do. THORP eliminates routing-table loops by having routers choose as their next hops to destinations those neighbor routers that are totally ordered based on their current distances, without requiring their next-hop routers to correspond necessarily to minimum-hop paths. THORP is shown to be loop-free, to converge to minimum-hop distances within a finite time, and to be faster than the Diffusing Update Algorithm (DUAL), which is the only loop-free shortest-path algorithm that has been used successfully in practice and is part of Cisco’s EIGRP.","PeriodicalId":439508,"journal":{"name":"2022 IEEE International Symposium on Local and Metropolitan Area Networks (LANMAN)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126095208","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
Designing a Double LoRa Connectivity for the Arduino Portenta H7 Arduino Portenta H7双LoRa连接设计
2022 IEEE International Symposium on Local and Metropolitan Area Networks (LANMAN) Pub Date : 2022-07-11 DOI: 10.1109/lanman54755.2022.9820092
D. Pino, Felix Freitag, Mennan Selimi
{"title":"Designing a Double LoRa Connectivity for the Arduino Portenta H7","authors":"D. Pino, Felix Freitag, Mennan Selimi","doi":"10.1109/lanman54755.2022.9820092","DOIUrl":"https://doi.org/10.1109/lanman54755.2022.9820092","url":null,"abstract":"Machine learning is moving to the smallest computing devices. Today machine learning is applied even in tiny IoT microcontroller boards. In the IoT, LoRa is a popular communication technology to connect remote devices with gateways. Still, the confluence of machine learning in microcontrollers and networked LoRa connectivity is not yet fully exploited. In this paper we design a new LoRa connectivity for the Arduino Portenta H7, a recent microcontroller board equipped with embedded sensors suitable for diverse machine learning tasks. With the solution that we found the Arduino Portenta H7 is able to become part of a LoRa mesh network. This capacity increases the Portenta’s range of applications. For the vision of distributed machine learning at the tiny edge, we can add with the Portenta an important board to become a smart compute node within a LoRa mesh network.","PeriodicalId":439508,"journal":{"name":"2022 IEEE International Symposium on Local and Metropolitan Area Networks (LANMAN)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128668663","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
LANMAN 2022 Cover Page LANMAN 2022封面
2022 IEEE International Symposium on Local and Metropolitan Area Networks (LANMAN) Pub Date : 2022-07-11 DOI: 10.1109/lanman54755.2022.9820104
{"title":"LANMAN 2022 Cover Page","authors":"","doi":"10.1109/lanman54755.2022.9820104","DOIUrl":"https://doi.org/10.1109/lanman54755.2022.9820104","url":null,"abstract":"","PeriodicalId":439508,"journal":{"name":"2022 IEEE International Symposium on Local and Metropolitan Area Networks (LANMAN)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115383130","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
Demonstrating Configuration of Software Defined Networking in Real Wireless Testbeds 演示软件定义网络在真实无线试验台的配置
2022 IEEE International Symposium on Local and Metropolitan Area Networks (LANMAN) Pub Date : 2022-07-11 DOI: 10.1109/lanman54755.2022.9819994
Saish Urumkar, G. Fontanesi, A. Nag, Sachin Sharma
{"title":"Demonstrating Configuration of Software Defined Networking in Real Wireless Testbeds","authors":"Saish Urumkar, G. Fontanesi, A. Nag, Sachin Sharma","doi":"10.1109/lanman54755.2022.9819994","DOIUrl":"https://doi.org/10.1109/lanman54755.2022.9819994","url":null,"abstract":"Currently, several wireless testbeds are available to test networking solutions including Fed4Fire testbeds such as w-ilab. t and CityLab in the EU, and POWDER and COSMOS in the US. In this demonstration, we use the w-ilab.t testbed to set up a wireless ad-hoc Software-Defined Network (SDN). OpenFlow is used as an SDN protocol and is deployed using a grid wireless ad-hoc topology in w-ilab.t. In this paper, we demonstrate: (1) the configuration of a wireless ad-hoc network based on w-ilab.t and (2) the automatic deployment of OpenFlow in an ad-hoc wireless network where some wireless nodes are not directly connected to the controller. The configuration of OpenFlow is shown using the Fed4Fire GUI (Graphical User Interface). The automatic configuration time of OpenFlow is calculated during the demonstration. Further, data traffic is transmitted from each wireless device to another device to show that an OpenFlow network is set up correctly on the w-ilab.t testbed.","PeriodicalId":439508,"journal":{"name":"2022 IEEE International Symposium on Local and Metropolitan Area Networks (LANMAN)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114843236","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
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学术官方微信
小红书