This paper discusses two issues with multi-channel multi-radio Wireless Mesh Networks (WMN): gateway placement and gateway selection. To address these issues, a method will be proposed that places gateways at strategic locations to avoid congestion and adaptively learns to select a more efficient gateway for each wireless router by using learning automata. This method, called the N-queen Inspired Gateway Placement and Learning Automata-based Selection (NQ-GPLS), considers multiple metrics such as loss ratio, throughput, load at the gateways and delay. Simulation results from NS-2 simulator demonstrate that NQ-GPLS can significantly improve the overall network performance compared to a standard WMN.
{"title":"NQ-GPLS: N-Queen Inspired Gateway Placement and Learning Automata-based Gateway Selection in Wireless Mesh Network","authors":"Afsaneh Razi, K. Hua, Akbar Majidi","doi":"10.1145/3132062.3132084","DOIUrl":"https://doi.org/10.1145/3132062.3132084","url":null,"abstract":"This paper discusses two issues with multi-channel multi-radio Wireless Mesh Networks (WMN): gateway placement and gateway selection. To address these issues, a method will be proposed that places gateways at strategic locations to avoid congestion and adaptively learns to select a more efficient gateway for each wireless router by using learning automata. This method, called the N-queen Inspired Gateway Placement and Learning Automata-based Selection (NQ-GPLS), considers multiple metrics such as loss ratio, throughput, load at the gateways and delay. Simulation results from NS-2 simulator demonstrate that NQ-GPLS can significantly improve the overall network performance compared to a standard WMN.","PeriodicalId":157857,"journal":{"name":"Proceedings of the 15th ACM International Symposium on Mobility Management and Wireless Access","volume":"154 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121555093","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}
Adel Alshamrani, Ankur Chowdhary, Sandeep Pisharody, Duo Lu, Dijiang Huang
Software-Defined Networking (SDN) is a network architecture that aims at providing high flexibility through the decoupling of the network logic from the forwarding functions. The ease of programmability makes SDN a great platform implementation of various initiatives that involve application deployment, security solutions, and decentralized network management in a multi-tenant data center environment. Although this can introduce many applications in different areas and leads to the high impact on several aspects, security of SDN architecture remains an open question and needs to be revisited based on the new concept of SDN. Current SDN-based attack detection mechanisms have some limitations. In this paper, we investigate two of those limitations: Misbehavior Attack and NewFlow Attack. We propose a secure system that periodically collects network statistics from the forwarding elements and apply Machine Learning (ML) classification algorithms. Our framework ensures that the proposed solution makes the SDN architecture more self-adaptive, and intelligent while reacting to network changes.
SDN (Software-Defined Networking)是一种通过将网络逻辑与转发功能解耦来提供高灵活性的网络架构。易于编程使SDN成为一个很好的平台实现，可以在多租户数据中心环境中实现应用程序部署、安全解决方案和分散的网络管理。尽管这可以在不同的领域引入许多应用，并导致对几个方面的高影响，但SDN架构的安全性仍然是一个悬而未决的问题，需要基于SDN的新概念重新审视。目前基于sdn的攻击检测机制存在一定的局限性。在本文中，我们研究了其中的两个限制:错误行为攻击和新流攻击。我们提出了一个安全的系统，定期从转发元素收集网络统计数据，并应用机器学习(ML)分类算法。我们的框架确保了所提出的解决方案使SDN架构在响应网络变化时更具自适应性和智能化。
{"title":"A Defense System for Defeating DDoS Attacks in SDN based Networks","authors":"Adel Alshamrani, Ankur Chowdhary, Sandeep Pisharody, Duo Lu, Dijiang Huang","doi":"10.1145/3132062.3132074","DOIUrl":"https://doi.org/10.1145/3132062.3132074","url":null,"abstract":"Software-Defined Networking (SDN) is a network architecture that aims at providing high flexibility through the decoupling of the network logic from the forwarding functions. The ease of programmability makes SDN a great platform implementation of various initiatives that involve application deployment, security solutions, and decentralized network management in a multi-tenant data center environment. Although this can introduce many applications in different areas and leads to the high impact on several aspects, security of SDN architecture remains an open question and needs to be revisited based on the new concept of SDN. Current SDN-based attack detection mechanisms have some limitations. In this paper, we investigate two of those limitations: Misbehavior Attack and NewFlow Attack. We propose a secure system that periodically collects network statistics from the forwarding elements and apply Machine Learning (ML) classification algorithms. Our framework ensures that the proposed solution makes the SDN architecture more self-adaptive, and intelligent while reacting to network changes.","PeriodicalId":157857,"journal":{"name":"Proceedings of the 15th ACM International Symposium on Mobility Management and Wireless Access","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127497774","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}
During the last years WLAN (IEEE 802.11) has become the primary wireless access technology. However, the fast evolution of peak data rates and the wide deployment of WLAN hotspots results in the backhaul connecting such small cells becoming a bottleneck. To provide a high capacity backhauling, we propose COUWBAT, a COgnitive Ultra-Wide BAckhaul Transmission system, featuring extremely flexible usage of a very wide range of non-contiguous, dynamically allocatable spectrum for backhauling in rural areas where a wired solution is not economically feasible. The proposed cognitive MAC layer supported by protocol in-band signaling, ensures the continuity of connectivity with high capacity even in case of fast changes in spectrum availability. The proposed system was prototypically implemented and evaluated exhaustively analytically and also by means of network simulations using ns3. The source code of our simulation model is provided to the community as open source.
{"title":"An Ultra-Wide Overlay Cognitive Radio System for Wireless Backhauling for Small Cells","authors":"M. Döring, A. Zubow, Pablo Leyva, A. Wolisz","doi":"10.1145/3132062.3132067","DOIUrl":"https://doi.org/10.1145/3132062.3132067","url":null,"abstract":"During the last years WLAN (IEEE 802.11) has become the primary wireless access technology. However, the fast evolution of peak data rates and the wide deployment of WLAN hotspots results in the backhaul connecting such small cells becoming a bottleneck. To provide a high capacity backhauling, we propose COUWBAT, a COgnitive Ultra-Wide BAckhaul Transmission system, featuring extremely flexible usage of a very wide range of non-contiguous, dynamically allocatable spectrum for backhauling in rural areas where a wired solution is not economically feasible. The proposed cognitive MAC layer supported by protocol in-band signaling, ensures the continuity of connectivity with high capacity even in case of fast changes in spectrum availability. The proposed system was prototypically implemented and evaluated exhaustively analytically and also by means of network simulations using ns3. The source code of our simulation model is provided to the community as open source.","PeriodicalId":157857,"journal":{"name":"Proceedings of the 15th ACM International Symposium on Mobility Management and Wireless Access","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130544040","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}
Applications for intelligent transportation system provide mechanisms and tools geared to the aid and management of a city's transportation system. These applications are focused on driver safety, as well as on the management and control of the flow of vehicles on the roads. Thus, reducing the impact of congestion and events that may occur on the roads. Most of these applications are offered by information centers in which the vehicle needs access to the internet. In this context, the vehicles need to be connected to an escalation infrastructure in which access to the service is maximized. Therefore, the efficient use of these services is necessary that this connection is continuous. For this, a traffic mobility management mechanism is required that allows a continuous data flow, as well as a transparent access point exchange system enabling that the users do not perceive an interruption in their connection as well as a change in the access point.In this paper, we propose the development of a decision and management mechanism based on fuzzy logic that would indicate whether the vehicle should perform the change of access point or not; and determine to which access point a certain flow should migrate. This mechanism aims to minimize the number of exchanges between access points, eliminating unnecessary exchanges. For the development of this mechanism, we considered the use NS3 simulator to analyze the policy of interface selection and compare it with some related works of the literature. The results showed that the proposed mechanism reduced packet loss, resulting in a shorter delay in the delivery of information.
{"title":"A Flow Control Policy Based on the Class of Applications of the Vehicular Networks","authors":"R. Meneguette, L. H. Nakamura","doi":"10.1145/3132062.3132075","DOIUrl":"https://doi.org/10.1145/3132062.3132075","url":null,"abstract":"Applications for intelligent transportation system provide mechanisms and tools geared to the aid and management of a city's transportation system. These applications are focused on driver safety, as well as on the management and control of the flow of vehicles on the roads. Thus, reducing the impact of congestion and events that may occur on the roads. Most of these applications are offered by information centers in which the vehicle needs access to the internet. In this context, the vehicles need to be connected to an escalation infrastructure in which access to the service is maximized. Therefore, the efficient use of these services is necessary that this connection is continuous. For this, a traffic mobility management mechanism is required that allows a continuous data flow, as well as a transparent access point exchange system enabling that the users do not perceive an interruption in their connection as well as a change in the access point.In this paper, we propose the development of a decision and management mechanism based on fuzzy logic that would indicate whether the vehicle should perform the change of access point or not; and determine to which access point a certain flow should migrate. This mechanism aims to minimize the number of exchanges between access points, eliminating unnecessary exchanges. For the development of this mechanism, we considered the use NS3 simulator to analyze the policy of interface selection and compare it with some related works of the literature. The results showed that the proposed mechanism reduced packet loss, resulting in a shorter delay in the delivery of information.","PeriodicalId":157857,"journal":{"name":"Proceedings of the 15th ACM International Symposium on Mobility Management and Wireless Access","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125486653","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}
Unstable channel links in Vehicular Ad hoc Net- works (VANETs) make the design of reliable broadcast schemes challenging. Existing solutions fail to balance the requirements in Packet Delivery Ratio (PDR), latency and communication overhead, rendering the vehicular broadcast either severe packet losses, long time delay or excessive duplication. In this paper, we propose a Decentralized Cooperative Broadcast (DCB) scheme to provide reliable broadcast in VANETs with short latency and lightweight overhead, where all vehicles jointly piggyback some received data to help other neighbors recover the lost packet, and the broadcast links are also flexibly scheduled to enhance the broadcast efficiency. DCB requires no global information but has comparable performance with those solutions holding hypothetical global network information. We prove that DCB is an optimal solution to enhance the PDR when the broadcast is interference-free, and such potential interference can also be solved in DCB with little cost of a bounded time delay. Simulation results show that DCB can achieve an average PDR of 99.6% in less than 100 ms within a 50-vehicle network, which is far more efficient than existing solutions, even very close to the hypothetical centralized broadcast scheme.
{"title":"Decentralised Data Piggybacking and Link Scheduling for Reliable Broadcast in VANETs","authors":"Guangbing Xiao, Haibo Zhang, Zhiyi Huang, Yawen Chen","doi":"10.1145/3132062.3132078","DOIUrl":"https://doi.org/10.1145/3132062.3132078","url":null,"abstract":"Unstable channel links in Vehicular Ad hoc Net- works (VANETs) make the design of reliable broadcast schemes challenging. Existing solutions fail to balance the requirements in Packet Delivery Ratio (PDR), latency and communication overhead, rendering the vehicular broadcast either severe packet losses, long time delay or excessive duplication. In this paper, we propose a Decentralized Cooperative Broadcast (DCB) scheme to provide reliable broadcast in VANETs with short latency and lightweight overhead, where all vehicles jointly piggyback some received data to help other neighbors recover the lost packet, and the broadcast links are also flexibly scheduled to enhance the broadcast efficiency. DCB requires no global information but has comparable performance with those solutions holding hypothetical global network information. We prove that DCB is an optimal solution to enhance the PDR when the broadcast is interference-free, and such potential interference can also be solved in DCB with little cost of a bounded time delay. Simulation results show that DCB can achieve an average PDR of 99.6% in less than 100 ms within a 50-vehicle network, which is far more efficient than existing solutions, even very close to the hypothetical centralized broadcast scheme.","PeriodicalId":157857,"journal":{"name":"Proceedings of the 15th ACM International Symposium on Mobility Management and Wireless Access","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133411518","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}
We present a topology discovery service for software-defined wireless multi-hop networks, which is capable of capturing rich information about the network topology, such as link quality, interference and node characteristics etc., to effectively support the requirements of higher-layer SDN applications such as routing, channel allocation and transmission power control with enhanced flexibility. We analyse the general topology representation required by such SDN applications and specify the procedure and mechanism required at the controller and nodes to maintain this representation. A proof-of-concept implementation of our service on an SDN enabled multi-channel multi-interface wireless multi-hop network testbed shows the feasibility of our proposal.
{"title":"A Generic and Configurable Topology Discovery Service for Software Defined Wireless Multi-Hop Network","authors":"Lunde Chen, Slim Abdellatif, Pascal Berthou, Kokouvi Bénoît Nougnanke, T. Gayraud","doi":"10.1145/3132062.3132081","DOIUrl":"https://doi.org/10.1145/3132062.3132081","url":null,"abstract":"We present a topology discovery service for software-defined wireless multi-hop networks, which is capable of capturing rich information about the network topology, such as link quality, interference and node characteristics etc., to effectively support the requirements of higher-layer SDN applications such as routing, channel allocation and transmission power control with enhanced flexibility. We analyse the general topology representation required by such SDN applications and specify the procedure and mechanism required at the controller and nodes to maintain this representation. A proof-of-concept implementation of our service on an SDN enabled multi-channel multi-interface wireless multi-hop network testbed shows the feasibility of our proposal.","PeriodicalId":157857,"journal":{"name":"Proceedings of the 15th ACM International Symposium on Mobility Management and Wireless Access","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132181952","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}
Wireless sensor networks (WSNs) are one of the most rapidly developing information technologies and promise to have a variety of applications in Next Generation Networks (NGNs) including the IoT. In this paper, the focus will be on developing new methods for efficiently managing such large-scale networks composed of homogeneous wireless sensors/devices in urban environments such as homes, hospitals, stores and industrial compounds. Heterogeneous networks were proposed in a comparison with the homogeneous ones. The efficiency of these networks will depend on several optimization parameters such as the redundancy, as well as the percentages of coverage and energy saved. We tested the algorithm using different densities of sensors in the network and different values of tuning parameters for the optimization parameters. Obtained results show that our proposed algorithm performs better than the other greedy algorithm. Moreover, networks with more sensors maintain more redundancy and better percentage of coverage. However, it wastes more energy. The same method will be used for heterogeneous wireless sensors networks where devices have different characteristics and the network acts more efficient.
{"title":"An Evolutionary Graph-Based Approach for Managing Self-Organized IoT Networks","authors":"Y. Haddad, H. Ali","doi":"10.1145/3132062.3132068","DOIUrl":"https://doi.org/10.1145/3132062.3132068","url":null,"abstract":"Wireless sensor networks (WSNs) are one of the most rapidly developing information technologies and promise to have a variety of applications in Next Generation Networks (NGNs) including the IoT. In this paper, the focus will be on developing new methods for efficiently managing such large-scale networks composed of homogeneous wireless sensors/devices in urban environments such as homes, hospitals, stores and industrial compounds. Heterogeneous networks were proposed in a comparison with the homogeneous ones. The efficiency of these networks will depend on several optimization parameters such as the redundancy, as well as the percentages of coverage and energy saved. We tested the algorithm using different densities of sensors in the network and different values of tuning parameters for the optimization parameters. Obtained results show that our proposed algorithm performs better than the other greedy algorithm. Moreover, networks with more sensors maintain more redundancy and better percentage of coverage. However, it wastes more energy. The same method will be used for heterogeneous wireless sensors networks where devices have different characteristics and the network acts more efficient.","PeriodicalId":157857,"journal":{"name":"Proceedings of the 15th ACM International Symposium on Mobility Management and Wireless Access","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122398301","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}
Because of the visual nature (images and videos) of the captured data, the coverage problem in Wireless Multimedia Sensor Networks (WMSNs) is totally different from traditional scalar sensor networks and can be defined in several ways according to the target application. In this paper, we focus on one particular coverage, we called Closed Peripheral Coverage (CPC). This type of coverage is present in several realistic application as military camp surveillance, very sensitive buildings (i.e., nuclear center) surveillance, contaminated region monitoring, etc. The objective hence is to detect any intrusion coming from the outside (viewed by at least one multimedia sensor node). To the best of our knowledge, this is the first research work addressing this issue. Briefly, CPC problem can be defined as follow: after a random deployment of multimedia sensor nodes around the region of interest (i.e., Building to monitor), the goal is to schedule several sets of nodes (i.e., cover sets) such that each of which forms a closed "ring" around the region of interest. Hence, instead activating all nodes at once, the cover sets are scheduled to be activated serially, which ensures a significant network lifetime prolongation improvement. In this paper, we study the CPC problem and present two variants of a centralized algorithm. The preliminary simulation results show clearly the effectiveness of the proposed approaches by a factor varied from 2 to 8 in comparison to the basic approach.
{"title":"Closed Peripheral Coverage in Wireless Multimedia Sensor Networks","authors":"Amor Lalama, N. Khernane, A. Mostefaoui","doi":"10.1145/3132062.3132073","DOIUrl":"https://doi.org/10.1145/3132062.3132073","url":null,"abstract":"Because of the visual nature (images and videos) of the captured data, the coverage problem in Wireless Multimedia Sensor Networks (WMSNs) is totally different from traditional scalar sensor networks and can be defined in several ways according to the target application. In this paper, we focus on one particular coverage, we called Closed Peripheral Coverage (CPC). This type of coverage is present in several realistic application as military camp surveillance, very sensitive buildings (i.e., nuclear center) surveillance, contaminated region monitoring, etc. The objective hence is to detect any intrusion coming from the outside (viewed by at least one multimedia sensor node). To the best of our knowledge, this is the first research work addressing this issue. Briefly, CPC problem can be defined as follow: after a random deployment of multimedia sensor nodes around the region of interest (i.e., Building to monitor), the goal is to schedule several sets of nodes (i.e., cover sets) such that each of which forms a closed \"ring\" around the region of interest. Hence, instead activating all nodes at once, the cover sets are scheduled to be activated serially, which ensures a significant network lifetime prolongation improvement. In this paper, we study the CPC problem and present two variants of a centralized algorithm. The preliminary simulation results show clearly the effectiveness of the proposed approaches by a factor varied from 2 to 8 in comparison to the basic approach.","PeriodicalId":157857,"journal":{"name":"Proceedings of the 15th ACM International Symposium on Mobility Management and Wireless Access","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128151806","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}
The paper presents a formal approach to model, analyze, and verify a variant of Message Queue Telemetry Transport protocol (MQtt), dedicated to communicating vehicles (MQtt-CV) that send collected data to automotive infrastructures(subscribers). Our formal approach is based on Promela language and its system verification tool, the model checker SPIN. We propose a slight modification of MQtt protocol to reduce the big volume of data collected and sent by vehicles to infrastructures. Indeed, in the original version of MQtt protocol, when a broker receives data from publishers, it sends them directly to its subscribers without any filtration. As consequence, subscribers may be flooded with unimportant data, which increase the problem in the context where infrastructures should manage a huge volume of data sent by thousands of vehicles. So we propose to model and to analyze formally MQtt-CV protocol, to ensure that the components (broker, publisher, subscriber) that implement this protocol interact correctly and fulfill MQtt requirements.
{"title":"Towards a Formal Analysis of MQtt Protocol in the Context of Communicating Vehicles","authors":"Samir Chouali, A. Boukerche, A. Mostefaoui","doi":"10.1145/3132062.3132079","DOIUrl":"https://doi.org/10.1145/3132062.3132079","url":null,"abstract":"The paper presents a formal approach to model, analyze, and verify a variant of Message Queue Telemetry Transport protocol (MQtt), dedicated to communicating vehicles (MQtt-CV) that send collected data to automotive infrastructures(subscribers). Our formal approach is based on Promela language and its system verification tool, the model checker SPIN. We propose a slight modification of MQtt protocol to reduce the big volume of data collected and sent by vehicles to infrastructures. Indeed, in the original version of MQtt protocol, when a broker receives data from publishers, it sends them directly to its subscribers without any filtration. As consequence, subscribers may be flooded with unimportant data, which increase the problem in the context where infrastructures should manage a huge volume of data sent by thousands of vehicles. So we propose to model and to analyze formally MQtt-CV protocol, to ensure that the components (broker, publisher, subscriber) that implement this protocol interact correctly and fulfill MQtt requirements.","PeriodicalId":157857,"journal":{"name":"Proceedings of the 15th ACM International Symposium on Mobility Management and Wireless Access","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124201186","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}
M. T. Raza, Hsiao-Yun Tseng, Changlong Li, Songwu Lu
IMS (IP Multimedia Subsystem) is an emerging architectural framework that delivers a number of multimedia services -- ranging from voice/video over LTE, interactive gaming and many more -- in operational LTE network. Network operators are embracing cloud-based IMS to meet increasing multimedia traffic demand. They can easily and cost-efficiently implement multimedia applications while ensuring superior end-user experiences through always-on services and real-time engagement. In this paper, we reveal that cloud-based IMS cannot provide session-level resilience under faults and becomes the bottleneck to high service availability. The root cause lies upon the weak failure recovery mechanisms at both IMS protocol and cloud platform that terminate the on-going IMS control-plane procedure. To address this, we propose a design that provides fault-tolerance to IMS control-plane operations. Our design provides modular redundancy to perform real time failure recovery. As the system operates, the control-plane operations are logged at redundant IMS NFs modules. These logs are replayed from the failed operation to resume IMS working after failure. We build our system prototype of open source IMS over cloud platform. Our results show that we can achieve session-level resilience by performing fail-over procedure within tens of milliseconds under different combinations of IMS control-plane operations failures.
{"title":"Modular Redundancy for Cloud based IMS Robustness","authors":"M. T. Raza, Hsiao-Yun Tseng, Changlong Li, Songwu Lu","doi":"10.1145/3132062.3132064","DOIUrl":"https://doi.org/10.1145/3132062.3132064","url":null,"abstract":"IMS (IP Multimedia Subsystem) is an emerging architectural framework that delivers a number of multimedia services -- ranging from voice/video over LTE, interactive gaming and many more -- in operational LTE network. Network operators are embracing cloud-based IMS to meet increasing multimedia traffic demand. They can easily and cost-efficiently implement multimedia applications while ensuring superior end-user experiences through always-on services and real-time engagement. In this paper, we reveal that cloud-based IMS cannot provide session-level resilience under faults and becomes the bottleneck to high service availability. The root cause lies upon the weak failure recovery mechanisms at both IMS protocol and cloud platform that terminate the on-going IMS control-plane procedure. To address this, we propose a design that provides fault-tolerance to IMS control-plane operations. Our design provides modular redundancy to perform real time failure recovery. As the system operates, the control-plane operations are logged at redundant IMS NFs modules. These logs are replayed from the failed operation to resume IMS working after failure. We build our system prototype of open source IMS over cloud platform. Our results show that we can achieve session-level resilience by performing fail-over procedure within tens of milliseconds under different combinations of IMS control-plane operations failures.","PeriodicalId":157857,"journal":{"name":"Proceedings of the 15th ACM International Symposium on Mobility Management and Wireless Access","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123114308","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
扫码关注我们
求助内容：
应助结果提醒方式：