一种新的拓扑聚合QoS逼近方法

Jingjun Zhang, Yuanbin Han, Liguo Wang
{"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}
引用次数: 0

摘要

分层网络中的拓扑聚合被认为是减少状态信息存储的一种有效方法。然而,它也引入了与原始信息的偏差。为了在拓扑聚合的信息约简和精度之间找到最优平衡点,本文提出了两种基于近似阶梯概念的逼近方法。利用最小二乘法形成的近似阶梯表示QoS支持区域,将每个域压缩成一个完整的网格拓扑结构。性能分析和实验结果表明,与现有方法相比,该方法在不增加空间复杂度和时间复杂度的前提下,可以最大限度地减少信息失真。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Measured impedance by distance relay for inter phase faults in presence of SSSC on a double circuit transmission line A parallel architecture for successive elimination block matching algorithm An RNS based transform architecture for H.264/AVC Routing protocol enhancement for handling node mobility in wireless sensor networks MPEG-21-based scalable bitstream adaptation using medium grain scalability
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1