礼貌的带宽限制分配模型

Chafika Tata, M. Kadoch
{"title":"礼貌的带宽限制分配模型","authors":"Chafika Tata, M. Kadoch","doi":"10.1109/ICTEL.2013.6632149","DOIUrl":null,"url":null,"abstract":"This paper proposes a new Bandwidth Constraints Model for MPLS networks, called CAM (Courteous Allocation Model). CAM allocates added bandwidth to lower classes of traffic without affecting the high priority traffic. Simulations are performed to compare CAM with the two basic Constraints Models, namely, MAM (Maximum Allocation Model) and RDM (Russian Dolls Model). The results show that our model gives significant improvement in terms of delay, throughput and packets loss.","PeriodicalId":430600,"journal":{"name":"ICT 2013","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-05-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"CAM: Courteous bandwidth constraints allocation model\",\"authors\":\"Chafika Tata, M. Kadoch\",\"doi\":\"10.1109/ICTEL.2013.6632149\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes a new Bandwidth Constraints Model for MPLS networks, called CAM (Courteous Allocation Model). CAM allocates added bandwidth to lower classes of traffic without affecting the high priority traffic. Simulations are performed to compare CAM with the two basic Constraints Models, namely, MAM (Maximum Allocation Model) and RDM (Russian Dolls Model). The results show that our model gives significant improvement in terms of delay, throughput and packets loss.\",\"PeriodicalId\":430600,\"journal\":{\"name\":\"ICT 2013\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-05-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ICT 2013\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICTEL.2013.6632149\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ICT 2013","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICTEL.2013.6632149","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

摘要

本文提出了一种新的MPLS网络带宽约束模型——礼貌分配模型(CAM)。CAM将增加的带宽分配给低优先级的流量,而不影响高优先级的流量。仿真比较了CAM与两种基本约束模型,即MAM (Maximum Allocation Model)和RDM (Russian Dolls Model)。结果表明,我们的模型在延迟、吞吐量和数据包丢失方面有了显著的改进。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
CAM: Courteous bandwidth constraints allocation model
This paper proposes a new Bandwidth Constraints Model for MPLS networks, called CAM (Courteous Allocation Model). CAM allocates added bandwidth to lower classes of traffic without affecting the high priority traffic. Simulations are performed to compare CAM with the two basic Constraints Models, namely, MAM (Maximum Allocation Model) and RDM (Russian Dolls Model). The results show that our model gives significant improvement in terms of delay, throughput and packets loss.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Joint proportional fairness admission control and superposition coding for OFDMA networks REM-based power control and femtocell self-organization Adaptive multi-step channel prediction in spatial channel model using Kalman filter On the hybrid localization in heterogeneous networks with lack of hearability Trade-off analysis of QoS-aware configurable LTE downlink schedulers
×
引用
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