{"title":"是否更新网络状态?","authors":"B. Fu, F. Kuipers, P. Mieghem","doi":"10.1109/ITNEWS.2008.4488158","DOIUrl":null,"url":null,"abstract":"A Link-State Update Policy (LSUP) has the task to distribute information regarding the network resources, and is therefore considered to be an integral part of future Quality of Service (QoS) routing protocols. The argument is that in order to guarantee QoS to applications, one must know the available resources. Unfortunately, the high dynamics in available resources complicates the development of an LSUP, which on its turn will result in high deployment costs for Internet Service Providers. In this paper we will re-examine whether the gain in network performance, which is expected under the deployment of LSUPs, will outweigh its investment and complexity costs. To capture the complete range of possible LSUPs, we take a pragmatic approach and confine ourselves to examining two extreme strategies: routing with exact resource information and routing with no resource information. Our study comprises of an analytical exercise and extensive simulations on various network topologies under a large range of network loads. Our objective is to determine where static information provides acceptable network performance and where dynamic LSUPs are indispensable.","PeriodicalId":255580,"journal":{"name":"2008 4th International Telecommunication Networking Workshop on QoS in Multiservice IP Networks","volume":"53 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"To update network state or not?\",\"authors\":\"B. Fu, F. Kuipers, P. Mieghem\",\"doi\":\"10.1109/ITNEWS.2008.4488158\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A Link-State Update Policy (LSUP) has the task to distribute information regarding the network resources, and is therefore considered to be an integral part of future Quality of Service (QoS) routing protocols. The argument is that in order to guarantee QoS to applications, one must know the available resources. Unfortunately, the high dynamics in available resources complicates the development of an LSUP, which on its turn will result in high deployment costs for Internet Service Providers. In this paper we will re-examine whether the gain in network performance, which is expected under the deployment of LSUPs, will outweigh its investment and complexity costs. To capture the complete range of possible LSUPs, we take a pragmatic approach and confine ourselves to examining two extreme strategies: routing with exact resource information and routing with no resource information. Our study comprises of an analytical exercise and extensive simulations on various network topologies under a large range of network loads. Our objective is to determine where static information provides acceptable network performance and where dynamic LSUPs are indispensable.\",\"PeriodicalId\":255580,\"journal\":{\"name\":\"2008 4th International Telecommunication Networking Workshop on QoS in Multiservice IP Networks\",\"volume\":\"53 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-04-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 4th International Telecommunication Networking Workshop on QoS in Multiservice IP Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITNEWS.2008.4488158\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 4th International Telecommunication Networking Workshop on QoS in Multiservice IP Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITNEWS.2008.4488158","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

链路状态更新策略(LSUP)的任务是分发有关网络资源的信息,因此被认为是未来服务质量(QoS)路由协议的一个组成部分。争论在于,为了保证应用程序的QoS,必须知道可用的资源。不幸的是,可用资源的高度动态使LSUP的开发变得复杂,这反过来又会导致Internet服务提供商的高部署成本。在本文中,我们将重新研究在lsup部署下预期的网络性能收益是否会超过其投资和复杂性成本。为了捕获所有可能的lsup,我们采取了一种实用的方法,并将自己限制在检查两种极端策略:具有精确资源信息的路由和没有资源信息的路由。我们的研究包括分析练习和在大范围网络负载下对各种网络拓扑结构的广泛模拟。我们的目标是确定哪些静态信息提供了可接受的网络性能,哪些动态lsup是必不可少的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
To update network state or not?
A Link-State Update Policy (LSUP) has the task to distribute information regarding the network resources, and is therefore considered to be an integral part of future Quality of Service (QoS) routing protocols. The argument is that in order to guarantee QoS to applications, one must know the available resources. Unfortunately, the high dynamics in available resources complicates the development of an LSUP, which on its turn will result in high deployment costs for Internet Service Providers. In this paper we will re-examine whether the gain in network performance, which is expected under the deployment of LSUPs, will outweigh its investment and complexity costs. To capture the complete range of possible LSUPs, we take a pragmatic approach and confine ourselves to examining two extreme strategies: routing with exact resource information and routing with no resource information. Our study comprises of an analytical exercise and extensive simulations on various network topologies under a large range of network loads. Our objective is to determine where static information provides acceptable network performance and where dynamic LSUPs are indispensable.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A push-based scheduling algorithm for large scale P2P live streaming Novel traffic engineering scheme based upon application flows for QoS enhancement Quality of provisioning as an OPEX-related issue in research networks Coping with distributed monitoring of QoS-enabled heterogeneous networks Multi-chip multicast schedulers in input-queued switches
×
引用
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