Utility of algebraic connectivity metric in topology design of survivable networks

William Liu, H. Sirisena, K. Pawlikowski, Allan McInnes
{"title":"Utility of algebraic connectivity metric in topology design of survivable networks","authors":"William Liu, H. Sirisena, K. Pawlikowski, Allan McInnes","doi":"10.1109/DRCN.2009.5340016","DOIUrl":null,"url":null,"abstract":"In studies of survivable networks, it is important to be able to differentiate network topologies by means of a robust numerical measure that indicates the levels of immunity of these topologies to failures of their nodes and links. Ideally, such a measure should be sensitive to the existence of nodes or links which are more important than others, for example, if their failures cause the network's disintegration. In this paper, we suggest using an algebraic connectivity metric, adopted from spectral graph theory, namely the 2nd smallest eigenvalue of the Laplacian matrix of the network topology, instead of the average nodal degree that is usually used to characterize network connectivity in studies of the spare capacity allocation problem. Extensive simulation studies confirm that this metric is a more informative and more accurate parameter than the average nodal degree for characterizing network topologies in survivability studies.","PeriodicalId":227820,"journal":{"name":"2009 7th International Workshop on Design of Reliable Communication Networks","volume":"37 4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"38","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 7th International Workshop on Design of Reliable Communication Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DRCN.2009.5340016","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 38

Abstract

In studies of survivable networks, it is important to be able to differentiate network topologies by means of a robust numerical measure that indicates the levels of immunity of these topologies to failures of their nodes and links. Ideally, such a measure should be sensitive to the existence of nodes or links which are more important than others, for example, if their failures cause the network's disintegration. In this paper, we suggest using an algebraic connectivity metric, adopted from spectral graph theory, namely the 2nd smallest eigenvalue of the Laplacian matrix of the network topology, instead of the average nodal degree that is usually used to characterize network connectivity in studies of the spare capacity allocation problem. Extensive simulation studies confirm that this metric is a more informative and more accurate parameter than the average nodal degree for characterizing network topologies in survivability studies.
代数连通性度量在可生存网络拓扑设计中的应用
在可生存网络的研究中,重要的是能够通过一个鲁棒的数值度量来区分网络拓扑,该数值度量表明这些拓扑对其节点和链路故障的免疫水平。理想情况下,这种措施应该对比其他节点或链路更重要的节点或链路的存在敏感,例如,如果它们的故障导致网络解体。在本文中,我们建议使用谱图理论中的代数连通性度量,即网络拓扑的拉普拉斯矩阵的第二小特征值,而不是在研究备用容量分配问题时通常用来表征网络连通性的平均节点度。大量的仿真研究证实,在生存性研究中,该度量比平均节点度更能提供信息,更准确地表征网络拓扑结构。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信