Pub Date : 1900-01-01DOI: 10.1109/ICCNC.2017.7876159
Mohsen Karimzadeh Kiskani, H. Sadjadpour
A decentralized coded caching technique is introduced for wireless ad hoc networks in which all the existing contents are randomly combined and cached. The scaling behavior of the network is studied in terms of both capacity and security. Proactive and reactive routing techniques for coded caching are presented and the scaling capacity of the network for each case is derived. It has been shown that by using reactive routing, any content can be retrieved by selecting a random path while providing asymptotic optimum solution. The proposed coded caching significantly simplifies the routing protocol in cached networks. We further prove that asymptotic perfect secrecy can be achieved using proposed coded caching scheme.
{"title":"Secure coded caching in wireless ad hoc networks","authors":"Mohsen Karimzadeh Kiskani, H. Sadjadpour","doi":"10.1109/ICCNC.2017.7876159","DOIUrl":"https://doi.org/10.1109/ICCNC.2017.7876159","url":null,"abstract":"A decentralized coded caching technique is introduced for wireless ad hoc networks in which all the existing contents are randomly combined and cached. The scaling behavior of the network is studied in terms of both capacity and security. Proactive and reactive routing techniques for coded caching are presented and the scaling capacity of the network for each case is derived. It has been shown that by using reactive routing, any content can be retrieved by selecting a random path while providing asymptotic optimum solution. The proposed coded caching significantly simplifies the routing protocol in cached networks. We further prove that asymptotic perfect secrecy can be achieved using proposed coded caching scheme.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125783631","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 : 1900-01-01DOI: 10.1109/ICCNC.2017.7876092
Zonglin Guo, I. Harris, Yutong Jiang, L. Tsaur
As the need for mesh networks for Internet of Things (IoT) applications grows, research in this field attracts more and more attention. Because IoT devices are primarily battery-driven, Bluetooth Low Energy (BLE) networking is appealing to conserve battery life. The importance of battery life in a mobile ad hoc network increases the sensitivity of the network to cyber-attacks intended to impact battery life. A Battery Exhaustion Attack can overwhelmingly exhaust the batteries of network nodes by making malicious service requests. In this paper, we present an intrusion detection and prevention approach for this type of attack. This approach requires the suspicious nodes to switch connection to the neighbors of its connected nodes periodically. When a suspicious node is identified as malicious, it is blacklisted to prevent future attacks. Even when a malicious node cannot be detected, its impact is distributed across the network in order to extend the overall network lifetime.
{"title":"An efficient approach to prevent Battery Exhaustion Attack on BLE-based mesh networks","authors":"Zonglin Guo, I. Harris, Yutong Jiang, L. Tsaur","doi":"10.1109/ICCNC.2017.7876092","DOIUrl":"https://doi.org/10.1109/ICCNC.2017.7876092","url":null,"abstract":"As the need for mesh networks for Internet of Things (IoT) applications grows, research in this field attracts more and more attention. Because IoT devices are primarily battery-driven, Bluetooth Low Energy (BLE) networking is appealing to conserve battery life. The importance of battery life in a mobile ad hoc network increases the sensitivity of the network to cyber-attacks intended to impact battery life. A Battery Exhaustion Attack can overwhelmingly exhaust the batteries of network nodes by making malicious service requests. In this paper, we present an intrusion detection and prevention approach for this type of attack. This approach requires the suspicious nodes to switch connection to the neighbors of its connected nodes periodically. When a suspicious node is identified as malicious, it is blacklisted to prevent future attacks. Even when a malicious node cannot be detected, its impact is distributed across the network in order to extend the overall network lifetime.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127027013","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 : 1900-01-01DOI: 10.1109/ICCNC.2017.7876114
Linxi Zhang, Nan Zhao, Changxing Pei, Long Wang
Quantum cryptography is believed to be unbreakable in theory because of the laws of quantum mechanics. Numerous experiments have demonstrated the feasibility of quantum cryptography and a complete proof of the unconditional security of some main schemes. However, in practice all devices need trusting by each other firstly during the process of quantum key distribution(QKD). For identifying the reliability, we propose a quantum bit commitment protocol that can be regarded as the primitive of authentication protocol in QKD networks. In this protocol we complete bit commitment merely by one agent, and prove the security of the schemes. Compared with other protocols, our schemes have less requirement for additional hardware and lower complexity in implementation.
{"title":"A novel single agent quantum bit commitment scheme","authors":"Linxi Zhang, Nan Zhao, Changxing Pei, Long Wang","doi":"10.1109/ICCNC.2017.7876114","DOIUrl":"https://doi.org/10.1109/ICCNC.2017.7876114","url":null,"abstract":"Quantum cryptography is believed to be unbreakable in theory because of the laws of quantum mechanics. Numerous experiments have demonstrated the feasibility of quantum cryptography and a complete proof of the unconditional security of some main schemes. However, in practice all devices need trusting by each other firstly during the process of quantum key distribution(QKD). For identifying the reliability, we propose a quantum bit commitment protocol that can be regarded as the primitive of authentication protocol in QKD networks. In this protocol we complete bit commitment merely by one agent, and prove the security of the schemes. Compared with other protocols, our schemes have less requirement for additional hardware and lower complexity in implementation.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121352510","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 : 1900-01-01DOI: 10.1109/ICCNC.2017.7876152
Tianlong Song, Yuan Liang, Tongtong Li
This paper considers a game between a power-limited authorized user and a power-limited jammer, who operate independently over the same AWGN channel consisting of multiple bands. We explore the possibility for the authorized user or the jammer to randomly utilize part (or all) of the available spectrum and/or apply nonuniform power allocation. It is found that: either for the authorized user to maximize its capacity, or for the jammer to minimize the capacity of the authorized user, the best strategy for both of them is to distribute the transmission power or jamming power uniformly over all the available spectrum. The minimax capacity can be calculated based on the channel bandwidth and the signal to jamming and noise ratio, and it matches with the Shannon channel capacity formula. Numerical results are provided to illustrate the theoretical analysis.
{"title":"Physical layer security of multiband communications under hostile jamming","authors":"Tianlong Song, Yuan Liang, Tongtong Li","doi":"10.1109/ICCNC.2017.7876152","DOIUrl":"https://doi.org/10.1109/ICCNC.2017.7876152","url":null,"abstract":"This paper considers a game between a power-limited authorized user and a power-limited jammer, who operate independently over the same AWGN channel consisting of multiple bands. We explore the possibility for the authorized user or the jammer to randomly utilize part (or all) of the available spectrum and/or apply nonuniform power allocation. It is found that: either for the authorized user to maximize its capacity, or for the jammer to minimize the capacity of the authorized user, the best strategy for both of them is to distribute the transmission power or jamming power uniformly over all the available spectrum. The minimax capacity can be calculated based on the channel bandwidth and the signal to jamming and noise ratio, and it matches with the Shannon channel capacity formula. Numerical results are provided to illustrate the theoretical analysis.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121924777","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 : 1900-01-01DOI: 10.1109/ICCNC.2017.7876234
Max Hastings, Shuhui Yang
In this paper we demonstrate how limiting the number of copies each message that a node can send out as seen in Spray And Wait can be combined with probabilistic protocols such as Prophet, ProphetV2, and one that we created called Sparse. By limiting the number of copies that each node can send out we allow the routing protocols to scale much better than before when the number of nodes and messages created are increased.
在本文中，我们演示了如何限制节点可以发送的每个消息的副本数量，如Spray And Wait中所见，可以与概率协议(如Prophet, ProphetV2和我们创建的称为Sparse的协议)相结合。通过限制每个节点可以发送的副本数量，当创建的节点和消息数量增加时，我们允许路由协议比以前更好地扩展。
{"title":"Energy-efficient sparse routing protocol for Delay Tolerant Networks","authors":"Max Hastings, Shuhui Yang","doi":"10.1109/ICCNC.2017.7876234","DOIUrl":"https://doi.org/10.1109/ICCNC.2017.7876234","url":null,"abstract":"In this paper we demonstrate how limiting the number of copies each message that a node can send out as seen in Spray And Wait can be combined with probabilistic protocols such as Prophet, ProphetV2, and one that we created called Sparse. By limiting the number of copies that each node can send out we allow the routing protocols to scale much better than before when the number of nodes and messages created are increased.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"116 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129188667","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 : 1900-01-01DOI: 10.1109/ICCNC.2017.7876160
Seydou Ba, Bijoy Chand Chatterjee, E. Oki
The route partitioning scheme for hitless defragmentation have been introduced to increase the admissible traffic load in elastic optical networks. It facilitates the defragmentation of the spectrum through spectrum retuning. This paper further investigates the performance of the route partitioning scheme. For the heuristic algorithm, where we seek a maximum cut, we use the Goemans/Williamson relaxation algorithm, which has a 0.878 approximation factor for maximum cut. We implement the parallel retuning to speed up the retuning process, and investigate the effects of the network characteristics on the route partitioning performances. Results show that the approximation algorithm provides the optimal cut for most networks and that the route partitioning scheme with parallel retuning offers up to 9% added traffic load compared to the conventional one.
{"title":"Performance of route partitioning scheme for hitless defragmentation in elastic optical networks","authors":"Seydou Ba, Bijoy Chand Chatterjee, E. Oki","doi":"10.1109/ICCNC.2017.7876160","DOIUrl":"https://doi.org/10.1109/ICCNC.2017.7876160","url":null,"abstract":"The route partitioning scheme for hitless defragmentation have been introduced to increase the admissible traffic load in elastic optical networks. It facilitates the defragmentation of the spectrum through spectrum retuning. This paper further investigates the performance of the route partitioning scheme. For the heuristic algorithm, where we seek a maximum cut, we use the Goemans/Williamson relaxation algorithm, which has a 0.878 approximation factor for maximum cut. We implement the parallel retuning to speed up the retuning process, and investigate the effects of the network characteristics on the route partitioning performances. Results show that the approximation algorithm provides the optimal cut for most networks and that the route partitioning scheme with parallel retuning offers up to 9% added traffic load compared to the conventional one.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127696984","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 : 1900-01-01DOI: 10.1109/ICCNC.2017.7876161
Chengjun Li, W. Guo, Wei Wang, Weisheng Hu, Ming Xia
Passive optical network (PON) deployment requires significant capital and operational costs for operators to provide high network capacity and significant geographic coverage. Network sharing is desirable for operators to reduce the investment needed to deploy and operate PON networks. In this paper, we introduce a bandwidth resource sharing framework for XG-PONs among multiple operators. In this framework, each transmission convergence (TC) frame with fixed time slots (125us) is regarded as a bandwidth slice. We proposed two slice scheduling schemes for network infrastructure provider to assign slices to different operators. Our proposed scheme meets three key requirements of network virtualization: isolation, customization and efficient resource utilization. We analyze the details of this scheme and provide discrete event simulation results to support the analysis. Results show the efficacy in isolation and resource utilization and the flexibility of running different customized algorithms within slices on the same shared network equipment.
{"title":"PON bandwidth resource sharing schemes in a multi-operator scenario","authors":"Chengjun Li, W. Guo, Wei Wang, Weisheng Hu, Ming Xia","doi":"10.1109/ICCNC.2017.7876161","DOIUrl":"https://doi.org/10.1109/ICCNC.2017.7876161","url":null,"abstract":"Passive optical network (PON) deployment requires significant capital and operational costs for operators to provide high network capacity and significant geographic coverage. Network sharing is desirable for operators to reduce the investment needed to deploy and operate PON networks. In this paper, we introduce a bandwidth resource sharing framework for XG-PONs among multiple operators. In this framework, each transmission convergence (TC) frame with fixed time slots (125us) is regarded as a bandwidth slice. We proposed two slice scheduling schemes for network infrastructure provider to assign slices to different operators. Our proposed scheme meets three key requirements of network virtualization: isolation, customization and efficient resource utilization. We analyze the details of this scheme and provide discrete event simulation results to support the analysis. Results show the efficacy in isolation and resource utilization and the flexibility of running different customized algorithms within slices on the same shared network equipment.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117032975","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 : 1900-01-01DOI: 10.1109/ICCNC.2017.7876115
Mahdi H. Al-Badrawi, N. Kirsch, Bessam Z. Al-Jewad
In this paper, the filtering characteristics of Empirical Mode Decomposition (EMD) are used to create a blind and adaptive energy detector for single or multi-channel spectrum sensing. EMD is an adaptive tool that decomposes time-series signals into a set of modes called Intrinsic Mode Functions (IMF). Due to the EMD filtering behavior, the first IMF is mostly contaminated by noise from the received noisy signal. The proposed approach takes advantage of Cell Averaging Constant False Alarm Rate (CA-CFAR) as an optimal detector to enhance the probability of detection. Alternative to conventional CA-CFAR (which requires at least one nearby vacant channel for good noise estimation), the first IMF will be used as a training function for noise estimation purposes. Based on the first IMF characteristics in frequency domain, the noise floor of the received signal is estimated and a threshold is derived for a given false alarm rate. Simulations show the improvement of the proposed detector in comparison with other conventional detectors.
{"title":"An Intrinsic Mode Function based energy detector for spectrum sensing in cognitive radio","authors":"Mahdi H. Al-Badrawi, N. Kirsch, Bessam Z. Al-Jewad","doi":"10.1109/ICCNC.2017.7876115","DOIUrl":"https://doi.org/10.1109/ICCNC.2017.7876115","url":null,"abstract":"In this paper, the filtering characteristics of Empirical Mode Decomposition (EMD) are used to create a blind and adaptive energy detector for single or multi-channel spectrum sensing. EMD is an adaptive tool that decomposes time-series signals into a set of modes called Intrinsic Mode Functions (IMF). Due to the EMD filtering behavior, the first IMF is mostly contaminated by noise from the received noisy signal. The proposed approach takes advantage of Cell Averaging Constant False Alarm Rate (CA-CFAR) as an optimal detector to enhance the probability of detection. Alternative to conventional CA-CFAR (which requires at least one nearby vacant channel for good noise estimation), the first IMF will be used as a training function for noise estimation purposes. Based on the first IMF characteristics in frequency domain, the noise floor of the received signal is estimated and a threshold is derived for a given false alarm rate. Simulations show the improvement of the proposed detector in comparison with other conventional detectors.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127386083","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 : 1900-01-01DOI: 10.1109/ICCNC.2017.7876181
U. Hashmi, Arsalan Darbandi, A. Imran
Self-healing is a key desirable feature in emerging communication networks. While legacy self-healing mechanisms that are reactive in nature can minimize recovery time substantially, the recently conceived extremely low latency and high Quality of Experience (QoE) requirements call for self-healing mechanisms that are pro-active instead of reactive thereby enabling minimal recovery times. A corner stone in enabling proactive self-healing is predictive analytics of historical network failure logs (NFL). In current networks NFL data remains mostly dark, i.e., though they are stored but they are not exploited to their full potential. In this paper, we present a case study that investigates spatio-temporal trends in a large NFL database of a nationwide broadband operator. To discover hidden patterns in the data we leverage five different unsupervised pattern recognition and clustering along with density based outlier detection techniques namely: K-means clustering, Fuzzy C-means clustering, Local Outlier Factor, Local Outlier Probabilities and Kohonen's Self Organizing Maps. Results indicate that self-organizing maps with local outlier probabilities outperform K-means and Fuzzy C-means clustering in terms of sum of squared errors (SSE) and Davis Boulden index (DBI) values. Through an extensive data analysis leveraging a rich combination of the aforementioned techniques, we extract trends that can enable the operator to proactively tackle similar faults in future and improve QoE and recovery times and minimize operational costs, thereby paving the way towards proactive self-healing.
{"title":"Enabling proactive self-healing by data mining network failure logs","authors":"U. Hashmi, Arsalan Darbandi, A. Imran","doi":"10.1109/ICCNC.2017.7876181","DOIUrl":"https://doi.org/10.1109/ICCNC.2017.7876181","url":null,"abstract":"Self-healing is a key desirable feature in emerging communication networks. While legacy self-healing mechanisms that are reactive in nature can minimize recovery time substantially, the recently conceived extremely low latency and high Quality of Experience (QoE) requirements call for self-healing mechanisms that are pro-active instead of reactive thereby enabling minimal recovery times. A corner stone in enabling proactive self-healing is predictive analytics of historical network failure logs (NFL). In current networks NFL data remains mostly dark, i.e., though they are stored but they are not exploited to their full potential. In this paper, we present a case study that investigates spatio-temporal trends in a large NFL database of a nationwide broadband operator. To discover hidden patterns in the data we leverage five different unsupervised pattern recognition and clustering along with density based outlier detection techniques namely: K-means clustering, Fuzzy C-means clustering, Local Outlier Factor, Local Outlier Probabilities and Kohonen's Self Organizing Maps. Results indicate that self-organizing maps with local outlier probabilities outperform K-means and Fuzzy C-means clustering in terms of sum of squared errors (SSE) and Davis Boulden index (DBI) values. Through an extensive data analysis leveraging a rich combination of the aforementioned techniques, we extract trends that can enable the operator to proactively tackle similar faults in future and improve QoE and recovery times and minimize operational costs, thereby paving the way towards proactive self-healing.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125241841","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 : 1900-01-01DOI: 10.1109/ICCNC.2017.7876155
Mihaela Lozonavu, Martha Vlachou-Konchylaki, Vincent A. Huang
In telecommunication network systems, there are a large number of interconnected components which also contain many subcomponents. Heavy rain, thunder or other factors can cause mal-function of the components or disconnections between the components which trigger alarms. Because of the interconnection of elements, triggered alarms may propagate to other components. This creates harsh challenges to network operators when it comes to root cause analysis. We address this issue by proposing a method on utilizing network alarms for automatic relation discovery between network nodes. By understanding how network elements or network problems are related to each other, a network operator can easily correlate the alarm events and treat clustered groups of alarms instead of specific events. In this study, we use the temporal and spatial aspects of alarm events to cluster network elements. Our results demonstrate that by analyzing the network alarms, a relationship graph showing the connections between different network elements and network problems can be automatically generated. Such relationship graphs can help network operators mining node dependencies and discovering insights within their network.
{"title":"Relation discovery of mobile network alarms with sequential pattern mining","authors":"Mihaela Lozonavu, Martha Vlachou-Konchylaki, Vincent A. Huang","doi":"10.1109/ICCNC.2017.7876155","DOIUrl":"https://doi.org/10.1109/ICCNC.2017.7876155","url":null,"abstract":"In telecommunication network systems, there are a large number of interconnected components which also contain many subcomponents. Heavy rain, thunder or other factors can cause mal-function of the components or disconnections between the components which trigger alarms. Because of the interconnection of elements, triggered alarms may propagate to other components. This creates harsh challenges to network operators when it comes to root cause analysis. We address this issue by proposing a method on utilizing network alarms for automatic relation discovery between network nodes. By understanding how network elements or network problems are related to each other, a network operator can easily correlate the alarm events and treat clustered groups of alarms instead of specific events. In this study, we use the temporal and spatial aspects of alarm events to cluster network elements. Our results demonstrate that by analyzing the network alarms, a relationship graph showing the connections between different network elements and network problems can be automatically generated. Such relationship graphs can help network operators mining node dependencies and discovering insights within their network.","PeriodicalId":135028,"journal":{"name":"2017 International Conference on Computing, Networking and Communications (ICNC)","volume":"153 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121813809","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
扫码关注我们
求助内容：
应助结果提醒方式：