{"title":"一种新的拓扑聚合QoS逼近方法","authors":"Jingjun Zhang, Yuanbin Han, Liguo Wang","doi":"10.1109/TENCON.2008.4766752","DOIUrl":null,"url":null,"abstract":"Topology aggregation in hierarchical networks has been recognized as an effective way for the purpose of reducing the storage of state information. However, it also introduces deviation from original information. To find the optimal tradeoff between information reduction and accuracy for topology aggregation, two novel approximation approaches based on the conception of approximation staircase was proposed in this paper. The approximation staircase formed by least square method is used to represent the QoS supported area to compress each domain into a full mesh topology. Both the performance analysis and experimental results show that the proposed approaches can minimize more information distortion without increasing the space complexity and time complexity than existing approaches.","PeriodicalId":22230,"journal":{"name":"TENCON 2008 - 2008 IEEE Region 10 Conference","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2008-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"New QoS approximation approach for topology aggregation\",\"authors\":\"Jingjun Zhang, Yuanbin Han, Liguo Wang\",\"doi\":\"10.1109/TENCON.2008.4766752\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Topology aggregation in hierarchical networks has been recognized as an effective way for the purpose of reducing the storage of state information. However, it also introduces deviation from original information. To find the optimal tradeoff between information reduction and accuracy for topology aggregation, two novel approximation approaches based on the conception of approximation staircase was proposed in this paper. The approximation staircase formed by least square method is used to represent the QoS supported area to compress each domain into a full mesh topology. Both the performance analysis and experimental results show that the proposed approaches can minimize more information distortion without increasing the space complexity and time complexity than existing approaches.\",\"PeriodicalId\":22230,\"journal\":{\"name\":\"TENCON 2008 - 2008 IEEE Region 10 Conference\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"TENCON 2008 - 2008 IEEE Region 10 Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TENCON.2008.4766752\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"TENCON 2008 - 2008 IEEE Region 10 Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TENCON.2008.4766752","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
New QoS approximation approach for topology aggregation
Topology aggregation in hierarchical networks has been recognized as an effective way for the purpose of reducing the storage of state information. However, it also introduces deviation from original information. To find the optimal tradeoff between information reduction and accuracy for topology aggregation, two novel approximation approaches based on the conception of approximation staircase was proposed in this paper. The approximation staircase formed by least square method is used to represent the QoS supported area to compress each domain into a full mesh topology. Both the performance analysis and experimental results show that the proposed approaches can minimize more information distortion without increasing the space complexity and time complexity than existing approaches.