Token-based congestion control: Achieving fair resource allocations in P2P networks

Zhiqiang Shi
{"title":"Token-based congestion control: Achieving fair resource allocations in P2P networks","authors":"Zhiqiang Shi","doi":"10.1109/KINGN.2008.4542263","DOIUrl":null,"url":null,"abstract":"Fair Queueing designed to achieve fair bandwidth allocations like CSFQ and Stochastic Fair BLUE, have many desirable properties for congestion control in Internet. However, such mechanisms usually supervise the bandwidth consumption of per-flow, and are good for nothing while P2P flows dominate the traffic of Internet. In this paper, we propose a Token-Based Congestion Control, which limits the access token resource consumed by every subscriber, and provides substantial fairness in P2P networks. In this congestion control system, there are three important devices: core routers, edge routers, terminals. Core routers measure congestion level, and convey it to terminals along with dataflows. Terminals label the Token- Level on sent packets according to the Congestion-Index in the transport path, and regulate the average speed of output tokens, which are the multiplication of the packet size and the Token-Level. Edge routers police the input token rate of every terminal. We present simulations and analyses on the performance of this approach at last.","PeriodicalId":417810,"journal":{"name":"2008 First ITU-T Kaleidoscope Academic Conference - Innovations in NGN: Future Network and Services","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 First ITU-T Kaleidoscope Academic Conference - Innovations in NGN: Future Network and Services","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/KINGN.2008.4542263","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 14

Abstract

Fair Queueing designed to achieve fair bandwidth allocations like CSFQ and Stochastic Fair BLUE, have many desirable properties for congestion control in Internet. However, such mechanisms usually supervise the bandwidth consumption of per-flow, and are good for nothing while P2P flows dominate the traffic of Internet. In this paper, we propose a Token-Based Congestion Control, which limits the access token resource consumed by every subscriber, and provides substantial fairness in P2P networks. In this congestion control system, there are three important devices: core routers, edge routers, terminals. Core routers measure congestion level, and convey it to terminals along with dataflows. Terminals label the Token- Level on sent packets according to the Congestion-Index in the transport path, and regulate the average speed of output tokens, which are the multiplication of the packet size and the Token-Level. Edge routers police the input token rate of every terminal. We present simulations and analyses on the performance of this approach at last.
基于令牌的拥塞控制:实现P2P网络中的公平资源分配
像CSFQ和随机公平蓝一样,公平排队是为了实现公平的带宽分配而设计的,它有许多理想的特性用于互联网的拥塞控制。然而,这种机制通常监督每个流的带宽消耗,当P2P流主导互联网流量时,这种机制毫无用处。在本文中,我们提出了一种基于令牌的拥塞控制,它限制了每个订阅者消耗的访问令牌资源,并在P2P网络中提供了实质性的公平性。在这个拥塞控制系统中,有三个重要的设备:核心路由器、边缘路由器、终端。核心路由器测量拥塞程度,并将其与数据流一起传送到终端。终端根据传输路径中的拥塞指数(Congestion-Index)在发送的数据包上标记Token-Level,并调节输出令牌的平均速度,即数据包大小与Token-Level的乘积。边缘路由器监督每个终端的输入令牌率。最后对该方法的性能进行了仿真和分析。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信