ATM网络节点拥塞时的最优缓冲控制

L. Tassiulas, Y. Hung, S. Panwar
{"title":"ATM网络节点拥塞时的最优缓冲控制","authors":"L. Tassiulas, Y. Hung, S. Panwar","doi":"10.1109/INFCOM.1993.253259","DOIUrl":null,"url":null,"abstract":"The problem of optimal buffer space priority control in an asynchronous transfer mode (ATM) network node is studied. The buffer of a transmission link is shared among the cells of several traffic classes waiting for transmission through the link. When the number of cells to be stored in the buffer exceed the available buffer space, certain cells have to be dropped. Different traffic classes have different sensitivities to cell losses. By appropriate selection of the classes of cells that are dropped in case of overflow, the more sensitive classes can be made to suffer smaller cell losses. Arriving cells might be blocked from entering the system or they may be dropped after they are already in the buffer. Depending on the control that is on the system, three classes of policies are distinguished. In each one, policies that schedule the buffer allocation in some optimal manner are identified.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"80","resultStr":"{\"title\":\"Optimal buffer control during congestion in an ATM network node\",\"authors\":\"L. Tassiulas, Y. Hung, S. Panwar\",\"doi\":\"10.1109/INFCOM.1993.253259\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The problem of optimal buffer space priority control in an asynchronous transfer mode (ATM) network node is studied. The buffer of a transmission link is shared among the cells of several traffic classes waiting for transmission through the link. When the number of cells to be stored in the buffer exceed the available buffer space, certain cells have to be dropped. Different traffic classes have different sensitivities to cell losses. By appropriate selection of the classes of cells that are dropped in case of overflow, the more sensitive classes can be made to suffer smaller cell losses. Arriving cells might be blocked from entering the system or they may be dropped after they are already in the buffer. Depending on the control that is on the system, three classes of policies are distinguished. In each one, policies that schedule the buffer allocation in some optimal manner are identified.<<ETX>>\",\"PeriodicalId\":166966,\"journal\":{\"name\":\"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings\",\"volume\":\"9 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1993-03-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"80\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INFCOM.1993.253259\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INFCOM.1993.253259","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 80

摘要

研究了异步传输模式(ATM)网络节点的最优缓冲空间优先级控制问题。传输链路的缓冲区在等待通过该链路传输的几个业务类的单元之间共享。当要存储在缓冲区中的单元格数量超过可用的缓冲区空间时,必须删除某些单元格。不同的通信类别对小区损失的敏感性不同。通过适当选择在溢出情况下丢弃的单元格类别,可以使更敏感的类别遭受较小的单元格损失。到达的单元可能会被阻止进入系统,或者在它们已经在缓冲区中之后被丢弃。根据系统上的控制,可以区分三类策略。在每个模型中,确定了以某种最优方式调度缓冲区分配的策略。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Optimal buffer control during congestion in an ATM network node
The problem of optimal buffer space priority control in an asynchronous transfer mode (ATM) network node is studied. The buffer of a transmission link is shared among the cells of several traffic classes waiting for transmission through the link. When the number of cells to be stored in the buffer exceed the available buffer space, certain cells have to be dropped. Different traffic classes have different sensitivities to cell losses. By appropriate selection of the classes of cells that are dropped in case of overflow, the more sensitive classes can be made to suffer smaller cell losses. Arriving cells might be blocked from entering the system or they may be dropped after they are already in the buffer. Depending on the control that is on the system, three classes of policies are distinguished. In each one, policies that schedule the buffer allocation in some optimal manner are identified.<>
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Translation of QoS parameters into ATM performance parameters in B-ISDN Traffic control scheme for interconnection of FDDI networks through ATM network An approximate analysis of broadcasting in multichannel metropolitan area networks Blocking evaluation for networks with reward maximization routing Characterization of a CBR connection over a channel with known bounded delay variation
×
引用
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