A scheduling-based event correlation scheme for fault identification in communications network

IF 4.3 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Computer Communications Pub Date : 1999-04-15 DOI:10.1016/S0140-3664(99)00045-6
C.-C. Lo, S.-H. Chen
{"title":"A scheduling-based event correlation scheme for fault identification in communications network","authors":"C.-C. Lo,&nbsp;S.-H. Chen","doi":"10.1016/S0140-3664(99)00045-6","DOIUrl":null,"url":null,"abstract":"<div><p><span>Communications network<span> has increased dramatically in size and complexity in the past few years. A typical network may consist of hundreds of nodes from various manufacturers with different traffic and bandwidth requirements. The increasing complexity poses serious problems to network management and control. As faults are inevitable, quick detection, identification and recovery are crucial to make the systems more robust and their operation more reliable. This article proposes a novel event correlation scheme for fault identification in communications network. This scheme is based on the bi-level feedback queues scheduling policy. The causality graph model is used to describe the cause-and-effect relationships between network events. The use of scheduling policy makes the correlation process simple and fast. A simulation model is developed to verify the effectiveness and efficiency of the proposed scheme. From simulation results, we notice that this scheme not only identifies multiple problems at one time but also is insensitive to noise. As the time complexity of the correlation procedure is close to a function of </span></span><em>n</em>, where <em>n</em> is the number of observed symptoms, with order O(<em>n</em>); therefore, the on-line fault identification is easy to achieve.</p></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"22 5","pages":"Pages 432-438"},"PeriodicalIF":4.3000,"publicationDate":"1999-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0140-3664(99)00045-6","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Communications","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0140366499000456","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 9

Abstract

Communications network has increased dramatically in size and complexity in the past few years. A typical network may consist of hundreds of nodes from various manufacturers with different traffic and bandwidth requirements. The increasing complexity poses serious problems to network management and control. As faults are inevitable, quick detection, identification and recovery are crucial to make the systems more robust and their operation more reliable. This article proposes a novel event correlation scheme for fault identification in communications network. This scheme is based on the bi-level feedback queues scheduling policy. The causality graph model is used to describe the cause-and-effect relationships between network events. The use of scheduling policy makes the correlation process simple and fast. A simulation model is developed to verify the effectiveness and efficiency of the proposed scheme. From simulation results, we notice that this scheme not only identifies multiple problems at one time but also is insensitive to noise. As the time complexity of the correlation procedure is close to a function of n, where n is the number of observed symptoms, with order O(n); therefore, the on-line fault identification is easy to achieve.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一种基于调度的通信网络故障识别方法
在过去几年中,通信网络的规模和复杂性急剧增加。一个典型的网络可能由来自不同制造商的数百个节点组成,这些节点具有不同的流量和带宽需求。网络的复杂性给网络的管理和控制带来了严重的问题。由于故障是不可避免的,快速检测、识别和恢复对于提高系统的鲁棒性和运行可靠性至关重要。提出了一种用于通信网络故障识别的事件相关算法。该方案基于双级反馈队列调度策略。因果图模型用于描述网络事件之间的因果关系。调度策略的使用使得关联过程简单、快速。通过仿真模型验证了该方案的有效性和高效性。仿真结果表明,该方法不仅能同时识别多个问题,而且对噪声不敏感。由于相关过程的时间复杂度接近于n的函数,其中n为观察到的症状个数,阶为O(n);因此,在线故障识别很容易实现。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Computer Communications
Computer Communications 工程技术-电信学
CiteScore
14.10
自引率
5.00%
发文量
397
审稿时长
66 days
期刊介绍: Computer and Communications networks are key infrastructures of the information society with high socio-economic value as they contribute to the correct operations of many critical services (from healthcare to finance and transportation). Internet is the core of today''s computer-communication infrastructures. This has transformed the Internet, from a robust network for data transfer between computers, to a global, content-rich, communication and information system where contents are increasingly generated by the users, and distributed according to human social relations. Next-generation network technologies, architectures and protocols are therefore required to overcome the limitations of the legacy Internet and add new capabilities and services. The future Internet should be ubiquitous, secure, resilient, and closer to human communication paradigms. Computer Communications is a peer-reviewed international journal that publishes high-quality scientific articles (both theory and practice) and survey papers covering all aspects of future computer communication networks (on all layers, except the physical layer), with a special attention to the evolution of the Internet architecture, protocols, services, and applications.
期刊最新文献
Editorial Board A metaheuristic study: A partial multitask offloading strategy for vehicular fog computing based on adaptive particle swarm optimization Streaming algorithm and hardware accelerator for high-throughput entropy estimation of network flows in sliding windows FMSformer: Frequency-aware multi-scale spatio temporal correlation model for edge workload prediction A multiclass cost–latency aware framework for multi-tiered cloud storage optimization via access pattern forecasting
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1