Pub Date : 2022-11-30DOI: 10.1109/ITNAC55475.2022.9998334
N. Shenoy, Shreyas Madapura Chandraiah, P. Willis
Key challenges faced in the Internet today can be enumerated as follows: (1) complex route discovery mechanisms (2) latency and instability during link or device failure recovery (3) inadequacy in extending routing and addressing to limited domains, (4) complex interworking of multiple routing protocols at border routers. Routing table sizes increase with increasing number of networks indicating a scalability issue. One approach to address this spiraling complexity and performance challenges is to start fresh and re-think Internet routing and addressing. The Expedited Internet Bypass protocol (EIBP) is such a clean slate approach. In the interim, EIBP works in parallel with IP and has no dependency on layer 3 protocols. We demonstrated EIBP for routing and forwarding in an Autonomous system (AS) in our earlier work. In this article, we demonstrate EIBP for inter-AS routing. We compare EIBP's inter-AS operations and performance to Open Shortest Path First (OSPF) and Border Gateway Protocol (BGP) deployed in an intra-AS, inter-AS communications scenario with two AS.
{"title":"Internet Routing with Auto-Assigned Addresses","authors":"N. Shenoy, Shreyas Madapura Chandraiah, P. Willis","doi":"10.1109/ITNAC55475.2022.9998334","DOIUrl":"https://doi.org/10.1109/ITNAC55475.2022.9998334","url":null,"abstract":"Key challenges faced in the Internet today can be enumerated as follows: (1) complex route discovery mechanisms (2) latency and instability during link or device failure recovery (3) inadequacy in extending routing and addressing to limited domains, (4) complex interworking of multiple routing protocols at border routers. Routing table sizes increase with increasing number of networks indicating a scalability issue. One approach to address this spiraling complexity and performance challenges is to start fresh and re-think Internet routing and addressing. The Expedited Internet Bypass protocol (EIBP) is such a clean slate approach. In the interim, EIBP works in parallel with IP and has no dependency on layer 3 protocols. We demonstrated EIBP for routing and forwarding in an Autonomous system (AS) in our earlier work. In this article, we demonstrate EIBP for inter-AS routing. We compare EIBP's inter-AS operations and performance to Open Shortest Path First (OSPF) and Border Gateway Protocol (BGP) deployed in an intra-AS, inter-AS communications scenario with two AS.","PeriodicalId":205731,"journal":{"name":"2022 32nd International Telecommunication Networks and Applications Conference (ITNAC)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133702859","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}
This paper presents the application of reinforcement learning (RL) in the vehicle communication simulation framework (Veins). Reinforcement learning methods for energy saving and greening in the field of autonomous driving have rarely been studied. Under a CACC platoon of green environmental protection, we investigate the use of reinforcement learning algorithms to train the behavior of member vehicles in the event of a serious collision in the front vehicle, so that platoon members can minimize collision damage and energy consumption from behavior which is not in line with the green theme. In terms of energy consumption metrics, the gradient policy algorithm has good convergence in computing the energy consumption problem. It is a feasible training decision planning algorithm for solving the minimization of energy consumption caused by decision behavior in platoon avoidance behavior.
{"title":"Minimizing Energy Loss Decisions for Green Driving Platoon","authors":"Zhiru Gu, Zhongwei Liu, Ziji Ma, Feilong Wang, Xiaogang Zhang","doi":"10.1109/ITNAC55475.2022.9998351","DOIUrl":"https://doi.org/10.1109/ITNAC55475.2022.9998351","url":null,"abstract":"This paper presents the application of reinforcement learning (RL) in the vehicle communication simulation framework (Veins). Reinforcement learning methods for energy saving and greening in the field of autonomous driving have rarely been studied. Under a CACC platoon of green environmental protection, we investigate the use of reinforcement learning algorithms to train the behavior of member vehicles in the event of a serious collision in the front vehicle, so that platoon members can minimize collision damage and energy consumption from behavior which is not in line with the green theme. In terms of energy consumption metrics, the gradient policy algorithm has good convergence in computing the energy consumption problem. It is a feasible training decision planning algorithm for solving the minimization of energy consumption caused by decision behavior in platoon avoidance behavior.","PeriodicalId":205731,"journal":{"name":"2022 32nd International Telecommunication Networks and Applications Conference (ITNAC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134307878","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}
Pub Date : 2022-11-30DOI: 10.1109/ITNAC55475.2022.9998414
Amelia Samandari, A. Willig
This paper looks at the case of mitigating col-lisions between Unmanned Aerial Vehicles (UAVs) in a formation through the use of safety beacons to relay information about UAVs that are at risk of collision due to their geographic proximity to one another. The UAVs send these safety beacons using time division multiple access (TDMA). With TDMA, UAVs can achieve collision-free transmission, thereby reducing the uncertainty of the UAVs in the formation receiving the necessary safety information. In this paper, we provide a system model for a specific regular deployment and a spatial reuse scheme for allocating UAVs to a TDMA slot that operates as follows: the regular, two-dimensional UAV deployment is partitioned into a hexagonal tiling, where all UAVs in the same tile are allocated to different TDMA slots and all UAVs in the same position in their respective tiles are allocated to the same TDMA slot. Through spatial reuse of TDMA slots, theoretical results demonstrate that our scheme can support large formations with a bounded transmission period (i.e. a bounded superframe length). We also ascertain a safety margin factor for the transmit power that can be applied to moderate the effects of interference from multiple UAVs transmitting in the same time slot.
{"title":"TDMA Slot Allocation for UAV Formations: Minimum Superframe Lengths for Two-Dimensional Equidistant Deployments","authors":"Amelia Samandari, A. Willig","doi":"10.1109/ITNAC55475.2022.9998414","DOIUrl":"https://doi.org/10.1109/ITNAC55475.2022.9998414","url":null,"abstract":"This paper looks at the case of mitigating col-lisions between Unmanned Aerial Vehicles (UAVs) in a formation through the use of safety beacons to relay information about UAVs that are at risk of collision due to their geographic proximity to one another. The UAVs send these safety beacons using time division multiple access (TDMA). With TDMA, UAVs can achieve collision-free transmission, thereby reducing the uncertainty of the UAVs in the formation receiving the necessary safety information. In this paper, we provide a system model for a specific regular deployment and a spatial reuse scheme for allocating UAVs to a TDMA slot that operates as follows: the regular, two-dimensional UAV deployment is partitioned into a hexagonal tiling, where all UAVs in the same tile are allocated to different TDMA slots and all UAVs in the same position in their respective tiles are allocated to the same TDMA slot. Through spatial reuse of TDMA slots, theoretical results demonstrate that our scheme can support large formations with a bounded transmission period (i.e. a bounded superframe length). We also ascertain a safety margin factor for the transmit power that can be applied to moderate the effects of interference from multiple UAVs transmitting in the same time slot.","PeriodicalId":205731,"journal":{"name":"2022 32nd International Telecommunication Networks and Applications Conference (ITNAC)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133492119","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}
Pub Date : 2022-11-30DOI: 10.1109/ITNAC55475.2022.9998354
Aliyu Makama, K. Kuladinithi, A. Timm‐Giel
Owing to the nature of traffic and architecture of Wireless Seismic Data Acquisition (WSDA) networks also referred to as Wireless Geophone Networks (WGN), we propose a model that analytically investigates the performance of IEEE 802.11 protocol for single-hop ad hoc WGNs under unsaturated traffic and non-ideal channel conditions. Although several IEEE 802.11 models have been presented in literature, some inaccuracies exist with respect to modeling IEEE 802.11-based WGNs. Our model focuses primarily on singling out the inaccuracies in modeling the backoff procedure and packet drop probability as some of the deviance with the existing literature. Expressions for MAC delay, throughput, collision probability, and average duration a node spends during the backoff procedure before decrementing its counter were proposed. Furthermore, the model investigates an optimal number of geophones that could be supported within a subnetwork based on the proposed WGN architecture in [16]. The model was evaluated analytically in MATLAB and validated using simulation in OMNeT++ discrete event simulator.
{"title":"Analysis of the IEEE 802.11 DCF for Wireless Seismic Data Acquisition Networks","authors":"Aliyu Makama, K. Kuladinithi, A. Timm‐Giel","doi":"10.1109/ITNAC55475.2022.9998354","DOIUrl":"https://doi.org/10.1109/ITNAC55475.2022.9998354","url":null,"abstract":"Owing to the nature of traffic and architecture of Wireless Seismic Data Acquisition (WSDA) networks also referred to as Wireless Geophone Networks (WGN), we propose a model that analytically investigates the performance of IEEE 802.11 protocol for single-hop ad hoc WGNs under unsaturated traffic and non-ideal channel conditions. Although several IEEE 802.11 models have been presented in literature, some inaccuracies exist with respect to modeling IEEE 802.11-based WGNs. Our model focuses primarily on singling out the inaccuracies in modeling the backoff procedure and packet drop probability as some of the deviance with the existing literature. Expressions for MAC delay, throughput, collision probability, and average duration a node spends during the backoff procedure before decrementing its counter were proposed. Furthermore, the model investigates an optimal number of geophones that could be supported within a subnetwork based on the proposed WGN architecture in [16]. The model was evaluated analytically in MATLAB and validated using simulation in OMNeT++ discrete event simulator.","PeriodicalId":205731,"journal":{"name":"2022 32nd International Telecommunication Networks and Applications Conference (ITNAC)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126112620","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}
Pub Date : 2022-11-30DOI: 10.1109/ITNAC55475.2022.9998374
S. Hosseini, R. J. D. Barroso, I. de Miguel, Ó. G. De Dios, N. Merayo, J. Aguado, Edward Echeverry, P. Fernández, R. Lorenzo, E. Abril
Multi-band elastic optical network (MB-EON) is a promising technology to extend the bandwidth of the current elastic optical networks in the middle term. The migration from current networks to MB-EONs should be made carefully taking into account both the required cost and the bandwidth requirements. This paper focuses on the necessity of looking for a trade-off between the links to be upgraded during the migration from the standard C-band to the L-band and the acceptable level of capacity increase. Therefore, it makes two contributions to efficiently upgrade current elastic optical networks: firstly, a planning method to decide which fibers should be upgraded to exploit C+L band; and second, one heuristic for solving the routing, band, modulation level, and spectrum assignment (RBMLSA) problem during network operation. Simulation results demonstrate that, thanks to use of these proposals, the upgrade of a set of the fibers could be viewed as a fully convincing middle term solution by the network operators to get around the huge cost of the whole network migration to C+L line system.
{"title":"Migration Strategy from C-Band Elastic Optical Network to C+L Multiband Optical Network","authors":"S. Hosseini, R. J. D. Barroso, I. de Miguel, Ó. G. De Dios, N. Merayo, J. Aguado, Edward Echeverry, P. Fernández, R. Lorenzo, E. Abril","doi":"10.1109/ITNAC55475.2022.9998374","DOIUrl":"https://doi.org/10.1109/ITNAC55475.2022.9998374","url":null,"abstract":"Multi-band elastic optical network (MB-EON) is a promising technology to extend the bandwidth of the current elastic optical networks in the middle term. The migration from current networks to MB-EONs should be made carefully taking into account both the required cost and the bandwidth requirements. This paper focuses on the necessity of looking for a trade-off between the links to be upgraded during the migration from the standard C-band to the L-band and the acceptable level of capacity increase. Therefore, it makes two contributions to efficiently upgrade current elastic optical networks: firstly, a planning method to decide which fibers should be upgraded to exploit C+L band; and second, one heuristic for solving the routing, band, modulation level, and spectrum assignment (RBMLSA) problem during network operation. Simulation results demonstrate that, thanks to use of these proposals, the upgrade of a set of the fibers could be viewed as a fully convincing middle term solution by the network operators to get around the huge cost of the whole network migration to C+L line system.","PeriodicalId":205731,"journal":{"name":"2022 32nd International Telecommunication Networks and Applications Conference (ITNAC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129239205","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}
Pub Date : 2022-11-30DOI: 10.1109/ITNAC55475.2022.9998395
T. Chu, H. Zepernick, Anders Höök, Alexander Westerhagen, B. Granbom
In this paper, we consider airborne communication networks with directed air data links between high-mobility airborne platforms. Orthogonal time frequency space (OTFS) modulation is used to overcome the effects of the high Doppler shifts induced by the high relative speeds among airborne platforms which can be in excess of 1200 m/s. The performance of the considered system is assessed using the Rician channel to model the directed air data links accounting for the ratio of the signal power in the line-of-sight path to the signal power in the scattered paths. The numerical results reveal significant bit error rate (BER) improvements with increased Rician K-factor, illustrate the trade-offs between BER and bits per symbol offered by different modulation schemes, and show the independence of the BER from the relative speeds among airborne platforms. Further, it is shown that the BER of a single path directed air data link approaches that of a two-ray channel for a sufficiently large Rician K-factor.
{"title":"Performance of OTFS Modulation over Rician Channels in Airborne Communication Networks","authors":"T. Chu, H. Zepernick, Anders Höök, Alexander Westerhagen, B. Granbom","doi":"10.1109/ITNAC55475.2022.9998395","DOIUrl":"https://doi.org/10.1109/ITNAC55475.2022.9998395","url":null,"abstract":"In this paper, we consider airborne communication networks with directed air data links between high-mobility airborne platforms. Orthogonal time frequency space (OTFS) modulation is used to overcome the effects of the high Doppler shifts induced by the high relative speeds among airborne platforms which can be in excess of 1200 m/s. The performance of the considered system is assessed using the Rician channel to model the directed air data links accounting for the ratio of the signal power in the line-of-sight path to the signal power in the scattered paths. The numerical results reveal significant bit error rate (BER) improvements with increased Rician K-factor, illustrate the trade-offs between BER and bits per symbol offered by different modulation schemes, and show the independence of the BER from the relative speeds among airborne platforms. Further, it is shown that the BER of a single path directed air data link approaches that of a two-ray channel for a sufficiently large Rician K-factor.","PeriodicalId":205731,"journal":{"name":"2022 32nd International Telecommunication Networks and Applications Conference (ITNAC)","volume":"126 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128187207","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}
Pub Date : 2022-11-30DOI: 10.1109/ITNAC55475.2022.9998372
Zijian Zhou, Dongsheng Zheng, Lifeng Lin, B. Jiao
The Nyquist first condition promises data transmission without intersymbol interference (ISI). However, the implementation using any finite impulse response (FIR) filter cannot get rid of the ISI completely because the window's length truncates the Fourier transform, thus, preventing calculations from reaching the intended approximation in the frequency domain. Our previous work introduced an auxiliary factor (AF) method that uses the AFs to compensate the truncated Fourier transform and eliminates the ISI in practice. In this paper, we propose a decomposition solution to further reduce the computational complexity and system delay caused by the AF method. In consequence, an efficient algorithm is exploited to calculate the AFs and numerical results confirm the effectiveness of the proposed solution.
{"title":"Auxiliary Factor Method for Nyquist Filters with Reduced Complexity and Delay","authors":"Zijian Zhou, Dongsheng Zheng, Lifeng Lin, B. Jiao","doi":"10.1109/ITNAC55475.2022.9998372","DOIUrl":"https://doi.org/10.1109/ITNAC55475.2022.9998372","url":null,"abstract":"The Nyquist first condition promises data transmission without intersymbol interference (ISI). However, the implementation using any finite impulse response (FIR) filter cannot get rid of the ISI completely because the window's length truncates the Fourier transform, thus, preventing calculations from reaching the intended approximation in the frequency domain. Our previous work introduced an auxiliary factor (AF) method that uses the AFs to compensate the truncated Fourier transform and eliminates the ISI in practice. In this paper, we propose a decomposition solution to further reduce the computational complexity and system delay caused by the AF method. In consequence, an efficient algorithm is exploited to calculate the AFs and numerical results confirm the effectiveness of the proposed solution.","PeriodicalId":205731,"journal":{"name":"2022 32nd International Telecommunication Networks and Applications Conference (ITNAC)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116920571","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}
Pub Date : 2022-11-30DOI: 10.1109/ITNAC55475.2022.9998424
Khoa T. D. Nguyen, Wei Shi, M. St-Hilaire
Internet of Vehicles (IoV), a special domain of Internet of Things (IoT), has become an indispensable platform for the success of future intelligent transportation. Virtual Network Embedding (VNE), enabling flexible, cost-effective and on-demand deployments of multiple network service requests on a shared physical infrastructure, has become a technological breakthrough in IoV. Typical VNE problems have been well studied in the data center infrastructure where the physical topology is always static. Recently, researchers have investigated the VNE problem in data center networks while considering IoV demands. However, the VNE problem in IoV environments in which connected moving vehicles serve as substrate nodes to process service requests is still in its infancy. This paper proposes a novel heuristic algorithm for solving the online VNE problem in IoV by efficiently and rapidly ranking available vehicles based upon network attributes, and the knowledge of the preceding mappings. Extensive evaluation results indicate that the proposed solution not only outperforms several existing algorithms, but is also highly practical due to its fast execution time.
{"title":"A Dynamic Vehicle-Ranking Approach for Online Virtual Network Embedding in Internet of Vehicles","authors":"Khoa T. D. Nguyen, Wei Shi, M. St-Hilaire","doi":"10.1109/ITNAC55475.2022.9998424","DOIUrl":"https://doi.org/10.1109/ITNAC55475.2022.9998424","url":null,"abstract":"Internet of Vehicles (IoV), a special domain of Internet of Things (IoT), has become an indispensable platform for the success of future intelligent transportation. Virtual Network Embedding (VNE), enabling flexible, cost-effective and on-demand deployments of multiple network service requests on a shared physical infrastructure, has become a technological breakthrough in IoV. Typical VNE problems have been well studied in the data center infrastructure where the physical topology is always static. Recently, researchers have investigated the VNE problem in data center networks while considering IoV demands. However, the VNE problem in IoV environments in which connected moving vehicles serve as substrate nodes to process service requests is still in its infancy. This paper proposes a novel heuristic algorithm for solving the online VNE problem in IoV by efficiently and rapidly ranking available vehicles based upon network attributes, and the knowledge of the preceding mappings. Extensive evaluation results indicate that the proposed solution not only outperforms several existing algorithms, but is also highly practical due to its fast execution time.","PeriodicalId":205731,"journal":{"name":"2022 32nd International Telecommunication Networks and Applications Conference (ITNAC)","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124951980","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}
Pub Date : 2022-11-30DOI: 10.1109/ITNAC55475.2022.9998347
Maryam Masoumi, I. de Miguel, R. J. D. Barroso, L. Ruiz, Fabrizio Brasca, Gianluca Rizzi, N. Merayo, J. Aguado, P. Fernández, R. Lorenzo, E. Abril
The Multi-access Edge Computing (MEC) architecture is made up of geographically distributed edge servers so that computing capabilities are provisioned at the network edge, close to the end users. Network Function Virtualization (NFV), when combined with MEC, provides network services in the form of Service Function Chains (SFC) with low latency. In the design of NFV-based 5G networks, the trade-off between the cost of resource deployment and the effective provisioning of services must be considered. In this work, we analyze the impact of having different MEC locations when considering the provision of SFCs in a dynamic scenario (and thus also address VNF placement). In order to deal with infrastructure failures, it is of great importance to employ robust and resilient network strategies. To safeguard SFCs against failures, various protection techniques can be applied. We use two protection methods, namely, dedicated VNF protection and shared VNF protection, under the assumption of single network failures. The operational performances of different approaches are evaluated in terms of blocking ratio and end-to-end delay, both for the whole network and for different services, and we analyze whether it is better to distribute computing servers among a few MEC sites or among a higher number.
多访问边缘计算(MEC)架构由地理上分布的边缘服务器组成，以便在靠近最终用户的网络边缘提供计算能力。NFV (Network Function Virtualization)与MEC技术相结合，以SFC (Service Function Chains)的形式提供低时延的网络服务。在基于nfv的5G网络设计中，必须考虑资源部署成本与业务有效提供之间的权衡。在这项工作中，我们分析了在动态场景中考虑提供sfc时拥有不同MEC位置的影响(从而也解决了VNF的放置问题)。为了处理基础设施故障，采用鲁棒性和弹性的网络策略是非常重要的。为了防止sfc发生故障，可以采用各种保护技术。在单网络故障的假设下，我们采用专用VNF保护和共享VNF保护两种保护方式。从阻塞率和端到端延迟两个方面对不同方法的运行性能进行了评估，无论是对于整个网络还是不同的服务，我们分析了在几个MEC站点之间分配计算服务器更好还是在更多的MEC站点之间更好。
{"title":"Dynamic Online VNF Placement with Different Protection Schemes in a MEC Environment","authors":"Maryam Masoumi, I. de Miguel, R. J. D. Barroso, L. Ruiz, Fabrizio Brasca, Gianluca Rizzi, N. Merayo, J. Aguado, P. Fernández, R. Lorenzo, E. Abril","doi":"10.1109/ITNAC55475.2022.9998347","DOIUrl":"https://doi.org/10.1109/ITNAC55475.2022.9998347","url":null,"abstract":"The Multi-access Edge Computing (MEC) architecture is made up of geographically distributed edge servers so that computing capabilities are provisioned at the network edge, close to the end users. Network Function Virtualization (NFV), when combined with MEC, provides network services in the form of Service Function Chains (SFC) with low latency. In the design of NFV-based 5G networks, the trade-off between the cost of resource deployment and the effective provisioning of services must be considered. In this work, we analyze the impact of having different MEC locations when considering the provision of SFCs in a dynamic scenario (and thus also address VNF placement). In order to deal with infrastructure failures, it is of great importance to employ robust and resilient network strategies. To safeguard SFCs against failures, various protection techniques can be applied. We use two protection methods, namely, dedicated VNF protection and shared VNF protection, under the assumption of single network failures. The operational performances of different approaches are evaluated in terms of blocking ratio and end-to-end delay, both for the whole network and for different services, and we analyze whether it is better to distribute computing servers among a few MEC sites or among a higher number.","PeriodicalId":205731,"journal":{"name":"2022 32nd International Telecommunication Networks and Applications Conference (ITNAC)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128953462","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}
Pub Date : 2022-11-30DOI: 10.1109/ITNAC55475.2022.9998407
Kai Lehniger, P. Langendörfer
While the name Xtensa is still mostly unknown to the public, the architecture plays a big role in the field of Internet of Things (IoT), be it in the form of custom designs or broadly used microcontrollers such as the ESP32 used inside millions of devices. This paper describes a newly discovered vulnerability that uses the window overflow exception handlers of an Xtensa LX processor to leak and manipulate data. To show its severity, an exploit is demonstrated that allows to disable Stack Canaries, a common protection against stack buffer overflows. Requirements and potential possibilities to escalate the vulnerability, including code-reuse attacks to completely compromise the attacked device. Finally, a countermeasure is introduced with a <0.5% runtime overhead in our worst-case scenario.
{"title":"Through the Window: On the exploitability of Xtensa's Register Window Overflow","authors":"Kai Lehniger, P. Langendörfer","doi":"10.1109/ITNAC55475.2022.9998407","DOIUrl":"https://doi.org/10.1109/ITNAC55475.2022.9998407","url":null,"abstract":"While the name Xtensa is still mostly unknown to the public, the architecture plays a big role in the field of Internet of Things (IoT), be it in the form of custom designs or broadly used microcontrollers such as the ESP32 used inside millions of devices. This paper describes a newly discovered vulnerability that uses the window overflow exception handlers of an Xtensa LX processor to leak and manipulate data. To show its severity, an exploit is demonstrated that allows to disable Stack Canaries, a common protection against stack buffer overflows. Requirements and potential possibilities to escalate the vulnerability, including code-reuse attacks to completely compromise the attacked device. Finally, a countermeasure is introduced with a <0.5% runtime overhead in our worst-case scenario.","PeriodicalId":205731,"journal":{"name":"2022 32nd International Telecommunication Networks and Applications Conference (ITNAC)","volume":"113 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121130100","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：