多业务网络的资源优化分配

R. Simon, B. Jukic, Woan Sun Chang
{"title":"多业务网络的资源优化分配","authors":"R. Simon, B. Jukic, Woan Sun Chang","doi":"10.1109/SIMSYM.2000.844898","DOIUrl":null,"url":null,"abstract":"The next generation of communication networks will simultaneously offer multiple service classes capable of supporting both real-time and best-effort traffic. At the level of an individual network router or gateway, a critical question that needs to be addressed is the development of a set of policies and metrics to determine how router resources should be shared between different service classes. We describe a solution to this problem that combines pricing policies with admission control for real-time traffic. We present a measurement-based approach for adaptive pricing that results in near-optimal resource allocation policies between real-time and best-effort traffic. We also show, through simulation, an application of our approach that maximizes overall user value.","PeriodicalId":361153,"journal":{"name":"Proceedings 33rd Annual Simulation Symposium (SS 2000)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Optimal resource allocation for multi-service networks\",\"authors\":\"R. Simon, B. Jukic, Woan Sun Chang\",\"doi\":\"10.1109/SIMSYM.2000.844898\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The next generation of communication networks will simultaneously offer multiple service classes capable of supporting both real-time and best-effort traffic. At the level of an individual network router or gateway, a critical question that needs to be addressed is the development of a set of policies and metrics to determine how router resources should be shared between different service classes. We describe a solution to this problem that combines pricing policies with admission control for real-time traffic. We present a measurement-based approach for adaptive pricing that results in near-optimal resource allocation policies between real-time and best-effort traffic. We also show, through simulation, an application of our approach that maximizes overall user value.\",\"PeriodicalId\":361153,\"journal\":{\"name\":\"Proceedings 33rd Annual Simulation Symposium (SS 2000)\",\"volume\":\"52 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2000-04-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 33rd Annual Simulation Symposium (SS 2000)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SIMSYM.2000.844898\",\"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 33rd Annual Simulation Symposium (SS 2000)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SIMSYM.2000.844898","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

下一代通信网络将同时提供多种服务类别,能够支持实时和尽力而为的流量。在单个网络路由器或网关的级别上,需要解决的一个关键问题是开发一组策略和度量,以确定如何在不同的服务类之间共享路由器资源。我们描述了一种将定价策略与实时流量的准入控制相结合的解决方案。我们提出了一种基于测量的自适应定价方法,该方法可以在实时流量和最佳流量之间实现近乎最佳的资源分配策略。我们还通过模拟展示了我们的方法的一个应用程序,该应用程序使整体用户价值最大化。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Optimal resource allocation for multi-service networks
The next generation of communication networks will simultaneously offer multiple service classes capable of supporting both real-time and best-effort traffic. At the level of an individual network router or gateway, a critical question that needs to be addressed is the development of a set of policies and metrics to determine how router resources should be shared between different service classes. We describe a solution to this problem that combines pricing policies with admission control for real-time traffic. We present a measurement-based approach for adaptive pricing that results in near-optimal resource allocation policies between real-time and best-effort traffic. We also show, through simulation, an application of our approach that maximizes overall user value.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信