{"title":"时变网络断层扫描:路由器链路数据","authors":"Jin Cao, Drew Davis, Scott Vander Wiel, Bing Yu","doi":"10.1080/01621459.2000.10474303","DOIUrl":null,"url":null,"abstract":"In a computer network, the traffic matrix or the origin-destination (OD) byte counts are important statistics needed for design, routing, configuration debugging, monitoring and pricing. However, they are not easily available. For a fixed routing scheme, a statistical inverse algorithm is proposed and validated to estimate the traffic matrix from the easily collectable link counts which are aggregations of the origin-destination counts.","PeriodicalId":108752,"journal":{"name":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","volume":"218 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"341","resultStr":"{\"title\":\"Time-varying network tomography: router link data\",\"authors\":\"Jin Cao, Drew Davis, Scott Vander Wiel, Bing Yu\",\"doi\":\"10.1080/01621459.2000.10474303\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In a computer network, the traffic matrix or the origin-destination (OD) byte counts are important statistics needed for design, routing, configuration debugging, monitoring and pricing. However, they are not easily available. For a fixed routing scheme, a statistical inverse algorithm is proposed and validated to estimate the traffic matrix from the easily collectable link counts which are aggregations of the origin-destination counts.\",\"PeriodicalId\":108752,\"journal\":{\"name\":\"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)\",\"volume\":\"218 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2000-06-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"341\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1080/01621459.2000.10474303\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/01621459.2000.10474303","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
In a computer network, the traffic matrix or the origin-destination (OD) byte counts are important statistics needed for design, routing, configuration debugging, monitoring and pricing. However, they are not easily available. For a fixed routing scheme, a statistical inverse algorithm is proposed and validated to estimate the traffic matrix from the easily collectable link counts which are aggregations of the origin-destination counts.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
