Pub Date : 2019-10-01DOI: 10.23919/CNSM46954.2019.9012739
Adja Ndeye Sylla, K. Guillouard, F. Klamm, M. Ouzzif, Philippe Merle, S. B. Rayana, J. Stefani
In the context of Network Functions Virtualization (NFV), telecommunication systems are more and more deployed on the cloud, using orchestration engines such as OpenStack Heat. Heat takes as input templates that describe the components of the target system and automatically performs the deployment. This prevents consumers of cloud services from handling the challenges of manual deployment. However, deploying such systems remains challenging. Indeed, the templates given to Heat may contain errors that can lead to a failed or a partial deployment, thus compromising the systems reliability. To handle this challenge, we propose a formal approach and a tool for the verification of templates consistency prior to launching their deployment. A case study is presented to validate the approach.
{"title":"Formal Verification of Orchestration Templates for Reliable Deployment with OpenStack Heat*","authors":"Adja Ndeye Sylla, K. Guillouard, F. Klamm, M. Ouzzif, Philippe Merle, S. B. Rayana, J. Stefani","doi":"10.23919/CNSM46954.2019.9012739","DOIUrl":"https://doi.org/10.23919/CNSM46954.2019.9012739","url":null,"abstract":"In the context of Network Functions Virtualization (NFV), telecommunication systems are more and more deployed on the cloud, using orchestration engines such as OpenStack Heat. Heat takes as input templates that describe the components of the target system and automatically performs the deployment. This prevents consumers of cloud services from handling the challenges of manual deployment. However, deploying such systems remains challenging. Indeed, the templates given to Heat may contain errors that can lead to a failed or a partial deployment, thus compromising the systems reliability. To handle this challenge, we propose a formal approach and a tool for the verification of templates consistency prior to launching their deployment. A case study is presented to validate the approach.","PeriodicalId":273818,"journal":{"name":"2019 15th International Conference on Network and Service Management (CNSM)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115610829","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 : 2019-10-01DOI: 10.23919/CNSM46954.2019.9012664
Dániel Kozma, G. Soós, Dániel Ficzere, P. Varga
Industrial automation systems require communication technologies with high availability, high security and low latency. Accordingly, the current article addresses industrial-specific communication challenges, presenting some of the relevant solutions. In order to prove the usability of the presented technologies with sound results, this paper utilises a primarily Industrial IoT(IIoT) solution, the Arrowhead Framework, to experiment with communication capabilities between different IIoT clouds. The research is limited to three technologies from the LTE UE categories: Cat 3, Cat Ml and NB-IoT.The novelty of this paper is that it provides a set of experimental studies on applying different mobile networking technologies to support IIoT applications. The studies are based on our current, real-life measurements.
{"title":"Communication Challenges and Solutions between Heterogeneous Industrial IoT Systems","authors":"Dániel Kozma, G. Soós, Dániel Ficzere, P. Varga","doi":"10.23919/CNSM46954.2019.9012664","DOIUrl":"https://doi.org/10.23919/CNSM46954.2019.9012664","url":null,"abstract":"Industrial automation systems require communication technologies with high availability, high security and low latency. Accordingly, the current article addresses industrial-specific communication challenges, presenting some of the relevant solutions. In order to prove the usability of the presented technologies with sound results, this paper utilises a primarily Industrial IoT(IIoT) solution, the Arrowhead Framework, to experiment with communication capabilities between different IIoT clouds. The research is limited to three technologies from the LTE UE categories: Cat 3, Cat Ml and NB-IoT.The novelty of this paper is that it provides a set of experimental studies on applying different mobile networking technologies to support IIoT applications. The studies are based on our current, real-life measurements.","PeriodicalId":273818,"journal":{"name":"2019 15th International Conference on Network and Service Management (CNSM)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122847489","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 : 2019-10-01DOI: 10.23919/CNSM46954.2019.9012706
Sina Rafati Niya, Sebastian Allemann, Arik Gabay, B. Stiller
Data leaks and privacy scandals have been a growing concern of the last decade. While most traditional, i.e., centralized, online platforms require users to register with their personal data, they potentially expose the user’s identity and data to be used for unintended purposes. This work proposes TradeMap as an integrated architecture, designing and enabling an online end-to-end (e2e) trading market place, while supporting anonymous management features. TradeMap addresses the Swiss Financial Market Supervisory Authority (FINMA) regulations by designing a FINMA-complaint Know Your Customer (KYC) platform. Additionally, TradeMap is based on blockchains and employs Ethereum Smart Contracts (SC). Thus, trust and anonymity between the market place and the KYC system relies on zero knowledge proof-based SCs used for user identification processes. With this management approach proposed, the user authentication is only verified within the KYC platform, providing a legally valid and fully anonymous online trading platform.
{"title":"TradeMap: A FINMA-compliant Anonymous Management of an End-2-end Trading Market Place","authors":"Sina Rafati Niya, Sebastian Allemann, Arik Gabay, B. Stiller","doi":"10.23919/CNSM46954.2019.9012706","DOIUrl":"https://doi.org/10.23919/CNSM46954.2019.9012706","url":null,"abstract":"Data leaks and privacy scandals have been a growing concern of the last decade. While most traditional, i.e., centralized, online platforms require users to register with their personal data, they potentially expose the user’s identity and data to be used for unintended purposes. This work proposes TradeMap as an integrated architecture, designing and enabling an online end-to-end (e2e) trading market place, while supporting anonymous management features. TradeMap addresses the Swiss Financial Market Supervisory Authority (FINMA) regulations by designing a FINMA-complaint Know Your Customer (KYC) platform. Additionally, TradeMap is based on blockchains and employs Ethereum Smart Contracts (SC). Thus, trust and anonymity between the market place and the KYC system relies on zero knowledge proof-based SCs used for user identification processes. With this management approach proposed, the user authentication is only verified within the KYC platform, providing a legally valid and fully anonymous online trading platform.","PeriodicalId":273818,"journal":{"name":"2019 15th International Conference on Network and Service Management (CNSM)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129731360","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 : 2019-10-01DOI: 10.23919/CNSM46954.2019.9012746
S. Araújo, F. S. Souza, G. Mateus
Virtual Network Functions (VNF) reduce the complexity to deploy a Network Service (NS), yielding flexibility, and scalability to attend new market appliances and minimizing the required investments. An ordered set of VNFs to serve a NS is called a Service Function Chain (SFC). Most of the literature works deal with SFCs generation and embedding as independent problems, not taking into account the residual substrate network (SN) status during the SFCs generation stage. Furthermore, a NS can award some flexibility regarding the VNFs sequence, i.e., only a subset of VNFs have a fixed precedence requirement. Following this idea, the network operator may enjoy some options to serve a NS. In this work, we introduce a new embedding approach which selects the SFC composition that best fits the residual SN, leading to a better performance in the chaining and placement of VNFs. The results showed that the composition selection mechanism increases performance compared to traditional models that use a fixed composition, improving resources sharing, and increasing the network operator revenues. Also, we demonstrated that the generation of an optimal SFC for a NS does not always lead to the best acceptance rates in a network with partially consumed resources.
虚拟网络功能(VNF)降低了部署网络服务(NS)的复杂性，提供了灵活性和可扩展性，以适应新的市场设备，并最大限度地减少了所需的投资。服务于一个NS的VNFs的有序集合称为SFC (Service Function Chain)。大多数文献都将sfc的生成和嵌入作为独立的问题来处理，没有考虑sfc生成阶段的残余衬底网络(SN)状态。此外，对于VNFs序列，NS可以授予一定的灵活性，即只有一部分VNFs具有固定的优先级要求。根据这个想法，网络运营商可能会有一些选择来提供NS。在这项工作中，我们引入了一种新的嵌入方法，该方法选择最适合残差SN的SFC组成，从而在vnf的链接和放置中获得更好的性能。结果表明，与使用固定组合的传统模型相比，组合选择机制提高了性能，改善了资源共享，增加了网络运营商的收入。此外，我们还证明，在资源部分消耗的网络中，为NS生成最优SFC并不总是导致最佳接受率。
{"title":"A Composition Selection Mechanism for Chaining and Placement of Virtual Network Functions","authors":"S. Araújo, F. S. Souza, G. Mateus","doi":"10.23919/CNSM46954.2019.9012746","DOIUrl":"https://doi.org/10.23919/CNSM46954.2019.9012746","url":null,"abstract":"Virtual Network Functions (VNF) reduce the complexity to deploy a Network Service (NS), yielding flexibility, and scalability to attend new market appliances and minimizing the required investments. An ordered set of VNFs to serve a NS is called a Service Function Chain (SFC). Most of the literature works deal with SFCs generation and embedding as independent problems, not taking into account the residual substrate network (SN) status during the SFCs generation stage. Furthermore, a NS can award some flexibility regarding the VNFs sequence, i.e., only a subset of VNFs have a fixed precedence requirement. Following this idea, the network operator may enjoy some options to serve a NS. In this work, we introduce a new embedding approach which selects the SFC composition that best fits the residual SN, leading to a better performance in the chaining and placement of VNFs. The results showed that the composition selection mechanism increases performance compared to traditional models that use a fixed composition, improving resources sharing, and increasing the network operator revenues. Also, we demonstrated that the generation of an optimal SFC for a NS does not always lead to the best acceptance rates in a network with partially consumed resources.","PeriodicalId":273818,"journal":{"name":"2019 15th International Conference on Network and Service Management (CNSM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126792598","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 : 2019-10-01DOI: 10.23919/CNSM46954.2019.9012698
Song Kang, Linna Ruan, Shaoyong Guo, Wencui Li, Xue-song Qiu
With the development of Internet of Things (IoT), a large number of terminals and devices are connected to the network. Mobile edge computing (MEC) is proposed to assist cloud computing, to relieve the pressure of network and satisfy the requirements of delay-sensitive applications. Considering reasonable allocation of computing resources is the most important aspect corresponding to delay, this paper designs geographic clustering and collaborative scheduling (GC-CS) mechanism. This mechanism can be divided into two parts, which are the decentralized deployment of MEC servers and the resource allocation optimization in MEC. For the first part, this paper designs the load balancing based geographic clustering (LBGC) algorithm which combines the idea of greedy algorithm to realize the initial allocation of computing resources. For the second part, delay minimization oriented collaborative scheduling (DMCS) algorithm is designed to decrease the response delay without increasing system overhead. Finally, the effectiveness of the mechanism is verified by simulation in the IoT scene.
{"title":"Geographic Clustering Based Mobile Edge Computing Resource Allocation Optimization Mechanism","authors":"Song Kang, Linna Ruan, Shaoyong Guo, Wencui Li, Xue-song Qiu","doi":"10.23919/CNSM46954.2019.9012698","DOIUrl":"https://doi.org/10.23919/CNSM46954.2019.9012698","url":null,"abstract":"With the development of Internet of Things (IoT), a large number of terminals and devices are connected to the network. Mobile edge computing (MEC) is proposed to assist cloud computing, to relieve the pressure of network and satisfy the requirements of delay-sensitive applications. Considering reasonable allocation of computing resources is the most important aspect corresponding to delay, this paper designs geographic clustering and collaborative scheduling (GC-CS) mechanism. This mechanism can be divided into two parts, which are the decentralized deployment of MEC servers and the resource allocation optimization in MEC. For the first part, this paper designs the load balancing based geographic clustering (LBGC) algorithm which combines the idea of greedy algorithm to realize the initial allocation of computing resources. For the second part, delay minimization oriented collaborative scheduling (DMCS) algorithm is designed to decrease the response delay without increasing system overhead. Finally, the effectiveness of the mechanism is verified by simulation in the IoT scene.","PeriodicalId":273818,"journal":{"name":"2019 15th International Conference on Network and Service Management (CNSM)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130768358","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 : 2019-10-01DOI: 10.23919/CNSM46954.2019.9012748
C. Sydora, Johannes Jung, I. Nikolaidis
We consider the problem of loss of continuous data feeds from sensor networks, due to transient failures. Because the failures are recoverable, part of the missing data may be, eventually, acquired. Even then, the limited resources of the nodes can result in an incomplete reconstruction of the missing data. In this paper we study a set of proposed data imputation methods, and their variations, on a real data set. We determine the tradeoffs involved in the proposed techniques. A common characteristic of the studied techniques is that they depend on the recent behavior of the data stream and do not make specific assumptions about the long-term stochastic behavior of the data. We consider also the case where simple, sub-sampling based, handling of accumulated missing data is implemented by the nodes.
{"title":"A Study of Simple Partially-Recovered Sensor Data Imputation Methods","authors":"C. Sydora, Johannes Jung, I. Nikolaidis","doi":"10.23919/CNSM46954.2019.9012748","DOIUrl":"https://doi.org/10.23919/CNSM46954.2019.9012748","url":null,"abstract":"We consider the problem of loss of continuous data feeds from sensor networks, due to transient failures. Because the failures are recoverable, part of the missing data may be, eventually, acquired. Even then, the limited resources of the nodes can result in an incomplete reconstruction of the missing data. In this paper we study a set of proposed data imputation methods, and their variations, on a real data set. We determine the tradeoffs involved in the proposed techniques. A common characteristic of the studied techniques is that they depend on the recent behavior of the data stream and do not make specific assumptions about the long-term stochastic behavior of the data. We consider also the case where simple, sub-sampling based, handling of accumulated missing data is implemented by the nodes.","PeriodicalId":273818,"journal":{"name":"2019 15th International Conference on Network and Service Management (CNSM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131141582","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 : 2019-10-01DOI: 10.23919/CNSM46954.2019.9012688
Majid Raeis, A. Tizghadam, A. Leon-Garcia
Motivated by interest in providing more efficient services in customer service systems, we use statistical learning methods and delay history information to predict the conditional distribution of the customers’ waiting times in queueing systems. From the predicted distributions, descriptive statistics of the system such as mean, variance and percentiles of the waiting times can be obtained, which can be used for delay announcements, SLA conformance and better system management. We model the distributions by mixtures of Gaussians, parameters of which can be estimated using Mixture Density Networks. We use the extensions of the Lindley’s equation for multi-server queues to generate our datasets. The evaluations show that exploiting more delay history information can result in much more accurate predictions under realistic time-varying arrival assumptions.
{"title":"Predicting Distributions of Waiting Times in Customer Service Systems using Mixture Density Networks","authors":"Majid Raeis, A. Tizghadam, A. Leon-Garcia","doi":"10.23919/CNSM46954.2019.9012688","DOIUrl":"https://doi.org/10.23919/CNSM46954.2019.9012688","url":null,"abstract":"Motivated by interest in providing more efficient services in customer service systems, we use statistical learning methods and delay history information to predict the conditional distribution of the customers’ waiting times in queueing systems. From the predicted distributions, descriptive statistics of the system such as mean, variance and percentiles of the waiting times can be obtained, which can be used for delay announcements, SLA conformance and better system management. We model the distributions by mixtures of Gaussians, parameters of which can be estimated using Mixture Density Networks. We use the extensions of the Lindley’s equation for multi-server queues to generate our datasets. The evaluations show that exploiting more delay history information can result in much more accurate predictions under realistic time-varying arrival assumptions.","PeriodicalId":273818,"journal":{"name":"2019 15th International Conference on Network and Service Management (CNSM)","volume":"113 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133379868","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 : 2019-10-01DOI: 10.23919/CNSM46954.2019.9012730
N. V. Tu, Jae-Hyoung Yoo, J. W. Hong
Network Function Virtualization (NFV) decouples network functions from dedicated, proprietary hardware into software Virtual Network Functions (VNFs) that can run on standard, commodity servers. One challenge of NFV is to provide high-throughput and low-latency network services. In this paper, we propose eVNF - a hybrid architecture to build and accelerate VNFs with eXpress Data Path (XDP). XDP is a Linux kernel framework that enables high-performance and programmable network processing. However, the programmability of XDP is limited to ensure kernel safety, thus causing difficulties in applying XDP to NFV. eVNF solves this problem by taking a hybrid approach: leave the simple but critical tasks inside the kernel with XDP, and let complex tasks be processed outside XDP, e.g., in user-space. With the hybrid architecture, eVNF allows building fast and flexible VNFs. We used eVNF to build three prototype VNFs: Firewall (eFW), Deep Packet Inspection (eDPI), and Load Balancer (eLB). We evaluated these VNFs in two service function chains using OpenStack. Our experiments showed that eVNF can significantly improve service throughput as well as reduce latency and CPU usage.
网络功能虚拟化(NFV)将网络功能从专用的专有硬件解耦到软件虚拟网络功能(VNFs)中，这些功能可以在标准的商用服务器上运行。NFV的一个挑战是提供高吞吐量和低延迟的网络服务。在本文中，我们提出了eVNF——一种使用eXpress Data Path (XDP)构建和加速vnf的混合架构。XDP是一个Linux内核框架，支持高性能和可编程的网络处理。但是，为了保证内核的安全性，XDP的可编程性受到了限制，这就给将XDP应用于NFV带来了困难。eVNF通过采用一种混合方法解决了这个问题:将简单但关键的任务留在XDP内核中，而让复杂的任务在XDP之外处理，例如，在用户空间中。使用混合架构，eVNF允许构建快速灵活的vnf。我们使用eVNF构建了三个原型vnf:防火墙(eFW)，深度包检测(eDPI)和负载平衡器(eLB)。我们使用OpenStack在两个业务功能链中评估了这些VNFs。我们的实验表明，eVNF可以显著提高业务吞吐量，减少延迟和CPU占用。
{"title":"Building Hybrid Virtual Network Functions with eXpress Data Path","authors":"N. V. Tu, Jae-Hyoung Yoo, J. W. Hong","doi":"10.23919/CNSM46954.2019.9012730","DOIUrl":"https://doi.org/10.23919/CNSM46954.2019.9012730","url":null,"abstract":"Network Function Virtualization (NFV) decouples network functions from dedicated, proprietary hardware into software Virtual Network Functions (VNFs) that can run on standard, commodity servers. One challenge of NFV is to provide high-throughput and low-latency network services. In this paper, we propose eVNF - a hybrid architecture to build and accelerate VNFs with eXpress Data Path (XDP). XDP is a Linux kernel framework that enables high-performance and programmable network processing. However, the programmability of XDP is limited to ensure kernel safety, thus causing difficulties in applying XDP to NFV. eVNF solves this problem by taking a hybrid approach: leave the simple but critical tasks inside the kernel with XDP, and let complex tasks be processed outside XDP, e.g., in user-space. With the hybrid architecture, eVNF allows building fast and flexible VNFs. We used eVNF to build three prototype VNFs: Firewall (eFW), Deep Packet Inspection (eDPI), and Load Balancer (eLB). We evaluated these VNFs in two service function chains using OpenStack. Our experiments showed that eVNF can significantly improve service throughput as well as reduce latency and CPU usage.","PeriodicalId":273818,"journal":{"name":"2019 15th International Conference on Network and Service Management (CNSM)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132444595","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 : 2019-10-01DOI: 10.23919/CNSM46954.2019.9012703
M. A. Moyeen, Fangye Tang, Dipon Saha, I. Haque
Communication link failure is common in any network. In Software Defined Network (SDN), protection-based recovery scheme reduces the failure recovery delay by installing alternative routes at the data plane switches. We can deploy Fast Failure Group (FFG) of OpenFlow protocol if a switch has an alternative path towards the destination; otherwise, the switch can use crankback approach to send the affected traffic towards the traversed route to find an alternative path. These existing recovery schemes force every packet to traverse a chain of matching tables even in the absence of a link failure, which impacts packet processing time and end-to-end delay. In this paper, we propose a packet rerouting architecture, called SD-FAST, that invokes recovery scheme only after facing failure and reduces both the packet processing and crankback backtracking time. We evaluate SD-FAST in Mininet, considering real and simulated traffic on real network topologies. The evaluation results confirm that SD-FAST can reduce around 73% crankback backtracking time and 64% delay compared to its counterparts.
通信链路故障在任何网络中都是常见的。在SDN (Software Defined Network)中，基于保护的恢复方案通过在数据平面交换机上安装备选路由来减少故障恢复的延迟。如果交换机到目的地有替代路径，我们可以部署OpenFlow协议的快速故障组(FFG);否则，交换机可以使用曲柄倒转的方式将受影响的流量发送到经过的路由上，以寻找替代路径。这些现有的恢复方案强制每个数据包遍历匹配表链，即使在没有链路故障的情况下，这也会影响数据包处理时间和端到端延迟。在本文中，我们提出了一种数据包重路由架构，称为SD-FAST，它只在遇到故障时调用恢复方案，从而减少了数据包处理和反向回溯时间。我们在Mininet中评估了SD-FAST，考虑了真实网络拓扑上的真实和模拟流量。评估结果证实，与同类产品相比，SD-FAST可以减少约73%的曲轴回退时间和64%的延迟。
{"title":"SD-FAST: A Packet Rerouting Architecture in SDN","authors":"M. A. Moyeen, Fangye Tang, Dipon Saha, I. Haque","doi":"10.23919/CNSM46954.2019.9012703","DOIUrl":"https://doi.org/10.23919/CNSM46954.2019.9012703","url":null,"abstract":"Communication link failure is common in any network. In Software Defined Network (SDN), protection-based recovery scheme reduces the failure recovery delay by installing alternative routes at the data plane switches. We can deploy Fast Failure Group (FFG) of OpenFlow protocol if a switch has an alternative path towards the destination; otherwise, the switch can use crankback approach to send the affected traffic towards the traversed route to find an alternative path. These existing recovery schemes force every packet to traverse a chain of matching tables even in the absence of a link failure, which impacts packet processing time and end-to-end delay. In this paper, we propose a packet rerouting architecture, called SD-FAST, that invokes recovery scheme only after facing failure and reduces both the packet processing and crankback backtracking time. We evaluate SD-FAST in Mininet, considering real and simulated traffic on real network topologies. The evaluation results confirm that SD-FAST can reduce around 73% crankback backtracking time and 64% delay compared to its counterparts.","PeriodicalId":273818,"journal":{"name":"2019 15th International Conference on Network and Service Management (CNSM)","volume":"20 17-18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133723648","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 : 2019-10-01DOI: 10.23919/CNSM46954.2019.9012742
Ngoc H. Bui, Chuan Pham, K. Nguyen, M. Cheriet
Software in IoT devices needs to be improved regularly to adapt security issues and new user requirements. In advanced IoT networks, devices employ the component-based software architecture in which components can be updated at run-time, such devices can download software components from neighbors, enabling fast distribution of updates in the entire network. One of the most energy consuming operations in the update process is flash re-writing in which the order of re-writing components into the flash memory is decisive for energy consumption. In this paper, we propose a mechanism that schedules updates in an entire IoT network to minimize the energy consumption, while satisfying the deadline constraint for updating all the devices. We mathematically formulate the problem of energy efficient update scheduling as an optimization problem with a novel energy model of the update process, then propose an algorithm to approximate the optimal schedule for updating all devices in the network. We examine the proposed algorithm in three different network instances including a tree, a partial mesh and a full mesh topology. Simulation results illustrate that our algorithm can obtain a near optimum which is, in the best case, only 3.2% different from the minimum.
{"title":"Energy Efficient Scheduling for Networked IoT Device Software Update","authors":"Ngoc H. Bui, Chuan Pham, K. Nguyen, M. Cheriet","doi":"10.23919/CNSM46954.2019.9012742","DOIUrl":"https://doi.org/10.23919/CNSM46954.2019.9012742","url":null,"abstract":"Software in IoT devices needs to be improved regularly to adapt security issues and new user requirements. In advanced IoT networks, devices employ the component-based software architecture in which components can be updated at run-time, such devices can download software components from neighbors, enabling fast distribution of updates in the entire network. One of the most energy consuming operations in the update process is flash re-writing in which the order of re-writing components into the flash memory is decisive for energy consumption. In this paper, we propose a mechanism that schedules updates in an entire IoT network to minimize the energy consumption, while satisfying the deadline constraint for updating all the devices. We mathematically formulate the problem of energy efficient update scheduling as an optimization problem with a novel energy model of the update process, then propose an algorithm to approximate the optimal schedule for updating all devices in the network. We examine the proposed algorithm in three different network instances including a tree, a partial mesh and a full mesh topology. Simulation results illustrate that our algorithm can obtain a near optimum which is, in the best case, only 3.2% different from the minimum.","PeriodicalId":273818,"journal":{"name":"2019 15th International Conference on Network and Service Management (CNSM)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116907021","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
扫码关注我们
求助内容：
应助结果提醒方式：