TCP throughput and buffer management

T. Lizambri, F. Duran, S. Wakid
{"title":"TCP throughput and buffer management","authors":"T. Lizambri, F. Duran, S. Wakid","doi":"10.1109/ISORC.2000.839550","DOIUrl":null,"url":null,"abstract":"There have been may debates about the feasibility of providing guaranteed quality of service (QoS) when network traffic travels beyond the enterprise domain and into the vast unknown of the Internet. Many mechanisms have been proposed to bring QoS to TCP/IP and the Internet (RSVP, DiffServ, 802.1p). However, until these techniques and the equipment to support them become ubiquitous, most enterprises will rely on local prioritization of the traffic to obtain the best performance for mission-critical and time-sensitive applications. This paper explores prioritizing critical TCP/IP traffic using a multi-queue buffer management strategy that becomes biased against random low-priority flows and remains biased while congestion exists in the network. This biasing implies a degree of unfairness but proves to be more advantageous to the overall throughput of the network than strategies that attempt to be fair. Only two classes of service are considered, where TCP connections are assigned to these classes and mapped to two underlying queues with round-robin scheduling and shared memory. In addition to improving the throughput, cell losses are minimized for the class of service (queue) with the higher priority.","PeriodicalId":127761,"journal":{"name":"Proceedings Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC 2000) (Cat. No. PR00607)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC 2000) (Cat. No. PR00607)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISORC.2000.839550","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

There have been may debates about the feasibility of providing guaranteed quality of service (QoS) when network traffic travels beyond the enterprise domain and into the vast unknown of the Internet. Many mechanisms have been proposed to bring QoS to TCP/IP and the Internet (RSVP, DiffServ, 802.1p). However, until these techniques and the equipment to support them become ubiquitous, most enterprises will rely on local prioritization of the traffic to obtain the best performance for mission-critical and time-sensitive applications. This paper explores prioritizing critical TCP/IP traffic using a multi-queue buffer management strategy that becomes biased against random low-priority flows and remains biased while congestion exists in the network. This biasing implies a degree of unfairness but proves to be more advantageous to the overall throughput of the network than strategies that attempt to be fair. Only two classes of service are considered, where TCP connections are assigned to these classes and mapped to two underlying queues with round-robin scheduling and shared memory. In addition to improving the throughput, cell losses are minimized for the class of service (queue) with the higher priority.
TCP吞吐量和缓冲区管理
当网络流量超出企业领域进入未知的互联网时,关于提供有保证的服务质量(QoS)的可行性,已经有了许多争论。已经提出了许多机制来为TCP/IP和Internet提供QoS (RSVP, DiffServ, 802.1p)。然而,在这些技术和支持它们的设备变得无处不在之前,大多数企业将依赖于流量的本地优先级,以获得任务关键型和时间敏感型应用程序的最佳性能。本文探讨了使用多队列缓冲区管理策略对关键TCP/IP流量进行优先级排序,该策略对随机低优先级流产生偏差,并在网络中存在拥塞时保持偏差。这种偏差意味着一定程度的不公平,但事实证明,与试图保持公平的策略相比,对网络的总体吞吐量更有利。只考虑两类服务,其中TCP连接被分配给这些类,并映射到两个具有轮循调度和共享内存的底层队列。除了提高吞吐量之外,对于具有较高优先级的服务类别(队列),单元损失也被最小化。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信