The explosive growth of wireless data and traffic, accompanied by the rapid advancements in intelligence and the processing power of user equipments (UEs), poses a very difficult challenge to the data providers to maintain the high data rate with sustainable quality-of-service (QoS). A lot of data can be saved by using caching based communication techniques, which would save the service providers a fortune and will make internet connectivity even more affordable. Also, there is room for saving bandwidth and using the limited number of servers and towers efficiently outputting a steadily healthy QoS. We propose an efficient data retrieval framework that uses caching based on the popularity of the pages where the popularity of pages is determined by the number of hits it gets over a month, which is the learning phase of the model and how frequently a given web page is requested. The proposed framework uses a causal decision tree in the background to determine the popularity of pages according to which the algorithm decides whether a given page is worthy of being cached or not. Results show that our proposed model outperforms the conventional data retrieval models in terms of cache missed probability.
{"title":"Machine Learning and Caching based Efficient Data Retrieval Framework","authors":"Shashwati Mishra, Rahul Bajpai, Naveen Gupta, Vibhutesh Kumar Singh","doi":"10.1109/ANTS50601.2020.9342790","DOIUrl":"https://doi.org/10.1109/ANTS50601.2020.9342790","url":null,"abstract":"The explosive growth of wireless data and traffic, accompanied by the rapid advancements in intelligence and the processing power of user equipments (UEs), poses a very difficult challenge to the data providers to maintain the high data rate with sustainable quality-of-service (QoS). A lot of data can be saved by using caching based communication techniques, which would save the service providers a fortune and will make internet connectivity even more affordable. Also, there is room for saving bandwidth and using the limited number of servers and towers efficiently outputting a steadily healthy QoS. We propose an efficient data retrieval framework that uses caching based on the popularity of the pages where the popularity of pages is determined by the number of hits it gets over a month, which is the learning phase of the model and how frequently a given web page is requested. The proposed framework uses a causal decision tree in the background to determine the popularity of pages according to which the algorithm decides whether a given page is worthy of being cached or not. Results show that our proposed model outperforms the conventional data retrieval models in terms of cache missed probability.","PeriodicalId":426651,"journal":{"name":"2020 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115595806","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-12-14DOI: 10.1109/ANTS50601.2020.9342768
Kshitiza Singh, A. Dixit, V. Jain
With the development of converged optical-wireless networks, the mobile users can access a very high bandwidth, any time and anywhere, for the upcoming real-time applications. In the modern digital world, quality-of-experience (QoE) has become the central area of concern to ensure end-to-end user satisfaction. In this paper, we analyze the quality-of-service (QoS) for different traffic classes for a radio-over-fiber (RoF) based attocell network. For this, we use a simple polling algorithm with dynamic weighted queuing for grant sizing and maintains a delay within the maximum bounds for high and medium priority traffic classes with high channel utilization. Further, we propose a model to map QoE with the QoS parameters, like delay, jitter, and packet loss rate, and quantify QoE by representing the degree of user satisfaction by a mean opinion score.
{"title":"Quality of Experience Aware Medium Access Control in Attocell Network","authors":"Kshitiza Singh, A. Dixit, V. Jain","doi":"10.1109/ANTS50601.2020.9342768","DOIUrl":"https://doi.org/10.1109/ANTS50601.2020.9342768","url":null,"abstract":"With the development of converged optical-wireless networks, the mobile users can access a very high bandwidth, any time and anywhere, for the upcoming real-time applications. In the modern digital world, quality-of-experience (QoE) has become the central area of concern to ensure end-to-end user satisfaction. In this paper, we analyze the quality-of-service (QoS) for different traffic classes for a radio-over-fiber (RoF) based attocell network. For this, we use a simple polling algorithm with dynamic weighted queuing for grant sizing and maintains a delay within the maximum bounds for high and medium priority traffic classes with high channel utilization. Further, we propose a model to map QoE with the QoS parameters, like delay, jitter, and packet loss rate, and quantify QoE by representing the degree of user satisfaction by a mean opinion score.","PeriodicalId":426651,"journal":{"name":"2020 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114680744","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-12-14DOI: 10.1109/ANTS50601.2020.9342784
Muskan Ahuja, Ankit, M. Bhatnagar
Stochastic representation of ligand receptor binding is important to provide a receiver modeling of the molecular communication system. In this paper, we model the binding of a finite number of ligand receptors on the receiver with discrete time Markov chains. A novel Markov chain model is introduced for the final output which considers the combined effect of responses received on each ligand receptor. Moreover, the maximum rate at which the proposed chemical binding can operate is presented by analytically quantifying the discrete time capacity of the ligand channel for a binary source. The derived capacity analysis clearly articulates the advantage obtained by employing multiple receptors over a single receptor in a biological signaling scenario with a threshold detector giving the final output.
{"title":"Capacity of Ligand Receptor Channel with Markovian Symbol Detection","authors":"Muskan Ahuja, Ankit, M. Bhatnagar","doi":"10.1109/ANTS50601.2020.9342784","DOIUrl":"https://doi.org/10.1109/ANTS50601.2020.9342784","url":null,"abstract":"Stochastic representation of ligand receptor binding is important to provide a receiver modeling of the molecular communication system. In this paper, we model the binding of a finite number of ligand receptors on the receiver with discrete time Markov chains. A novel Markov chain model is introduced for the final output which considers the combined effect of responses received on each ligand receptor. Moreover, the maximum rate at which the proposed chemical binding can operate is presented by analytically quantifying the discrete time capacity of the ligand channel for a binary source. The derived capacity analysis clearly articulates the advantage obtained by employing multiple receptors over a single receptor in a biological signaling scenario with a threshold detector giving the final output.","PeriodicalId":426651,"journal":{"name":"2020 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"138 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123417315","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-12-14DOI: 10.1109/ANTS50601.2020.9342769
C. Titouna, Farid Naït-Abdesselam
The increasing use of Unmanned Aerial Vehicles (UAVs) in various applications of Aerial Ad Hoc Networks, such as precision agriculture and aerial remote sensing, is fast contributing to their adoption in many civilian applications. Generally equipped with multiple sensors, such as cameras and movement detectors, UAVs are also deployed in hostile environments such as disaster zones or military fields. Therefore, and in order to ensure the success of any deployment of Aerial Ad hoc Networks, detecting and isolating failures is of great importance to allow a high level of security and reliability. In this research, we first introduce a model using a Bayesian network that copes with this type of issues and tries to detect any faulty UAV. Second, we develop a probabilistic predictive scheme to avoid the unexpected failure of a UAV. The proposed approach is validated using realistic synthetic datasets provided by the UAV laboratory at the University of Minnesota.
{"title":"An Efficient Probabilistic Model for Anomaly Prediction in Aerial Ad Hoc Networks","authors":"C. Titouna, Farid Naït-Abdesselam","doi":"10.1109/ANTS50601.2020.9342769","DOIUrl":"https://doi.org/10.1109/ANTS50601.2020.9342769","url":null,"abstract":"The increasing use of Unmanned Aerial Vehicles (UAVs) in various applications of Aerial Ad Hoc Networks, such as precision agriculture and aerial remote sensing, is fast contributing to their adoption in many civilian applications. Generally equipped with multiple sensors, such as cameras and movement detectors, UAVs are also deployed in hostile environments such as disaster zones or military fields. Therefore, and in order to ensure the success of any deployment of Aerial Ad hoc Networks, detecting and isolating failures is of great importance to allow a high level of security and reliability. In this research, we first introduce a model using a Bayesian network that copes with this type of issues and tries to detect any faulty UAV. Second, we develop a probabilistic predictive scheme to avoid the unexpected failure of a UAV. The proposed approach is validated using realistic synthetic datasets provided by the UAV laboratory at the University of Minnesota.","PeriodicalId":426651,"journal":{"name":"2020 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123485293","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-12-14DOI: 10.1109/ANTS50601.2020.9342825
P. Mandal
Policy and charging rule function (PCRF) is a node in LTE-A network for provisioning of policy and charging resources to policy and charging enforcement function (PCEF) of PDN gateway (PGW). During policy allocation the PCRF allocates bandwidth to a call, depending on the total bandwidth available between PGW and the external packet data network. In this work, we analytically find the blocking probability of voice and video call from the policy provisioning perspective. Further we show that, if the available bandwidth between PGW and packet data network is not sufficient, it can create blocking of calls. Not only that, for a given value of arrival rate, we can find the optimal bandwidth between PGW and packet data network to decrease the blocking probability.
PCRF (Policy and charging rule function)是LTE-A网络中的一个节点，用于向PDN网关的PCEF (Policy and charging enforcement function)发放策略和计费资源。在策略分配过程中，PCRF根据PGW与外部分组数据网络之间可用的总带宽为呼叫分配带宽。在这项工作中，我们从策略配置的角度分析了语音和视频呼叫的阻塞概率。进一步我们表明，如果PGW和分组数据网络之间的可用带宽不够，它可能会造成呼叫阻塞。不仅如此，对于给定的到达率值，我们可以找到PGW和分组数据网络之间的最优带宽，以降低阻塞概率。
{"title":"PCRF: On the blocking probability of LTE-A","authors":"P. Mandal","doi":"10.1109/ANTS50601.2020.9342825","DOIUrl":"https://doi.org/10.1109/ANTS50601.2020.9342825","url":null,"abstract":"Policy and charging rule function (PCRF) is a node in LTE-A network for provisioning of policy and charging resources to policy and charging enforcement function (PCEF) of PDN gateway (PGW). During policy allocation the PCRF allocates bandwidth to a call, depending on the total bandwidth available between PGW and the external packet data network. In this work, we analytically find the blocking probability of voice and video call from the policy provisioning perspective. Further we show that, if the available bandwidth between PGW and packet data network is not sufficient, it can create blocking of calls. Not only that, for a given value of arrival rate, we can find the optimal bandwidth between PGW and packet data network to decrease the blocking probability.","PeriodicalId":426651,"journal":{"name":"2020 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123517324","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-12-14DOI: 10.1109/ANTS50601.2020.9342773
S. Singh, Kamal Agrawal, Keshav Singh, Chih-Peng Li, Wan-Jen Huang
In this work, we investigate the performance of best downlink signal to noise ratio (BDS) based unmanned aerial vehicle (UAV) selection scheme in multi-UAV relaying network, where multiple UAVs assist the communication between two ground users (GUs). Firstly, the best UAV is selected using BDS based selection criterion, then, the closed form expressions for the outage probability and throughput of the multi-UAV assisted relay network are derived considering Nakagami-m distributed fading channels. Furthermore, an optimization problem is formulated to ensure maximum system throughput performance by finding the optimal 3D-coordinates (position) of the selected UAV. In addition to this, we derive an upper bound to the system throughput which simplifies the optimization problem and is used in finding a sub-optimal solution to the optimization problem. By Monte Carlo simulation, we validate all the results.
{"title":"Position based Throughput Maximization of Multi-UAV-assisted Relay Networks","authors":"S. Singh, Kamal Agrawal, Keshav Singh, Chih-Peng Li, Wan-Jen Huang","doi":"10.1109/ANTS50601.2020.9342773","DOIUrl":"https://doi.org/10.1109/ANTS50601.2020.9342773","url":null,"abstract":"In this work, we investigate the performance of best downlink signal to noise ratio (BDS) based unmanned aerial vehicle (UAV) selection scheme in multi-UAV relaying network, where multiple UAVs assist the communication between two ground users (GUs). Firstly, the best UAV is selected using BDS based selection criterion, then, the closed form expressions for the outage probability and throughput of the multi-UAV assisted relay network are derived considering Nakagami-m distributed fading channels. Furthermore, an optimization problem is formulated to ensure maximum system throughput performance by finding the optimal 3D-coordinates (position) of the selected UAV. In addition to this, we derive an upper bound to the system throughput which simplifies the optimization problem and is used in finding a sub-optimal solution to the optimization problem. By Monte Carlo simulation, we validate all the results.","PeriodicalId":426651,"journal":{"name":"2020 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126432999","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-12-14DOI: 10.1109/ANTS50601.2020.9342799
Suraj Dhar, Adrish Banerjee, P. Sircar
In this paper we have considered an energy harvesting hybrid massive MIMO cooperative NOMA scheme using hybrid SWIPT protocol in a multiuser cell. Semi-orthogonal User Selection- Receive Antenna Selection Algorithm (SUS-RAS) algorithm is used to create the zero-forcing user set and select the receive antennas of each user for signal reception. Then User Matching-Receive Antenna Selection Algorithm (UM-RAS) is used to group the matched users with the users in the zero-forcing user set and also to select the antennas for signal reception. MaxMax algorithm is used to select the antenna pair for relaying between the users in each cluster. Finally, some numerical studies are shown that demonstrate the advantage of massive MIMO concept, cooperative NOMA along with hybrid SWIPT protocol for energy harvesting.
{"title":"On Energy Harvesting in Hybrid Massive MIMO Cooperative NOMA in a Multiuser Cell","authors":"Suraj Dhar, Adrish Banerjee, P. Sircar","doi":"10.1109/ANTS50601.2020.9342799","DOIUrl":"https://doi.org/10.1109/ANTS50601.2020.9342799","url":null,"abstract":"In this paper we have considered an energy harvesting hybrid massive MIMO cooperative NOMA scheme using hybrid SWIPT protocol in a multiuser cell. Semi-orthogonal User Selection- Receive Antenna Selection Algorithm (SUS-RAS) algorithm is used to create the zero-forcing user set and select the receive antennas of each user for signal reception. Then User Matching-Receive Antenna Selection Algorithm (UM-RAS) is used to group the matched users with the users in the zero-forcing user set and also to select the antennas for signal reception. MaxMax algorithm is used to select the antenna pair for relaying between the users in each cluster. Finally, some numerical studies are shown that demonstrate the advantage of massive MIMO concept, cooperative NOMA along with hybrid SWIPT protocol for energy harvesting.","PeriodicalId":426651,"journal":{"name":"2020 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131330774","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-12-14DOI: 10.1109/ANTS50601.2020.9342808
S. Jaiswal, Rishu Raj, A. Dixit
Visible light communication (VLC) is an optical wireless communication technology in which light-emitting diodes (LEDs) used for illumination are also used for communication. Due to its numerous advantages, it is being actively researched for implementation in 5G cellular systems. In VLC, signals from transmitter panels can reach the receiver through numerous paths because of the reflections from walls. Consequently, these signals suffer from time dispersion, thereby imposing an upper limit on the achievable data rate. This time dispersion depends on a number of factors like wall reflectivity, receiver location, transmitter position, detector area, LED semiangle etc. So, there is a need to include the effect of multiple reflections (occurring in the practical indoor environment) in the performance evaluation of indoor VLC link. We obtain various channel parameters like mean excess delay, RMS delay, coherence bandwidth etc. by simulations in MATLAB to characterize the multipath channel for different transmitter configurations. We also study the error performance of the multipath VLC system in the presence of inter symbol interference (ISI). Moreover, we analyze the effect of LED semiangle on the channel characterization and error performance of multipath VLC links.
{"title":"Performance Evaluation of Multipath VLC Links for Different Transmitter Configurations","authors":"S. Jaiswal, Rishu Raj, A. Dixit","doi":"10.1109/ANTS50601.2020.9342808","DOIUrl":"https://doi.org/10.1109/ANTS50601.2020.9342808","url":null,"abstract":"Visible light communication (VLC) is an optical wireless communication technology in which light-emitting diodes (LEDs) used for illumination are also used for communication. Due to its numerous advantages, it is being actively researched for implementation in 5G cellular systems. In VLC, signals from transmitter panels can reach the receiver through numerous paths because of the reflections from walls. Consequently, these signals suffer from time dispersion, thereby imposing an upper limit on the achievable data rate. This time dispersion depends on a number of factors like wall reflectivity, receiver location, transmitter position, detector area, LED semiangle etc. So, there is a need to include the effect of multiple reflections (occurring in the practical indoor environment) in the performance evaluation of indoor VLC link. We obtain various channel parameters like mean excess delay, RMS delay, coherence bandwidth etc. by simulations in MATLAB to characterize the multipath channel for different transmitter configurations. We also study the error performance of the multipath VLC system in the presence of inter symbol interference (ISI). Moreover, we analyze the effect of LED semiangle on the channel characterization and error performance of multipath VLC links.","PeriodicalId":426651,"journal":{"name":"2020 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115924389","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-12-14DOI: 10.1109/ANTS50601.2020.9342842
Dipojjwal Ray, Pradeepkumar Bhale, S. Biswas, Sukumar Nandi, P. Mitra
6LoWPAN, an adaptation layer designed by IETF, is meant for IPv6 connectivity over lossy links and low power resource constrained devices using the IEEE 802.15.4 networks. Of late, the growing emergence of Internet of Things (IoT) enabled devices in areas such as industrial Cyber Physical Systems (CPS) and home automation has mobilized extensive implementation of 6LoWPAN. However, absence of authentication mechanisms render the adaptation layer prone to various attacks arising out of duplicated or fabricated fragments. Buffer Reservation Attack targets the vulnerability induced due to fictitious allocation of the butter, which then denies new packets from occupancy till timeout. Existing research works to mitigate such attacks resort to cryptographic solutions and split butter approaches to intelligently guarantee butter reservation. In this paper we propose an attacker revelation scheme using Discrete Event Systems (DES) in the framework of Finite State Machines (FSM). The motivation behind our countermeasure is that no work has addressed identification of the adversary in 6LoWPAN setting before. We detect the attack using Wireshark analytics and identify the malicious node from responses to probe packets using a DES based state estimator which ensures correctness too. Our approach is tested on Contiki OS and experimental results show that the proposed scheme provides energy efficient solutions with lesser response times compared to the state of the art solutions.
{"title":"ArsPAN: Attacker Revelation Scheme using Discrete Event System in 6LoWPAN based Buffer Reservation Attack","authors":"Dipojjwal Ray, Pradeepkumar Bhale, S. Biswas, Sukumar Nandi, P. Mitra","doi":"10.1109/ANTS50601.2020.9342842","DOIUrl":"https://doi.org/10.1109/ANTS50601.2020.9342842","url":null,"abstract":"6LoWPAN, an adaptation layer designed by IETF, is meant for IPv6 connectivity over lossy links and low power resource constrained devices using the IEEE 802.15.4 networks. Of late, the growing emergence of Internet of Things (IoT) enabled devices in areas such as industrial Cyber Physical Systems (CPS) and home automation has mobilized extensive implementation of 6LoWPAN. However, absence of authentication mechanisms render the adaptation layer prone to various attacks arising out of duplicated or fabricated fragments. Buffer Reservation Attack targets the vulnerability induced due to fictitious allocation of the butter, which then denies new packets from occupancy till timeout. Existing research works to mitigate such attacks resort to cryptographic solutions and split butter approaches to intelligently guarantee butter reservation. In this paper we propose an attacker revelation scheme using Discrete Event Systems (DES) in the framework of Finite State Machines (FSM). The motivation behind our countermeasure is that no work has addressed identification of the adversary in 6LoWPAN setting before. We detect the attack using Wireshark analytics and identify the malicious node from responses to probe packets using a DES based state estimator which ensures correctness too. Our approach is tested on Contiki OS and experimental results show that the proposed scheme provides energy efficient solutions with lesser response times compared to the state of the art solutions.","PeriodicalId":426651,"journal":{"name":"2020 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131044355","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2020-12-14DOI: 10.1109/ANTS50601.2020.9342753
P. Mandal
Virtual network function (vnf) can be useful for efficient use of cloud resources, specially for 5G networks, where dynamic creation, modification and deletion of virtual network functions are of special need. OpenStack is an open source cloud computing platform, where it is possible to create any virtual network function on demand. During creation of virtual network function, using Tacker or Mistral interface of OpenStack, the problem can arrive with respect to the reachability of vnf, which triggers the OpenStack to recreate the vnf. In this present work, we derive a closed form expression to analyze the availability of vnf considering the reachability problem during or after creation of virtual network function. Further, we compare availability of vnf considering two vnf creation procedures.
{"title":"On the Availability of 5G VNF from Initialization Perspective","authors":"P. Mandal","doi":"10.1109/ANTS50601.2020.9342753","DOIUrl":"https://doi.org/10.1109/ANTS50601.2020.9342753","url":null,"abstract":"Virtual network function (vnf) can be useful for efficient use of cloud resources, specially for 5G networks, where dynamic creation, modification and deletion of virtual network functions are of special need. OpenStack is an open source cloud computing platform, where it is possible to create any virtual network function on demand. During creation of virtual network function, using Tacker or Mistral interface of OpenStack, the problem can arrive with respect to the reachability of vnf, which triggers the OpenStack to recreate the vnf. In this present work, we derive a closed form expression to analyze the availability of vnf considering the reachability problem during or after creation of virtual network function. Further, we compare availability of vnf considering two vnf creation procedures.","PeriodicalId":426651,"journal":{"name":"2020 IEEE International Conference on Advanced Networks and Telecommunications Systems (ANTS)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131388166","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
扫码关注我们
求助内容：
应助结果提醒方式：