基于多源渐近的可选接纳规则

Gergely Seres, Árpád Szlávik, J. Zátonyi, J. Bíró
{"title":"基于多源渐近的可选接纳规则","authors":"Gergely Seres, Árpád Szlávik, J. Zátonyi, J. Bíró","doi":"10.1109/ISCC.2002.1021793","DOIUrl":null,"url":null,"abstract":"This paper identifies the requirements placed against a resource manager function for use in QoS-enabled IP networks. The structure of the Internet and the composition of the services motivate the development of on-line resource brokers that can make admission decisions in real time, based on the best up-to-date information available on the state of the network. The difficulties with traffic models and traffic characterisation stimulate the use of measurement-based techniques that bypass the modelling step and provide the resource requirements of the traffic directly. The paper introduces a novel method for the computation of the bandwidth requirement of Internet traffic flows using the many sources asymptotics. The estimator method significantly reduces the computational complexity of the calculations, allowing the real-time operation of the algorithm even in a measurement-based environment. The method delivers bandwidth-type quantity, the format preferred by Internet control applications. The savings arising from the reduced computational complexity compared to existing methods are demonstrated in a numerical example.","PeriodicalId":261743,"journal":{"name":"Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Alternative admission rules based on the many sources asymptotics\",\"authors\":\"Gergely Seres, Árpád Szlávik, J. Zátonyi, J. Bíró\",\"doi\":\"10.1109/ISCC.2002.1021793\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper identifies the requirements placed against a resource manager function for use in QoS-enabled IP networks. The structure of the Internet and the composition of the services motivate the development of on-line resource brokers that can make admission decisions in real time, based on the best up-to-date information available on the state of the network. The difficulties with traffic models and traffic characterisation stimulate the use of measurement-based techniques that bypass the modelling step and provide the resource requirements of the traffic directly. The paper introduces a novel method for the computation of the bandwidth requirement of Internet traffic flows using the many sources asymptotics. The estimator method significantly reduces the computational complexity of the calculations, allowing the real-time operation of the algorithm even in a measurement-based environment. The method delivers bandwidth-type quantity, the format preferred by Internet control applications. The savings arising from the reduced computational complexity compared to existing methods are demonstrated in a numerical example.\",\"PeriodicalId\":261743,\"journal\":{\"name\":\"Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications\",\"volume\":\"38 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2002-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISCC.2002.1021793\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings ISCC 2002 Seventh International Symposium on Computers and Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCC.2002.1021793","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

本文确定了在支持qos的IP网络中使用资源管理器功能的需求。互联网的结构和服务的组成激励了在线资源代理的发展,这些代理可以根据网络状态中可用的最佳最新信息实时做出许可决定。交通模型和交通特征的困难促使人们使用基于测量的技术,这些技术绕过建模步骤,直接提供交通的资源需求。本文介绍了一种利用多源渐近计算互联网流量带宽需求的新方法。估计器方法大大降低了计算的计算复杂度,即使在基于测量的环境中也可以实现算法的实时运行。该方法提供带宽类型的数量,这是Internet控制应用程序首选的格式。与现有方法相比,计算复杂度降低所带来的节省在数值实例中得到了证明。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Alternative admission rules based on the many sources asymptotics
This paper identifies the requirements placed against a resource manager function for use in QoS-enabled IP networks. The structure of the Internet and the composition of the services motivate the development of on-line resource brokers that can make admission decisions in real time, based on the best up-to-date information available on the state of the network. The difficulties with traffic models and traffic characterisation stimulate the use of measurement-based techniques that bypass the modelling step and provide the resource requirements of the traffic directly. The paper introduces a novel method for the computation of the bandwidth requirement of Internet traffic flows using the many sources asymptotics. The estimator method significantly reduces the computational complexity of the calculations, allowing the real-time operation of the algorithm even in a measurement-based environment. The method delivers bandwidth-type quantity, the format preferred by Internet control applications. The savings arising from the reduced computational complexity compared to existing methods are demonstrated in a numerical example.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
End-to-end quality of service in multi-class service high-speed networks via optimal least weight routing Using distributed component model for active service deployment Tunable fiber Bragg grating-based a pair of m-sequence coding for optical CDMA An integrated architecture for the scalable delivery of semi-dynamic Web content Scheduling constant bit rate flows in data over cable networks
×
引用
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