Pub Date : 2016-04-25DOI: 10.1109/NOMS.2016.7502991
N. Herold, S. Posselt, Oliver Hanka, G. Carle
Recent developments favor the adoption of IP-based protocols in automotive and aerospace domains. The increased connectivity between components helps to cut costs and enables better re-use of standardized components. However, increased connectivity also increases the attack surface of the overall system and necessitates dedicated security solutions. This paper presents an anomaly detection system for SOME/IP, a standardized automotive middleware protocol. Within the system, Esper, a complex event processing engine, applies a domain-specific rule set to a stream of SOME/IP packets. Possible attacks and protocol violations on the SOME/IP protocol are identified, suitable rules for detection are presented, and finally, the performance of the system is evaluated.
{"title":"Anomaly detection for SOME/IP using complex event processing","authors":"N. Herold, S. Posselt, Oliver Hanka, G. Carle","doi":"10.1109/NOMS.2016.7502991","DOIUrl":"https://doi.org/10.1109/NOMS.2016.7502991","url":null,"abstract":"Recent developments favor the adoption of IP-based protocols in automotive and aerospace domains. The increased connectivity between components helps to cut costs and enables better re-use of standardized components. However, increased connectivity also increases the attack surface of the overall system and necessitates dedicated security solutions. This paper presents an anomaly detection system for SOME/IP, a standardized automotive middleware protocol. Within the system, Esper, a complex event processing engine, applies a domain-specific rule set to a stream of SOME/IP packets. Possible attacks and protocol violations on the SOME/IP protocol are identified, suitable rules for detection are presented, and finally, the performance of the system is evaluated.","PeriodicalId":344879,"journal":{"name":"NOMS 2016 - 2016 IEEE/IFIP Network Operations and Management Symposium","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124202422","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 : 2016-04-25DOI: 10.1109/NOMS.2016.7503011
Pieter Smet, B. Dhoedt, P. Simoens
We see a trend to design services as a suite of small service components instead of the typical monolithic nature of classic web services, which led to an increasing amount of long-tail services on the Internet. Deploying instances everywhere to achieve a fast response time results in high costs, especially when these services are used infrequently and remain idle most of the time. One way to avoid needless over-provisioning is to deploy instances on-demand but this requires every component to be available upon request arrival. We propose a placement algorithm to maximize the amount of clients we can serve on-demand using the Docker layered filesystem. Docker facilitates automated deployment of services in lightweight software containers, allowing almost instantaneous deployment. Our algorithm finds the optimal storage location for layers so we can retrieve all service layers, deploy a service instance and provide a first response to a request within the desired time. We solve this problem using integer linear programming (ILP) and present techniques to improve the scalability of ILP while minimizing the performance loss. Results show that our approximation performs better with large scale problems than the classic ILP case.
{"title":"On-demand provisioning of long-tail services in distributed clouds","authors":"Pieter Smet, B. Dhoedt, P. Simoens","doi":"10.1109/NOMS.2016.7503011","DOIUrl":"https://doi.org/10.1109/NOMS.2016.7503011","url":null,"abstract":"We see a trend to design services as a suite of small service components instead of the typical monolithic nature of classic web services, which led to an increasing amount of long-tail services on the Internet. Deploying instances everywhere to achieve a fast response time results in high costs, especially when these services are used infrequently and remain idle most of the time. One way to avoid needless over-provisioning is to deploy instances on-demand but this requires every component to be available upon request arrival. We propose a placement algorithm to maximize the amount of clients we can serve on-demand using the Docker layered filesystem. Docker facilitates automated deployment of services in lightweight software containers, allowing almost instantaneous deployment. Our algorithm finds the optimal storage location for layers so we can retrieve all service layers, deploy a service instance and provide a first response to a request within the desired time. We solve this problem using integer linear programming (ILP) and present techniques to improve the scalability of ILP while minimizing the performance loss. Results show that our approximation performs better with large scale problems than the classic ILP case.","PeriodicalId":344879,"journal":{"name":"NOMS 2016 - 2016 IEEE/IFIP Network Operations and Management Symposium","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126114858","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 : 2016-04-25DOI: 10.1109/NOMS.2016.7502935
Xuan Liu, D. Medhi
Fault-tolerance in a virtualized networking environment (VNE) requires additional efforts to provide the survivability against failures on either virtual networks (VNs) or the underlying substrate network. In this dissertation, we design a software-defined resilient VNE using a hybrid scheme of protection and restoration, where for each VN, a set of redundant virtual routers (VRs) are reserved as shared standby virtual routers (S-VRs), and any S-VR can be activated to replace a failed VR in the existed VN dynamically after the failure is identified. We first introduce a dynamic reconfiguration scheme (DRS) for node failures in a VNE, and then propose a Mixed-Integer Linear Programming (MILP) model with dual goals to optimally select S-VRs to restore all VNs while load balancing, and a heuristic algorithm based on the model is also presented. By considering a number of factors, the results showed that the proposed heuristics performance was close to the optimization model when there were sufficient standby virtual routers for each virtual network and the substrate nodes had the capability to support multiple standby virtual routers to be in service simultaneously. Finally, we present a prototyping design and implementation on the realistic virtual network testbeds (i.e., GpENI and GENI).
{"title":"Dynamic virtual network restoration with optimal standby virtual router selection","authors":"Xuan Liu, D. Medhi","doi":"10.1109/NOMS.2016.7502935","DOIUrl":"https://doi.org/10.1109/NOMS.2016.7502935","url":null,"abstract":"Fault-tolerance in a virtualized networking environment (VNE) requires additional efforts to provide the survivability against failures on either virtual networks (VNs) or the underlying substrate network. In this dissertation, we design a software-defined resilient VNE using a hybrid scheme of protection and restoration, where for each VN, a set of redundant virtual routers (VRs) are reserved as shared standby virtual routers (S-VRs), and any S-VR can be activated to replace a failed VR in the existed VN dynamically after the failure is identified. We first introduce a dynamic reconfiguration scheme (DRS) for node failures in a VNE, and then propose a Mixed-Integer Linear Programming (MILP) model with dual goals to optimally select S-VRs to restore all VNs while load balancing, and a heuristic algorithm based on the model is also presented. By considering a number of factors, the results showed that the proposed heuristics performance was close to the optimization model when there were sufficient standby virtual routers for each virtual network and the substrate nodes had the capability to support multiple standby virtual routers to be in service simultaneously. Finally, we present a prototyping design and implementation on the realistic virtual network testbeds (i.e., GpENI and GENI).","PeriodicalId":344879,"journal":{"name":"NOMS 2016 - 2016 IEEE/IFIP Network Operations and Management Symposium","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129964544","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 : 2016-04-25DOI: 10.1109/NOMS.2016.7502970
Wenqin Shao, J. Rougier, F. Devienne, M. Viste
For multi-homed networks, inter-domain traffic engineering (TE) consists in selecting the best path via available transit providers, so that the transmission quality is improved in front of network events, such as congestion and fail-over. In practice, this choice bases on end-to-end (e2e) measurements toward destination networks. These measurements, especially Round-Trip Time (RTT), are expected to offer an faithful view on inter-domain path properties. Hosts in destination networks with open ports are deliberately discovered for active measurement. RTT traces so obtained can be influenced by host-local factors that are not relevant to inter-domain routing and eventually mislead route decisions. We data-mined the RTT time-series between two ASes with unsupervised learning method - clustering, on a set of statistic features. Achieved results showed that our method was capable of improving data quality, by excluding less reliable traces. Moreover, we considered traceroute measurements. Early results suggested that most variations of e2e delay actually occured in access networks. We thus believe that the proposed scheme can improve the accuracy and stability of the route selection for multi-homed networks.
{"title":"Improve round-trip time measurement quality via clustering in inter-domain traffic engineering","authors":"Wenqin Shao, J. Rougier, F. Devienne, M. Viste","doi":"10.1109/NOMS.2016.7502970","DOIUrl":"https://doi.org/10.1109/NOMS.2016.7502970","url":null,"abstract":"For multi-homed networks, inter-domain traffic engineering (TE) consists in selecting the best path via available transit providers, so that the transmission quality is improved in front of network events, such as congestion and fail-over. In practice, this choice bases on end-to-end (e2e) measurements toward destination networks. These measurements, especially Round-Trip Time (RTT), are expected to offer an faithful view on inter-domain path properties. Hosts in destination networks with open ports are deliberately discovered for active measurement. RTT traces so obtained can be influenced by host-local factors that are not relevant to inter-domain routing and eventually mislead route decisions. We data-mined the RTT time-series between two ASes with unsupervised learning method - clustering, on a set of statistic features. Achieved results showed that our method was capable of improving data quality, by excluding less reliable traces. Moreover, we considered traceroute measurements. Early results suggested that most variations of e2e delay actually occured in access networks. We thus believe that the proposed scheme can improve the accuracy and stability of the route selection for multi-homed networks.","PeriodicalId":344879,"journal":{"name":"NOMS 2016 - 2016 IEEE/IFIP Network Operations and Management Symposium","volume":"171 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132464849","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 : 2016-04-25DOI: 10.1109/NOMS.2016.7502840
Elisa Mannes, C. Maziero, L. Lassance, Fábio Borges
Information-centric Networks (ICN) aims to improve content delivery by promoting the content as the protagonist of the network layer. By naming, routing, and forwarding named content directly on the network layer, ICN allows the same content to satisfy requests from different users, enabling innetwork caches to place contents strategically near the interested users. This characteristic is especially interesting for multimedia content distribution, since it represents a better quality of experience for users due to low round-trip time, bandwidth use, and load on content providers. However, caching protected multimedia content on uncontrolled third party devices may impair access control policies enforcement by the content providers. Many encryption-based access control solutions have been proposed for ICN, applying different cryptographic strategies leading to distinct features which may not be appropriate for multimedia content protection. In this paper, we simulate, evaluate, and discuss the individual characteristics of three encryption-based access control solutions in light of multimedia distribution in ICN. We show that leveraging cache efficiency, computational load to encrypt and decrypt content, and user revocation are the biggest challenges for the enforcement of access control policies on ICN.
{"title":"Assessing the impact of cryptographic access control solutions on multimedia delivery in information-centric networks","authors":"Elisa Mannes, C. Maziero, L. Lassance, Fábio Borges","doi":"10.1109/NOMS.2016.7502840","DOIUrl":"https://doi.org/10.1109/NOMS.2016.7502840","url":null,"abstract":"Information-centric Networks (ICN) aims to improve content delivery by promoting the content as the protagonist of the network layer. By naming, routing, and forwarding named content directly on the network layer, ICN allows the same content to satisfy requests from different users, enabling innetwork caches to place contents strategically near the interested users. This characteristic is especially interesting for multimedia content distribution, since it represents a better quality of experience for users due to low round-trip time, bandwidth use, and load on content providers. However, caching protected multimedia content on uncontrolled third party devices may impair access control policies enforcement by the content providers. Many encryption-based access control solutions have been proposed for ICN, applying different cryptographic strategies leading to distinct features which may not be appropriate for multimedia content protection. In this paper, we simulate, evaluate, and discuss the individual characteristics of three encryption-based access control solutions in light of multimedia distribution in ICN. We show that leveraging cache efficiency, computational load to encrypt and decrypt content, and user revocation are the biggest challenges for the enforcement of access control policies on ICN.","PeriodicalId":344879,"journal":{"name":"NOMS 2016 - 2016 IEEE/IFIP Network Operations and Management Symposium","volume":"205 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122317413","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 : 2016-04-25DOI: 10.1109/NOMS.2016.7502889
R. D. Corin, D. Siracusa, E. Salvadori, Arne Schwabe
Similarly to computer operating systems which guarantee safe access to memory resources, Network Operating Systems shall grant SDN applications a reliable access to neatly organized flow table resources. This paper presents the architecture for a controller-agnostic Memory Management System and some of its functionalities that aim at improving flow table usage and preventing network misconfigurations. From the implementation perspective, this work discusses the applicability of the proposed system, a strategy to evaluate it and current open challenges.
{"title":"Empowering network operating systems with memory management techniques","authors":"R. D. Corin, D. Siracusa, E. Salvadori, Arne Schwabe","doi":"10.1109/NOMS.2016.7502889","DOIUrl":"https://doi.org/10.1109/NOMS.2016.7502889","url":null,"abstract":"Similarly to computer operating systems which guarantee safe access to memory resources, Network Operating Systems shall grant SDN applications a reliable access to neatly organized flow table resources. This paper presents the architecture for a controller-agnostic Memory Management System and some of its functionalities that aim at improving flow table usage and preventing network misconfigurations. From the implementation perspective, this work discusses the applicability of the proposed system, a strategy to evaluate it and current open challenges.","PeriodicalId":344879,"journal":{"name":"NOMS 2016 - 2016 IEEE/IFIP Network Operations and Management Symposium","volume":"35 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121014217","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 : 2016-04-25DOI: 10.1109/NOMS.2016.7502846
M. Artuso, C. Caba, H. Christiansen, José Soler
New technologies and architectures arise in the telecommunications industry in order to cater to the ever growing demands in terms of resource utilization, manageability and user experience. C-RAN and SDN represent two such novel paradigms, both advocating for centralization of a set of resources or control capabilities respectively. The C-RAN architecture requires a significant amount of link capacity which may be a prohibitive factor in its adoption hence an obvious solution is to intelligently share the physical infrastructure among several virtual operators. In this context, a new challenge is to flexibly manage the sharing of the infrastructure. This paper argues that a centralized, SDN-based approach can bring the needed flexibility in the management of the C-RAN. More specifically, this paper proposes a policy-centric management framework, which uses the SDN architecture to enforce various rules for sharing the physical infrastructure. A testbed based on Floodlight and Mininet has been implemented to show the benefits of using this automatic management tool for sharing the mobile site capacity.
{"title":"Towards flexbile SDN-based management for cloud-based mobile networks","authors":"M. Artuso, C. Caba, H. Christiansen, José Soler","doi":"10.1109/NOMS.2016.7502846","DOIUrl":"https://doi.org/10.1109/NOMS.2016.7502846","url":null,"abstract":"New technologies and architectures arise in the telecommunications industry in order to cater to the ever growing demands in terms of resource utilization, manageability and user experience. C-RAN and SDN represent two such novel paradigms, both advocating for centralization of a set of resources or control capabilities respectively. The C-RAN architecture requires a significant amount of link capacity which may be a prohibitive factor in its adoption hence an obvious solution is to intelligently share the physical infrastructure among several virtual operators. In this context, a new challenge is to flexibly manage the sharing of the infrastructure. This paper argues that a centralized, SDN-based approach can bring the needed flexibility in the management of the C-RAN. More specifically, this paper proposes a policy-centric management framework, which uses the SDN architecture to enforce various rules for sharing the physical infrastructure. A testbed based on Floodlight and Mininet has been implemented to show the benefits of using this automatic management tool for sharing the mobile site capacity.","PeriodicalId":344879,"journal":{"name":"NOMS 2016 - 2016 IEEE/IFIP Network Operations and Management Symposium","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132655779","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 : 2016-04-25DOI: 10.1109/NOMS.2016.7502984
Taqwa Saeed, M. Lestas, Y. Mylonas, A. Pitsillides, V. P. Lesta
A number of probabilistic flooding schemes have been recently considered in VANETs to address problems of information dissemination in safety applications. The design approach has so far been simulative, a method which does not guarantee that the derived protocols will work when the simulation settings are violated in practice. In this paper, motivated by the need to design information dissemination protocols with verifiable properties prior to implementation, we employ mathematical models of single and multiple lane roads to investigate probabilistic flooding in VANETs using mathematical analysis. We demonstrate that the system can be described by linear difference equations the solutions of which yield the probability of all vehicles receiving the critical message as a function of the rebroadcast probability, the number of neighbors of each vehicle and the number of vehicles. We utilize the obtained solutions to derive the desired rebroadcast probabilities as a function of the transmission range, the vehicle density and the dissemination distance. The obtained results are in line with results obtained using extensive simulations and can be used as a baseline to develop information dissemination protocols with verifiable properties.
{"title":"Analysis of probabilistic flooding in VANETs for optimal rebroadcast probabilities","authors":"Taqwa Saeed, M. Lestas, Y. Mylonas, A. Pitsillides, V. P. Lesta","doi":"10.1109/NOMS.2016.7502984","DOIUrl":"https://doi.org/10.1109/NOMS.2016.7502984","url":null,"abstract":"A number of probabilistic flooding schemes have been recently considered in VANETs to address problems of information dissemination in safety applications. The design approach has so far been simulative, a method which does not guarantee that the derived protocols will work when the simulation settings are violated in practice. In this paper, motivated by the need to design information dissemination protocols with verifiable properties prior to implementation, we employ mathematical models of single and multiple lane roads to investigate probabilistic flooding in VANETs using mathematical analysis. We demonstrate that the system can be described by linear difference equations the solutions of which yield the probability of all vehicles receiving the critical message as a function of the rebroadcast probability, the number of neighbors of each vehicle and the number of vehicles. We utilize the obtained solutions to derive the desired rebroadcast probabilities as a function of the transmission range, the vehicle density and the dissemination distance. The obtained results are in line with results obtained using extensive simulations and can be used as a baseline to develop information dissemination protocols with verifiable properties.","PeriodicalId":344879,"journal":{"name":"NOMS 2016 - 2016 IEEE/IFIP Network Operations and Management Symposium","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133791001","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 : 2016-04-25DOI: 10.1109/NOMS.2016.7502867
Janne Ali-Tolppa, T. Tsvetkov
In a mobile Self-Organizing Network (SON), the SON coordinator has been introduced to control the application of Configuration Management (CM) changes, in order to prevent conflicts between independent SON function instances running in parallel. However, there is always a trade-off between stability and efficiency. On one hand we need to avoid conflicts, on the other we want fast, parallelized execution of SON function instances. Additionally, the concept of SON verification has been developed to automatically detect and correct degradations that arise from unexpected side-effects of (parallel) CM changes made by SON functions or human operators. However, as the number of function instances increases in the future networks, the performance of the SON coordinator becomes critical, i.e. excessive serialization is no longer possible. In this paper, we show how both, SON coordination and verification, can work together and how the cooperation enables a more efficient SON without having to compromise on its stability. This can be achieved by extending the SON function execution coordination to SON verification and by dynamically adjusting the coordination policies between more relaxed and more strict concurrency control strategies based on the feedback from the verification.
{"title":"Optimistic concurrency control in self-organizing networks using automatic coordination and verification","authors":"Janne Ali-Tolppa, T. Tsvetkov","doi":"10.1109/NOMS.2016.7502867","DOIUrl":"https://doi.org/10.1109/NOMS.2016.7502867","url":null,"abstract":"In a mobile Self-Organizing Network (SON), the SON coordinator has been introduced to control the application of Configuration Management (CM) changes, in order to prevent conflicts between independent SON function instances running in parallel. However, there is always a trade-off between stability and efficiency. On one hand we need to avoid conflicts, on the other we want fast, parallelized execution of SON function instances. Additionally, the concept of SON verification has been developed to automatically detect and correct degradations that arise from unexpected side-effects of (parallel) CM changes made by SON functions or human operators. However, as the number of function instances increases in the future networks, the performance of the SON coordinator becomes critical, i.e. excessive serialization is no longer possible. In this paper, we show how both, SON coordination and verification, can work together and how the cooperation enables a more efficient SON without having to compromise on its stability. This can be achieved by extending the SON function execution coordination to SON verification and by dynamically adjusting the coordination policies between more relaxed and more strict concurrency control strategies based on the feedback from the verification.","PeriodicalId":344879,"journal":{"name":"NOMS 2016 - 2016 IEEE/IFIP Network Operations and Management Symposium","volume":"58 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132090977","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 : 2016-04-25DOI: 10.1109/NOMS.2016.7503008
Fabio Pianese, Massimo Gallo, A. Conte, Diego Perino
The upcoming 5G architecture is expected to heavily rely on network functions implemented by software deployed on commodity hardware architectures. Multiple standardization efforts are underway to specify interfaces between virtualized and real infrastructure, and procedures for interoperability among functions. However, the practical feasibility of function implementation in such abstract and disembodied conditions is scarcely covered in the latest literature. In this paper, we argue for a Network Function Virtualization (NFV) framework that provides 5G network functions built around a modular software router model, rather than following the traditional VM-container approaches. We illustrate its advantages in enabling support for efficient processing on heterogeneous hardware and in ensuring consistency of flow/session semantics across distributed 5G data planes. Finally, we report on the state of Programmable Data Plane, our architecture to implement 5G network functions as modular pipelines orchestrated across multiple devices.
{"title":"Orchestrating 5G virtual network functions as a modular Programmable Data Plane","authors":"Fabio Pianese, Massimo Gallo, A. Conte, Diego Perino","doi":"10.1109/NOMS.2016.7503008","DOIUrl":"https://doi.org/10.1109/NOMS.2016.7503008","url":null,"abstract":"The upcoming 5G architecture is expected to heavily rely on network functions implemented by software deployed on commodity hardware architectures. Multiple standardization efforts are underway to specify interfaces between virtualized and real infrastructure, and procedures for interoperability among functions. However, the practical feasibility of function implementation in such abstract and disembodied conditions is scarcely covered in the latest literature. In this paper, we argue for a Network Function Virtualization (NFV) framework that provides 5G network functions built around a modular software router model, rather than following the traditional VM-container approaches. We illustrate its advantages in enabling support for efficient processing on heterogeneous hardware and in ensuring consistency of flow/session semantics across distributed 5G data planes. Finally, we report on the state of Programmable Data Plane, our architecture to implement 5G network functions as modular pipelines orchestrated across multiple devices.","PeriodicalId":344879,"journal":{"name":"NOMS 2016 - 2016 IEEE/IFIP Network Operations and Management Symposium","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131632635","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
扫码关注我们
求助内容：
应助结果提醒方式：