{"title":"基于伪流量矩阵估计的路由推断","authors":"Ziqian Liu, Changjia Chen","doi":"10.1109/AINA.2006.291","DOIUrl":null,"url":null,"abstract":"Routing information is so crucial to an operational network that it is always regarded as confidential by network administrators. This paper proposes a novel routing inference method that only needs the knowledge of the network topology and the link counts, both of which can be obtained from MRTG (multi-router traffic grahper) data. The insight is that the traffic observed on each link arises from the superposition of the traffic demands between the origin-destination (OD) pairs and each traffic demand corresponds to a unique path. The method employs expectation maximization (EM) algorithm cooperating with a hypothetic pseudo routing scheme, which is expected to embrace the real routing, to compute a pseudo traffic matrix. The real routing then can be conjectured from this pseudo traffic matrix. This method is applied to a real IP network, and the results show that it correctly infers the routings for 87% OD pairs.","PeriodicalId":185969,"journal":{"name":"20th International Conference on Advanced Information Networking and Applications - Volume 1 (AINA'06)","volume":"309 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Routing inference based on pseudo traffic matrix estimation\",\"authors\":\"Ziqian Liu, Changjia Chen\",\"doi\":\"10.1109/AINA.2006.291\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Routing information is so crucial to an operational network that it is always regarded as confidential by network administrators. This paper proposes a novel routing inference method that only needs the knowledge of the network topology and the link counts, both of which can be obtained from MRTG (multi-router traffic grahper) data. The insight is that the traffic observed on each link arises from the superposition of the traffic demands between the origin-destination (OD) pairs and each traffic demand corresponds to a unique path. The method employs expectation maximization (EM) algorithm cooperating with a hypothetic pseudo routing scheme, which is expected to embrace the real routing, to compute a pseudo traffic matrix. The real routing then can be conjectured from this pseudo traffic matrix. This method is applied to a real IP network, and the results show that it correctly infers the routings for 87% OD pairs.\",\"PeriodicalId\":185969,\"journal\":{\"name\":\"20th International Conference on Advanced Information Networking and Applications - Volume 1 (AINA'06)\",\"volume\":\"309 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-04-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"20th International Conference on Advanced Information Networking and Applications - Volume 1 (AINA'06)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/AINA.2006.291\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"20th International Conference on Advanced Information Networking and Applications - Volume 1 (AINA'06)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AINA.2006.291","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Routing inference based on pseudo traffic matrix estimation
Routing information is so crucial to an operational network that it is always regarded as confidential by network administrators. This paper proposes a novel routing inference method that only needs the knowledge of the network topology and the link counts, both of which can be obtained from MRTG (multi-router traffic grahper) data. The insight is that the traffic observed on each link arises from the superposition of the traffic demands between the origin-destination (OD) pairs and each traffic demand corresponds to a unique path. The method employs expectation maximization (EM) algorithm cooperating with a hypothetic pseudo routing scheme, which is expected to embrace the real routing, to compute a pseudo traffic matrix. The real routing then can be conjectured from this pseudo traffic matrix. This method is applied to a real IP network, and the results show that it correctly infers the routings for 87% OD pairs.