Pub Date : 2020-06-01DOI: 10.1109/NetSoft48620.2020.9165358
P. H. Isolani, J. Haxhibeqiri, I. Moerman, J. Hoebeke, J. Márquez-Barja, L. Granville, S. Latré
The fifth generation of mobile networks (5G) and the Software- Defined Radio Access Networks (SD- RAN) architecture envision to support lower latency, enhanced reliability, massive connectivity, and improved energy efficiency. In this context, low latency is considered crucial and Ultra-Reliable Low Latency Communication (URLLC) as one of the key enablers. Currently, IEEE 802.11 networks cannot be programmed fine-grained enough nor manage multiple networks at runtime. Besides, in such scenarios, the coarse-grained level of monitoring information has been hindering troubleshooting and management. In this paper, we present an SDN-based framework where fine-grained End-to-End (E2E) network statistics can be gathered using Inband Network Telemetry (INT) and used for network control and management. With such fine-grained network information, we show how our system can enhance the Quality of Service (QoS) delivery through slice orchestration in IEEE 802.11 Radio Access Networks (RANs).
{"title":"An SDN-based Framework for Slice Orchestration using In-Band Network Telemetry in IEEE 802.11","authors":"P. H. Isolani, J. Haxhibeqiri, I. Moerman, J. Hoebeke, J. Márquez-Barja, L. Granville, S. Latré","doi":"10.1109/NetSoft48620.2020.9165358","DOIUrl":"https://doi.org/10.1109/NetSoft48620.2020.9165358","url":null,"abstract":"The fifth generation of mobile networks (5G) and the Software- Defined Radio Access Networks (SD- RAN) architecture envision to support lower latency, enhanced reliability, massive connectivity, and improved energy efficiency. In this context, low latency is considered crucial and Ultra-Reliable Low Latency Communication (URLLC) as one of the key enablers. Currently, IEEE 802.11 networks cannot be programmed fine-grained enough nor manage multiple networks at runtime. Besides, in such scenarios, the coarse-grained level of monitoring information has been hindering troubleshooting and management. In this paper, we present an SDN-based framework where fine-grained End-to-End (E2E) network statistics can be gathered using Inband Network Telemetry (INT) and used for network control and management. With such fine-grained network information, we show how our system can enhance the Quality of Service (QoS) delivery through slice orchestration in IEEE 802.11 Radio Access Networks (RANs).","PeriodicalId":239961,"journal":{"name":"2020 6th IEEE Conference on Network Softwarization (NetSoft)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126549054","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 : 2020-06-01DOI: 10.1109/netsoft48620.2020.9165317
Michael Iannelli, Muntasir Raihan Rahman, Nakjung Choi, Le Wang
5G is set to revolutionize the network service industry with unprecedented use-cases in industrial automation, augmented reality, virtual reality and many other domains. Network slicing is a key enabler to realize this concept, and comes with various SLA requirements in terms of latency, throughput, and reliability. Network slicing is typically performed in an end-to-end (e2e) manner across multiple domains, for example, in mobile networks, a slice can span access, transport and core networks. Thus, if an SLA requirement is specified for e2e services, we need to ensure that the total SLA budget is appropriately proportioned to each participating domain in an adaptive manner. Such an SLA decomposition can be extremely useful for network service operators as they can plan accordingly for actual deployment. In this paper we design and implement an SLA decomposition planner for network slicing using supervised machine learning algorithms. Traditional optimization based approaches cannot deal with the dynamic nature of such services. We design machine learning models for SLA decomposition, based on random forest, gradient boosting and neural network. We then evaluate each class of algorithms in terms of accuracy, sample complexity, and model explainability. Our experiments reveal that, in terms of these three requirements, the gradient boosting and neural network algorithms for SLA decomposition out-perform random forest algorithms, given emulated data sets.
{"title":"Applying Machine Learning to End-to-end Slice SLA Decomposition","authors":"Michael Iannelli, Muntasir Raihan Rahman, Nakjung Choi, Le Wang","doi":"10.1109/netsoft48620.2020.9165317","DOIUrl":"https://doi.org/10.1109/netsoft48620.2020.9165317","url":null,"abstract":"5G is set to revolutionize the network service industry with unprecedented use-cases in industrial automation, augmented reality, virtual reality and many other domains. Network slicing is a key enabler to realize this concept, and comes with various SLA requirements in terms of latency, throughput, and reliability. Network slicing is typically performed in an end-to-end (e2e) manner across multiple domains, for example, in mobile networks, a slice can span access, transport and core networks. Thus, if an SLA requirement is specified for e2e services, we need to ensure that the total SLA budget is appropriately proportioned to each participating domain in an adaptive manner. Such an SLA decomposition can be extremely useful for network service operators as they can plan accordingly for actual deployment. In this paper we design and implement an SLA decomposition planner for network slicing using supervised machine learning algorithms. Traditional optimization based approaches cannot deal with the dynamic nature of such services. We design machine learning models for SLA decomposition, based on random forest, gradient boosting and neural network. We then evaluate each class of algorithms in terms of accuracy, sample complexity, and model explainability. Our experiments reveal that, in terms of these three requirements, the gradient boosting and neural network algorithms for SLA decomposition out-perform random forest algorithms, given emulated data sets.","PeriodicalId":239961,"journal":{"name":"2020 6th IEEE Conference on Network Softwarization (NetSoft)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126727242","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 : 2020-06-01DOI: 10.1109/NetSoft48620.2020.9165384
R. Bruschi, F. Davoli, G. Lamanna, C. Lombardo, S. Mangialardi, Jane Frances Pajo
While the integration of fourth-generation (4G) networks with Edge Computing technologies would anticipate the improvements foreseen by the coming of 5G, as well as smoothen the transition to the new technology, 4G does not natively support Edge Computing. Therefore, specific functionalities for user-plane integration and isolation of tenant spaces are required for effectively deploying Edge Computing in 4G networks. This paper describes the design of the end-point between the mobile and edge environments that has been integrated in the telecom layer platform of the MATILDA Project. Such end-point, designed in a Virtual Network Function (VNF), allows intercepting and forwarding data and control traffic towards external Data Networks. Instances of this VNF can be horizontally scaled according to a decision policy, which determines the minimum number of instances required for the current load. Results show that the latency ascribable to the VNF processing is sufficiently low to satisfy the delay budget for all 5G use cases up to 10 ms and that the decision policy based on the QoS Class Identifiers (QCIs) allows scaling with the traffic load, while still fulfilling the performance requirements of each application.
{"title":"Enabling Edge Computing Deployment in 4G and Beyond","authors":"R. Bruschi, F. Davoli, G. Lamanna, C. Lombardo, S. Mangialardi, Jane Frances Pajo","doi":"10.1109/NetSoft48620.2020.9165384","DOIUrl":"https://doi.org/10.1109/NetSoft48620.2020.9165384","url":null,"abstract":"While the integration of fourth-generation (4G) networks with Edge Computing technologies would anticipate the improvements foreseen by the coming of 5G, as well as smoothen the transition to the new technology, 4G does not natively support Edge Computing. Therefore, specific functionalities for user-plane integration and isolation of tenant spaces are required for effectively deploying Edge Computing in 4G networks. This paper describes the design of the end-point between the mobile and edge environments that has been integrated in the telecom layer platform of the MATILDA Project. Such end-point, designed in a Virtual Network Function (VNF), allows intercepting and forwarding data and control traffic towards external Data Networks. Instances of this VNF can be horizontally scaled according to a decision policy, which determines the minimum number of instances required for the current load. Results show that the latency ascribable to the VNF processing is sufficiently low to satisfy the delay budget for all 5G use cases up to 10 ms and that the decision policy based on the QoS Class Identifiers (QCIs) allows scaling with the traffic load, while still fulfilling the performance requirements of each application.","PeriodicalId":239961,"journal":{"name":"2020 6th IEEE Conference on Network Softwarization (NetSoft)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127535684","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 : 2020-06-01DOI: 10.1109/NetSoft48620.2020.9165483
Sergio Gramacho, Felipe Gramacho, Avani Wildani
Real-world deployments of low-cost, peer-to-peer Wireless Mesh Networks (WMNs) for communication in under-served settings are hampered by low throughput capacity and high complexity of network control. We present a design of autonomic agents that manipulate the formation of WMN topologies by organizing a node placement into dynamic network partitions while enforcing inter-partition connectivity to promote the WMNs' capacity through density control, increased frequency diversity and multi-domain SDN-based control. We show that our competing Self-Organizing and Self-Healing agents achieve fast convergence to stable partition sets and global re-connectivity, relying on local information. Moreover, the design achieves global inter-partition connectivity with less than 20% of healing agents on nodes, converging under extreme node churn conditions. The design is robust to the average node placement density, producing partitions isolated at the physical and link layers with the properties of bounded diameter and node degree, and elected partition control node to act as an SDN domain controller.
{"title":"Autonomic Formation of Large-Scale Wireless Mesh Networks","authors":"Sergio Gramacho, Felipe Gramacho, Avani Wildani","doi":"10.1109/NetSoft48620.2020.9165483","DOIUrl":"https://doi.org/10.1109/NetSoft48620.2020.9165483","url":null,"abstract":"Real-world deployments of low-cost, peer-to-peer Wireless Mesh Networks (WMNs) for communication in under-served settings are hampered by low throughput capacity and high complexity of network control. We present a design of autonomic agents that manipulate the formation of WMN topologies by organizing a node placement into dynamic network partitions while enforcing inter-partition connectivity to promote the WMNs' capacity through density control, increased frequency diversity and multi-domain SDN-based control. We show that our competing Self-Organizing and Self-Healing agents achieve fast convergence to stable partition sets and global re-connectivity, relying on local information. Moreover, the design achieves global inter-partition connectivity with less than 20% of healing agents on nodes, converging under extreme node churn conditions. The design is robust to the average node placement density, producing partitions isolated at the physical and link layers with the properties of bounded diameter and node degree, and elected partition control node to act as an SDN domain controller.","PeriodicalId":239961,"journal":{"name":"2020 6th IEEE Conference on Network Softwarization (NetSoft)","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128317623","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 : 2020-06-01DOI: 10.1109/NetSoft48620.2020.9165421
Kokouvi Bénoît Nougnanke, M. Bruyère, Y. Labit
In Software-Defined Networking, near-real-time collection of flow-level statistics provided by OpenFlow (e.g. byte count) is needed for control and management applications like traffic engineering, heavy hitters detection, attack detection, etc. The practical way to do this near-real-time collection is a periodic collection at high frequency. However, periodic polling may generate a lot of overheads expressed by the number of OpenFlow request and reply messages on the control network. To handle these overheads, adaptive techniques based on the pull model were proposed. But we can do better by detaching from the classical OpenFlow request-reply model for the particular case of periodic statistics collection. In light of this, we propose a push and prediction based adaptive collection to handle efficiently periodic OpenFlow statistics collection while maintaining good accuracy. We utilize the Ryu Controller and Mininet to implement our solution and then we carry out intensive experiments using real-world traces. The results show that our proposed approach can reduce the number of pushed messages up to 75% compared to a fixed periodic collection with a very good accuracy represented by a collection error of less than 0.5%.
{"title":"Low-Overhead Near-Real-Time Flow Statistics Collection in SDN","authors":"Kokouvi Bénoît Nougnanke, M. Bruyère, Y. Labit","doi":"10.1109/NetSoft48620.2020.9165421","DOIUrl":"https://doi.org/10.1109/NetSoft48620.2020.9165421","url":null,"abstract":"In Software-Defined Networking, near-real-time collection of flow-level statistics provided by OpenFlow (e.g. byte count) is needed for control and management applications like traffic engineering, heavy hitters detection, attack detection, etc. The practical way to do this near-real-time collection is a periodic collection at high frequency. However, periodic polling may generate a lot of overheads expressed by the number of OpenFlow request and reply messages on the control network. To handle these overheads, adaptive techniques based on the pull model were proposed. But we can do better by detaching from the classical OpenFlow request-reply model for the particular case of periodic statistics collection. In light of this, we propose a push and prediction based adaptive collection to handle efficiently periodic OpenFlow statistics collection while maintaining good accuracy. We utilize the Ryu Controller and Mininet to implement our solution and then we carry out intensive experiments using real-world traces. The results show that our proposed approach can reduce the number of pushed messages up to 75% compared to a fixed periodic collection with a very good accuracy represented by a collection error of less than 0.5%.","PeriodicalId":239961,"journal":{"name":"2020 6th IEEE Conference on Network Softwarization (NetSoft)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121176671","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 : 2020-06-01DOI: 10.1109/NetSoft48620.2020.9165338
José Santos, T. Wauters, B. Volckaert, F. Turck
In recent years, cloud computing is evolving towards a distributed paradigm called Fog Computing, aiming to provide a distributed infrastructure by placing computational resources close to end-users. To fully leverage on Fog Computing, proper resource allocation is needed to cope with the demanding constraints introduced by IoT (e.g. low latency, high mobility). One of the main challenges that remain is Service Function Chaining (SFC). Services must be connected in a specific order forming an SFC allowing providers to benefit from the high flexibility and low operational costs introduced by network softwarization. In the demonstration, an SFC controller able to optimize the placement of service chains in Fog-cloud environments will be presented. The SFC controller has been implemented on the Kubernetes platform, an open-source orchestrator for the automatic deployment of micro-services. Our approach allows Kubernetes to deploy micro-services based on up-to-date information on the current status of the network infrastructure. The demonstration will show how application developers could use our approach to set up service chains for their services. Then, performance outcomes of our SFC controller will be shown, especially in terms of container deployment times.
{"title":"Live Demonstration of Service Function Chaining allocation in Fog Computing","authors":"José Santos, T. Wauters, B. Volckaert, F. Turck","doi":"10.1109/NetSoft48620.2020.9165338","DOIUrl":"https://doi.org/10.1109/NetSoft48620.2020.9165338","url":null,"abstract":"In recent years, cloud computing is evolving towards a distributed paradigm called Fog Computing, aiming to provide a distributed infrastructure by placing computational resources close to end-users. To fully leverage on Fog Computing, proper resource allocation is needed to cope with the demanding constraints introduced by IoT (e.g. low latency, high mobility). One of the main challenges that remain is Service Function Chaining (SFC). Services must be connected in a specific order forming an SFC allowing providers to benefit from the high flexibility and low operational costs introduced by network softwarization. In the demonstration, an SFC controller able to optimize the placement of service chains in Fog-cloud environments will be presented. The SFC controller has been implemented on the Kubernetes platform, an open-source orchestrator for the automatic deployment of micro-services. Our approach allows Kubernetes to deploy micro-services based on up-to-date information on the current status of the network infrastructure. The demonstration will show how application developers could use our approach to set up service chains for their services. Then, performance outcomes of our SFC controller will be shown, especially in terms of container deployment times.","PeriodicalId":239961,"journal":{"name":"2020 6th IEEE Conference on Network Softwarization (NetSoft)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121977024","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 : 2020-06-01DOI: 10.1109/NetSoft48620.2020.9165481
R. Bolla, R. Bruschi, F. Davoli, C. Lombardo, Jane Frances Pajo
Since the adoption of virtualization paradigms is seen as a viable way to fulfil the requirements of next-generation applications in a sustainable way, this paper examines the virtualization of the Radio Access Network (RAN), focusing on the C-RAN architecture, in order to better understand the impact of NFV technologies on power consumption and costs in real networks. The evaluation compares the power consumption obtained by deploying the Base Band Unit (BBU) using commercial devices or pools of Virtual Network Functions (VNFs). Publicly available datasets describing the traffic and the eNodeBs have been used for the evaluation, as well as datasheets for both the commercial devices and the VNF pools. Results show that the usage of the virtualized BBU causes consumptions around 250% higher with respect to the commercial deployment, and operation and capital costs over 66% higher, contradicting the common belief of NFV being a “green” technology. Further estimates conducted in this paper, however, highlight how the deployment of VNFs alongside specialized hardware solutions can represent a successful approach for telecom providers, with energy savings up to 20% and costs in line with the ones of dedicated hardware deployments.
由于采用虚拟化范式被视为以可持续的方式满足下一代应用需求的可行方法，因此本文研究了无线接入网(RAN)的虚拟化，重点关注C-RAN架构，以便更好地了解NFV技术对实际网络中功耗和成本的影响。该评估比较了在商用设备和VNFs (Virtual Network Functions)池中部署BBU (Base Band Unit)所获得的功耗。用于评估的是描述流量和enodeb的公开数据集，以及商用设备和VNF池的数据表。结果表明，与商业部署相比，虚拟化BBU的使用导致能耗高出约250%，运营和资本成本高出66%以上，这与NFV是一种“绿色”技术的普遍看法相矛盾。然而，本文进行的进一步估计强调了VNFs与专用硬件解决方案的部署如何代表电信提供商的成功方法，可以节省高达20%的能源，并且成本与专用硬件部署一致。
{"title":"Debunking the “Green” NFV Myth: An Assessment of the Virtualization Sustainability in Radio Access Networks","authors":"R. Bolla, R. Bruschi, F. Davoli, C. Lombardo, Jane Frances Pajo","doi":"10.1109/NetSoft48620.2020.9165481","DOIUrl":"https://doi.org/10.1109/NetSoft48620.2020.9165481","url":null,"abstract":"Since the adoption of virtualization paradigms is seen as a viable way to fulfil the requirements of next-generation applications in a sustainable way, this paper examines the virtualization of the Radio Access Network (RAN), focusing on the C-RAN architecture, in order to better understand the impact of NFV technologies on power consumption and costs in real networks. The evaluation compares the power consumption obtained by deploying the Base Band Unit (BBU) using commercial devices or pools of Virtual Network Functions (VNFs). Publicly available datasets describing the traffic and the eNodeBs have been used for the evaluation, as well as datasheets for both the commercial devices and the VNF pools. Results show that the usage of the virtualized BBU causes consumptions around 250% higher with respect to the commercial deployment, and operation and capital costs over 66% higher, contradicting the common belief of NFV being a “green” technology. Further estimates conducted in this paper, however, highlight how the deployment of VNFs alongside specialized hardware solutions can represent a successful approach for telecom providers, with energy savings up to 20% and costs in line with the ones of dedicated hardware deployments.","PeriodicalId":239961,"journal":{"name":"2020 6th IEEE Conference on Network Softwarization (NetSoft)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125874374","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 : 2020-06-01DOI: 10.1109/NetSoft48620.2020.9165357
M. Mauro, A. Liotta, M. Longo, F. Postiglione
Today, modern telco infrastructures are espousing softwarized paradigms (e.g. virtualization, containerization), which are necessary to implement the network slicing, and, consequently, to achieve a beneficial trade-off between service offered and costs. In particular, container-based technologies, when compared to classic virtualized frameworks, offer a lightweight environment to host novel network services. Inspired by these last trends, in this work we propose a statistical characterization of a containerized version of IP Multimedia Subsystem (cIMS), one of the crucial parts of 5G core network. Precisely, we: i) exploit the Queueing Networks (QN) formalism to model the chained behavior of a cIMS infrastructure; ii) perform a statistical assessment aimed at analyzing both the queueing dynamics in different scenarios (single/multi class), and at selecting the optimal cIMS deployment guaranteeing the minimum response time at a given cost; iii) carry on an experimental analysis through Clearwater platform to extract realistic estimates of system parameters.
{"title":"Statistical Characterization of Containerized IP Multimedia Subsystem through Queueing Networks","authors":"M. Mauro, A. Liotta, M. Longo, F. Postiglione","doi":"10.1109/NetSoft48620.2020.9165357","DOIUrl":"https://doi.org/10.1109/NetSoft48620.2020.9165357","url":null,"abstract":"Today, modern telco infrastructures are espousing softwarized paradigms (e.g. virtualization, containerization), which are necessary to implement the network slicing, and, consequently, to achieve a beneficial trade-off between service offered and costs. In particular, container-based technologies, when compared to classic virtualized frameworks, offer a lightweight environment to host novel network services. Inspired by these last trends, in this work we propose a statistical characterization of a containerized version of IP Multimedia Subsystem (cIMS), one of the crucial parts of 5G core network. Precisely, we: i) exploit the Queueing Networks (QN) formalism to model the chained behavior of a cIMS infrastructure; ii) perform a statistical assessment aimed at analyzing both the queueing dynamics in different scenarios (single/multi class), and at selecting the optimal cIMS deployment guaranteeing the minimum response time at a given cost; iii) carry on an experimental analysis through Clearwater platform to extract realistic estimates of system parameters.","PeriodicalId":239961,"journal":{"name":"2020 6th IEEE Conference on Network Softwarization (NetSoft)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132146847","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 : 2020-06-01DOI: 10.1109/NetSoft48620.2020.9165388
Felix Bachmann, R. Bauer, Hauke Heseding, M. Zitterbart
This paper deals with synchronized multicast reception while considering Service Function Chaining (SFC), i.e., all data packets sent towards a multicast group are first processed by the required service functions and then received by the group members at approximately the same time. This is an important requirement for several distributed applications, e.g., emergency push-to-talk services like TETRA or DMR. The presented TopoSync-SFC approach exploits recent advancements in the fields of Software-defined Networking (SDN) and Network Function Virtualization (NFV) to address synchronization directly inside the network, i.e., no dedicated support for synchronization is required by the applications. It is based on the idea of application-specific SFC-embedding multicast distribution trees that exploit paths of different length in the topology to reduce the variance in packet reception times. We present the architecture for TopoSync-SFC and an ILP-based problem formulation that respects synchronization requirements. The evaluation of a push-to-talk use-case shows that TopoSync-SFC is a significant improvement with respect to synchronized reception over approaches that do not consider synchronization.
本文在考虑SFC (Service Function linking)的情况下处理同步组播接收问题，即发送给组播组的所有数据包首先由所需的业务功能处理，然后大约同时被组播组的成员接收。这是一些分布式应用程序的重要需求，例如紧急一键通服务，如TETRA或DMR。所提出的TopoSync-SFC方法利用了软件定义网络(SDN)和网络功能虚拟化(NFV)领域的最新进展，直接解决了网络内部的同步问题，也就是说，应用程序不需要专门支持同步。它基于特定应用的sfc嵌入多播分布树的思想，利用拓扑中不同长度的路径来减少数据包接收时间的变化。我们提出了TopoSync-SFC的体系结构和一个基于ilp的问题公式，该公式尊重同步需求。对一键通用例的评估表明，相对于不考虑同步的方法，TopoSync-SFC在同步接收方面是一个显著的改进。
{"title":"TopoSync-SFC: SFC-aware Network-driven Synchronization of Multicast Traffic in Software-defined Environments","authors":"Felix Bachmann, R. Bauer, Hauke Heseding, M. Zitterbart","doi":"10.1109/NetSoft48620.2020.9165388","DOIUrl":"https://doi.org/10.1109/NetSoft48620.2020.9165388","url":null,"abstract":"This paper deals with synchronized multicast reception while considering Service Function Chaining (SFC), i.e., all data packets sent towards a multicast group are first processed by the required service functions and then received by the group members at approximately the same time. This is an important requirement for several distributed applications, e.g., emergency push-to-talk services like TETRA or DMR. The presented TopoSync-SFC approach exploits recent advancements in the fields of Software-defined Networking (SDN) and Network Function Virtualization (NFV) to address synchronization directly inside the network, i.e., no dedicated support for synchronization is required by the applications. It is based on the idea of application-specific SFC-embedding multicast distribution trees that exploit paths of different length in the topology to reduce the variance in packet reception times. We present the architecture for TopoSync-SFC and an ILP-based problem formulation that respects synchronization requirements. The evaluation of a push-to-talk use-case shows that TopoSync-SFC is a significant improvement with respect to synchronized reception over approaches that do not consider synchronization.","PeriodicalId":239961,"journal":{"name":"2020 6th IEEE Conference on Network Softwarization (NetSoft)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130801315","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 : 2020-06-01DOI: 10.1109/NetSoft48620.2020.9165489
Abdullah A. Al-khatib, Abdelmajid Khelil
We consider the wireless network utility maximization problem for various vehicular applications with different priorities. Our approach jointly optimizes bandwidth reservation and immediate slicing allocation based on priorities. The basestation-vehicle association happens in a two-tier heterogeneous wireless network. We first determine a sub-optimal network bandwidth reservation ratio and slicing allocation ratio based on sub-optimal basestation association. To this end, we formulate the problem as a biconcave maximization problem which we solve using an alternative concave search algorithm. Intensive simulations demonstrate that the proposed priority-based reservation and slicing allocation scheme outperforms the conventional slicing allocation schemes in terms of efficiency in network resource utilization.
{"title":"Priority- and Reservation-based Slicing for Future Vehicular Networks","authors":"Abdullah A. Al-khatib, Abdelmajid Khelil","doi":"10.1109/NetSoft48620.2020.9165489","DOIUrl":"https://doi.org/10.1109/NetSoft48620.2020.9165489","url":null,"abstract":"We consider the wireless network utility maximization problem for various vehicular applications with different priorities. Our approach jointly optimizes bandwidth reservation and immediate slicing allocation based on priorities. The basestation-vehicle association happens in a two-tier heterogeneous wireless network. We first determine a sub-optimal network bandwidth reservation ratio and slicing allocation ratio based on sub-optimal basestation association. To this end, we formulate the problem as a biconcave maximization problem which we solve using an alternative concave search algorithm. Intensive simulations demonstrate that the proposed priority-based reservation and slicing allocation scheme outperforms the conventional slicing allocation schemes in terms of efficiency in network resource utilization.","PeriodicalId":239961,"journal":{"name":"2020 6th IEEE Conference on Network Softwarization (NetSoft)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115236952","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
扫码关注我们
求助内容：
应助结果提醒方式：