Pub Date : 2018-01-17DOI: 10.1109/NETSOFT.2018.8460135
Abhishek K. Gupta, M. Tornatore, B. Jaumard, B. Mukherjee
Traditional highly-centralized mobile core networks (e.g., Evolved Packet Core (EPC)) need to be constantly upgraded both in their network functions and backhaul links, to meet increasing traffic demands. Network Function Virtualization (NFV) is being investigated as a potential cost-effective solution for this upgrade. A virtual mobile core (here, virtual EPC, vEPC) provides deployment flexibility and scalability while reducing costs, network-resource consumption and application delay. Moreover, a distributed deployment of vEPC is essential for emerging paradigms like Multi-Access Edge Computing (MEC). In this work, we show that significant reduction in network-resource consumption can be achieved as a result of optimal placement of vEPC functions in metro area. Further, we show that not all vEPC functions need to be distributed. In our study, for the first time, we account for vEPC interactions in both data and control planes (Non-Access Stratum (NAS) signaling procedure Service Chains (SCs) with application latency requirements) using a detailed mathematical model.
{"title":"Virtual-Mobile-Core Placement for Metro Network","authors":"Abhishek K. Gupta, M. Tornatore, B. Jaumard, B. Mukherjee","doi":"10.1109/NETSOFT.2018.8460135","DOIUrl":"https://doi.org/10.1109/NETSOFT.2018.8460135","url":null,"abstract":"Traditional highly-centralized mobile core networks (e.g., Evolved Packet Core (EPC)) need to be constantly upgraded both in their network functions and backhaul links, to meet increasing traffic demands. Network Function Virtualization (NFV) is being investigated as a potential cost-effective solution for this upgrade. A virtual mobile core (here, virtual EPC, vEPC) provides deployment flexibility and scalability while reducing costs, network-resource consumption and application delay. Moreover, a distributed deployment of vEPC is essential for emerging paradigms like Multi-Access Edge Computing (MEC). In this work, we show that significant reduction in network-resource consumption can be achieved as a result of optimal placement of vEPC functions in metro area. Further, we show that not all vEPC functions need to be distributed. In our study, for the first time, we account for vEPC interactions in both data and control planes (Non-Access Stratum (NAS) signaling procedure Service Chains (SCs) with application latency requirements) using a detailed mathematical model.","PeriodicalId":333377,"journal":{"name":"2018 4th IEEE Conference on Network Softwarization and Workshops (NetSoft)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-01-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132471245","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 : 2018-01-12DOI: 10.1109/NETSOFT.2018.8460035
He Zhu, Changcheng Huang, Jiayu Zhou
The state-of-the-art mobile edge applications are generating intense traffic and posing rigorous latency requirements to service providers. While resource sharing across multiple service providers today requires a centralized, trusted repository maintained by all parties for service providers to share status. We propose EdgeChain, a blockchain-based architecture to make mobile edge application placement decisions for multiple service providers, based on a stochastic programming problem minimizing the placement cost for mobile edge application placement scenarios. All placement transactions are stored on the blockchain and are traceable by every mobile edge service provider and application vendor who consumes resources at the mobile edge.
{"title":"EdgeChain: Blockchain-based Multi-vendor Mobile Edge Application Placement","authors":"He Zhu, Changcheng Huang, Jiayu Zhou","doi":"10.1109/NETSOFT.2018.8460035","DOIUrl":"https://doi.org/10.1109/NETSOFT.2018.8460035","url":null,"abstract":"The state-of-the-art mobile edge applications are generating intense traffic and posing rigorous latency requirements to service providers. While resource sharing across multiple service providers today requires a centralized, trusted repository maintained by all parties for service providers to share status. We propose EdgeChain, a blockchain-based architecture to make mobile edge application placement decisions for multiple service providers, based on a stochastic programming problem minimizing the placement cost for mobile edge application placement scenarios. All placement transactions are stored on the blockchain and are traceable by every mobile edge service provider and application vendor who consumes resources at the mobile edge.","PeriodicalId":333377,"journal":{"name":"2018 4th IEEE Conference on Network Softwarization and Workshops (NetSoft)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-01-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126164973","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 : 2017-05-25DOI: 10.1109/NETSOFT.2018.8460120
Mohamed Aslan, A. Matrawy
Distributed controllers are oftentimes used in large-scale SDN deployments where they simultaneously run a myriad of network applications each possibly having different consistency and availability preferences. Those controllers need to communicate in order to synchronize their state information. The consistency and the availability of the distributed state information are governed by an underlying consistency model. In earlier work, we suggested the use of adaptively-consistent controllers that can autonomously tune their consistency parameters in order to meet the performance requirements of a certain application. In this paper, we examine the feasibility of employing adaptive controllers that are built on-top of tunable consistency models similar to that of Apache Cassandra. We present an adaptation strategy that uses online clustering techniques (sequential and incremental k-means) in order to map a given application performance indicator ($chi$) into a feasible consistency level ($Phi$) that can be used with the underlying tunable consistency model. In the cases that we modeled and tested, our results showed that a plausible mapping (low RMSE) could be estimated between the application performance ($chi$) and the consistency level ($Phi$) indicators using the clustering techniques.
{"title":"A Clustering-based Consistency Adaptation Strategy for Distributed SDN Controllers","authors":"Mohamed Aslan, A. Matrawy","doi":"10.1109/NETSOFT.2018.8460120","DOIUrl":"https://doi.org/10.1109/NETSOFT.2018.8460120","url":null,"abstract":"Distributed controllers are oftentimes used in large-scale SDN deployments where they simultaneously run a myriad of network applications each possibly having different consistency and availability preferences. Those controllers need to communicate in order to synchronize their state information. The consistency and the availability of the distributed state information are governed by an underlying consistency model. In earlier work, we suggested the use of adaptively-consistent controllers that can autonomously tune their consistency parameters in order to meet the performance requirements of a certain application. In this paper, we examine the feasibility of employing adaptive controllers that are built on-top of tunable consistency models similar to that of Apache Cassandra. We present an adaptation strategy that uses online clustering techniques (sequential and incremental k-means) in order to map a given application performance indicator ($chi$) into a feasible consistency level ($Phi$) that can be used with the underlying tunable consistency model. In the cases that we modeled and tested, our results showed that a plausible mapping (low RMSE) could be estimated between the application performance ($chi$) and the consistency level ($Phi$) indicators using the clustering techniques.","PeriodicalId":333377,"journal":{"name":"2018 4th IEEE Conference on Network Softwarization and Workshops (NetSoft)","volume":"141 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116108179","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-11-18DOI: 10.1109/NETSOFT.2018.8460108
Jeferson Santiago da Silva, F. Boyer, Laurent-Olivier Chiquette, J. Langlois
P4 is an emergent packet-processing language with which the user can describe how the packets are to be processed in a switching element. This paper presents a way to implement complex operations that are not natively supported in P4. In this work, we explored two different methods to add extensions to P4: i) using new native primitives and ii) using extern instances. As a case study, an ROHC entity was implemented and invoked in a P4 program. The tests showed similar relative performance in both methods in terms of normalized packet latency. However, extern instances appear to be more suitable for target-specific switching applications, where the manufacturer/vendor can specify its own specific operations without changes in the P4 syntax and semantics. Extern instances only require changes in the target-specific backend compiler while keeping the P4 frontend compiler unchanged. The use of externs also results in a more elegant code solution since they are implemented outside the switch-core, thus reducing side effects risks that can be caused by a modification in a switch pipeline implementation.
{"title":"Extern Objects in P4: an ROHC Header Compression Scheme Case Study","authors":"Jeferson Santiago da Silva, F. Boyer, Laurent-Olivier Chiquette, J. Langlois","doi":"10.1109/NETSOFT.2018.8460108","DOIUrl":"https://doi.org/10.1109/NETSOFT.2018.8460108","url":null,"abstract":"P4 is an emergent packet-processing language with which the user can describe how the packets are to be processed in a switching element. This paper presents a way to implement complex operations that are not natively supported in P4. In this work, we explored two different methods to add extensions to P4: i) using new native primitives and ii) using extern instances. As a case study, an ROHC entity was implemented and invoked in a P4 program. The tests showed similar relative performance in both methods in terms of normalized packet latency. However, extern instances appear to be more suitable for target-specific switching applications, where the manufacturer/vendor can specify its own specific operations without changes in the P4 syntax and semantics. Extern instances only require changes in the target-specific backend compiler while keeping the P4 frontend compiler unchanged. The use of externs also results in a more elegant code solution since they are implemented outside the switch-core, thus reducing side effects risks that can be caused by a modification in a switch pipeline implementation.","PeriodicalId":333377,"journal":{"name":"2018 4th IEEE Conference on Network Softwarization and Workshops (NetSoft)","volume":"147 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123051453","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
扫码关注我们
求助内容：
应助结果提醒方式：