{"title":"基于属性序列的网络(树)拓扑推理","authors":"Vanniarajan Chellappan, K. Krithivasan","doi":"10.1109/NCC.2010.5430177","DOIUrl":null,"url":null,"abstract":"Network topology discovery is the basis for any network management application. The problem of estimating internal structure and link-level performance from end-to-end measurements is known as network tomography. This paper proposes a novel approach to discover network characteristics, in particular, tree topology from the hop count metric (distance) between OD (Origin — Destination) pairs. The proposed method is based on Prüfer encoding and decoding techniques of trees using this metric. The method also has the potential to minimize and avoid reliance on ICMP.","PeriodicalId":130953,"journal":{"name":"2010 National Conference On Communications (NCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Network (tree) topology inference based on Prüfer sequence\",\"authors\":\"Vanniarajan Chellappan, K. Krithivasan\",\"doi\":\"10.1109/NCC.2010.5430177\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Network topology discovery is the basis for any network management application. The problem of estimating internal structure and link-level performance from end-to-end measurements is known as network tomography. This paper proposes a novel approach to discover network characteristics, in particular, tree topology from the hop count metric (distance) between OD (Origin — Destination) pairs. The proposed method is based on Prüfer encoding and decoding techniques of trees using this metric. The method also has the potential to minimize and avoid reliance on ICMP.\",\"PeriodicalId\":130953,\"journal\":{\"name\":\"2010 National Conference On Communications (NCC)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-03-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 National Conference On Communications (NCC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NCC.2010.5430177\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 National Conference On Communications (NCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NCC.2010.5430177","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Network (tree) topology inference based on Prüfer sequence
Network topology discovery is the basis for any network management application. The problem of estimating internal structure and link-level performance from end-to-end measurements is known as network tomography. This paper proposes a novel approach to discover network characteristics, in particular, tree topology from the hop count metric (distance) between OD (Origin — Destination) pairs. The proposed method is based on Prüfer encoding and decoding techniques of trees using this metric. The method also has the potential to minimize and avoid reliance on ICMP.