Alarm correlation for congestion diagnosis in ATM networks

Ying-Dar Lin, R. Yang, Chi-Chun Lo
{"title":"Alarm correlation for congestion diagnosis in ATM networks","authors":"Ying-Dar Lin, R. Yang, Chi-Chun Lo","doi":"10.1109/NOMS.1996.539635","DOIUrl":null,"url":null,"abstract":"We examine the tradeoff between fine-grade and coarse-grade OAM measurements. The fine-grade OAM measurement, with the overhead of voluminous measurement information, leads to pin-pointed identification when problems occur; while with coarse-grade OAM measurement, without detailed information, one needs to correlate many alarms which may be triggered by a single problem. Alarm correlation, however, requires some heuristics for problem diagnosis and has some degree of uncertainty. Taking VP (virtual path) congestion diagnosis as our target example, we present the path intersection heuristics as the alarm correlation method used to analyze the congestion alarms and locate the congestion areas. Our simulation results show that the intersection heuristics with output link consideration locates the congestion nodes precisely. We also analyze the congestion pattern and find that the congestion area has the tendency of expanding from one node to its neighbors. After identifying the congested nodes, we apply three methods to choose the congested VPCs for rerouting. The results show that the method of less summed capacity performs the best in terms of the average rerouted capacity.","PeriodicalId":110797,"journal":{"name":"Proceedings of NOMS '96 - IEEE Network Operations and Management Symposium","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1996-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of NOMS '96 - IEEE Network Operations and Management Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NOMS.1996.539635","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

We examine the tradeoff between fine-grade and coarse-grade OAM measurements. The fine-grade OAM measurement, with the overhead of voluminous measurement information, leads to pin-pointed identification when problems occur; while with coarse-grade OAM measurement, without detailed information, one needs to correlate many alarms which may be triggered by a single problem. Alarm correlation, however, requires some heuristics for problem diagnosis and has some degree of uncertainty. Taking VP (virtual path) congestion diagnosis as our target example, we present the path intersection heuristics as the alarm correlation method used to analyze the congestion alarms and locate the congestion areas. Our simulation results show that the intersection heuristics with output link consideration locates the congestion nodes precisely. We also analyze the congestion pattern and find that the congestion area has the tendency of expanding from one node to its neighbors. After identifying the congested nodes, we apply three methods to choose the congested VPCs for rerouting. The results show that the method of less summed capacity performs the best in terms of the average rerouted capacity.
基于告警关联的ATM网络拥塞诊断
我们研究了精细级和粗级OAM测量之间的权衡。精细的OAM测量,由于需要大量的测量信息,因此在出现问题时可以精确地识别;而对于粗级OAM测量,由于没有详细的信息,需要将多个可能由单个问题触发的警报关联起来。然而,警报相关性需要一些启发式的问题诊断,并有一定程度的不确定性。以虚拟路径(VP)拥塞诊断为例,提出了路径交叉启发式算法作为告警关联方法,用于分析拥塞告警并定位拥塞区域。仿真结果表明,考虑输出链路的交叉口启发式算法能够准确定位拥塞节点。分析了拥塞模式,发现拥塞区域有从一个节点向相邻节点扩展的趋势。在识别出拥塞节点后,我们采用三种方法选择拥塞的vpc进行路由重路由。结果表明,对于平均重路由容量而言,容量总和较小的方法性能最好。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书