【24h】

Conditions for Identifiability of Mixed Graphs using Simple Paths

机译:使用简单路径的混合图标识的条件

获取原文
获取外文期刊封面目录资料

摘要

Network Tomography is an upcoming field to identify link metrics and improve the quality of network monitoring. From linear algebra, we know that, if the number of unknown link metrics is equal to the number of links within the network, then the network is uniquely identifiable. Previous works include identifying link metrics of networks, in which the links were either undirected or directed bidirectional. By keeping in mind that the link metrics are additive and constant, the focus of this paper is on mixed networks with both undirected and directed unidirectional paths. The method employed involves dividing the network into subgraphs and obtaining the conditions of identifiability on the network without the inclusion of monitoring cycles.
机译:网络断层扫描是即将识别链接指标并提高网络监控质量的现场。从线性代数,我们知道,如果未知链路指标的数量等于网络内的链路数量,则网络是唯一可识别的。以前的作品包括识别网络的链路指标,其中链接是无向或指向双向的。通过记住,链路指标是附加和常数,本文的焦点在于具有无向网络的混合网络上,无向量和指向的单向路径。所采用的方法包括将网络划分为子图并获得网络上的可识别性条件而不包含监测周期。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号