Shared Buffer Approach in Fault Tolerant Networks

Luisito I. Tabada, P. Tagle
{"title":"Shared Buffer Approach in Fault Tolerant Networks","authors":"Luisito I. Tabada, P. Tagle","doi":"10.1109/ICCTD.2009.19","DOIUrl":null,"url":null,"abstract":"In this study, we showed that switches that incorporate shared buffer switching elements (SE) provide high buffer utilization and needs least amount of buffer space. One of the main factors that affect the buffering strategy is the buffer management approach. In order to manage the incoming packets in each buffered switching element, two buffer handling techniques are proposed: the first-in-first-out (FIFO) configuration which employs backpressure control flow mechanism and follows the FIFO policy in handling the buffer; and the look-ahead configuration which still follows all the features of the FIFO scheme but uses the buffer only when needed. Tagle-Sharma network is used as a model network. Simulation results show that both schemes give high throughput under uniform random traffic. Introduction of the deadline keeps the delay performance of the network low. One drawback of the look-ahead strategy is that when the packet bypasses the buffer of the current SE, back pressure mechanism is not applied and the packet reaches its destination faster, thus could cause an overflow of buffer in the next stage of the network. The look-ahead scheme offers better transmission delay performance than the FIFO approach.","PeriodicalId":269403,"journal":{"name":"2009 International Conference on Computer Technology and Development","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2009-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 International Conference on Computer Technology and Development","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCTD.2009.19","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

In this study, we showed that switches that incorporate shared buffer switching elements (SE) provide high buffer utilization and needs least amount of buffer space. One of the main factors that affect the buffering strategy is the buffer management approach. In order to manage the incoming packets in each buffered switching element, two buffer handling techniques are proposed: the first-in-first-out (FIFO) configuration which employs backpressure control flow mechanism and follows the FIFO policy in handling the buffer; and the look-ahead configuration which still follows all the features of the FIFO scheme but uses the buffer only when needed. Tagle-Sharma network is used as a model network. Simulation results show that both schemes give high throughput under uniform random traffic. Introduction of the deadline keeps the delay performance of the network low. One drawback of the look-ahead strategy is that when the packet bypasses the buffer of the current SE, back pressure mechanism is not applied and the packet reaches its destination faster, thus could cause an overflow of buffer in the next stage of the network. The look-ahead scheme offers better transmission delay performance than the FIFO approach.
容错网络中的共享缓冲方法
在本研究中,我们展示了包含共享缓冲区交换元件(SE)的交换机提供了高缓冲区利用率,并且需要最少的缓冲区空间。影响缓冲策略的主要因素之一是缓冲区管理方法。为了对每个缓冲交换单元中的入站数据包进行管理,提出了两种缓冲处理技术:采用背压控制流机制并遵循FIFO策略处理缓冲的先进先出(FIFO)配置;以及前瞻性配置,它仍然遵循FIFO方案的所有特征,但仅在需要时使用缓冲区。使用Tagle-Sharma网络作为模型网络。仿真结果表明,在均匀随机流量下,两种方案都具有较高的吞吐量。最后期限的引入使网络的延迟性能保持在较低水平。前瞻性策略的一个缺点是,当数据包绕过当前SE的缓冲区时,没有应用背压机制,数据包到达目的地的速度更快,因此可能导致网络下一阶段缓冲区溢出。有预见性的方案提供了更好的传输延迟性能比FIFO的方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信