一种利用网络编码提供QoS的新方法

A. Salavati, B. Khalaj, M. Aref
{"title":"一种利用网络编码提供QoS的新方法","authors":"A. Salavati, B. Khalaj, M. Aref","doi":"10.1109/ISTEL.2008.4651344","DOIUrl":null,"url":null,"abstract":"In this paper, we present a decentralized algorithm that computes minimum cost QoS flow subgraphs in network coded multicast networks. These subgraphs are minimum cost solutions that also satisfy user-specified QoS constraints, specifically handling elastic rate and delay demands. Although earlier network coding algorithms in this area have only demonstrated QoS improvements, the proposed QoS network coding is clearly different in the sense that it guarantees that given QoS constraints are met over the network.","PeriodicalId":133602,"journal":{"name":"2008 International Symposium on Telecommunications","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A novel approach for providing QoS with network coding\",\"authors\":\"A. Salavati, B. Khalaj, M. Aref\",\"doi\":\"10.1109/ISTEL.2008.4651344\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we present a decentralized algorithm that computes minimum cost QoS flow subgraphs in network coded multicast networks. These subgraphs are minimum cost solutions that also satisfy user-specified QoS constraints, specifically handling elastic rate and delay demands. Although earlier network coding algorithms in this area have only demonstrated QoS improvements, the proposed QoS network coding is clearly different in the sense that it guarantees that given QoS constraints are met over the network.\",\"PeriodicalId\":133602,\"journal\":{\"name\":\"2008 International Symposium on Telecommunications\",\"volume\":\"19 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-10-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 International Symposium on Telecommunications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISTEL.2008.4651344\",\"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 International Symposium on Telecommunications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISTEL.2008.4651344","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

本文提出了一种计算网络编码组播网络中最小代价QoS流子图的分散算法。这些子图是最小成本的解决方案,也满足用户指定的QoS约束,特别是处理弹性速率和延迟需求。尽管该领域早期的网络编码算法仅展示了QoS改进,但所提出的QoS网络编码在保证给定的QoS约束在网络上得到满足的意义上明显不同。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A novel approach for providing QoS with network coding
In this paper, we present a decentralized algorithm that computes minimum cost QoS flow subgraphs in network coded multicast networks. These subgraphs are minimum cost solutions that also satisfy user-specified QoS constraints, specifically handling elastic rate and delay demands. Although earlier network coding algorithms in this area have only demonstrated QoS improvements, the proposed QoS network coding is clearly different in the sense that it guarantees that given QoS constraints are met over the network.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信