On Maximizing iSCSI Throughput Using Multiple Connections with Automatic Parallelism Tuning

F. Inoue, H. Ohsaki, Y. Nomoto, M. Imase
{"title":"On Maximizing iSCSI Throughput Using Multiple Connections with Automatic Parallelism Tuning","authors":"F. Inoue, H. Ohsaki, Y. Nomoto, M. Imase","doi":"10.1109/SNAPI.2008.15","DOIUrl":null,"url":null,"abstract":"In this paper, we propose an iSCSI-APT (iSCSI with automatic parallelism tuning) that maximizes iSCSI throughput in long-fat networks. In recent years, as a protocol for building SANs (Storage Area Networks), iSCSI has been attracting attention for its low cost and high compatibility with existing networking infrastructure. However, it has been known that iSCSI throughput degrades in a long-fat network. iSCSI supports a feature called multiple connections, which allows data delivery over multiple TCP connections in a single session. However, for effective utilization of the multiple connections feature, the number of multiple connections must be appropriately configured according to the network status. In this paper, we propose the iSCSI-APT that automatically adjusts the number of multiple connections according to the network status. Through experiments using our iSCSI-APT implementation, we demonstrate that iSCSI-APT operates quite effectively regardless of the network delay.","PeriodicalId":335253,"journal":{"name":"2008 Fifth IEEE International Workshop on Storage Network Architecture and Parallel I/Os","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 Fifth IEEE International Workshop on Storage Network Architecture and Parallel I/Os","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SNAPI.2008.15","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

Abstract

In this paper, we propose an iSCSI-APT (iSCSI with automatic parallelism tuning) that maximizes iSCSI throughput in long-fat networks. In recent years, as a protocol for building SANs (Storage Area Networks), iSCSI has been attracting attention for its low cost and high compatibility with existing networking infrastructure. However, it has been known that iSCSI throughput degrades in a long-fat network. iSCSI supports a feature called multiple connections, which allows data delivery over multiple TCP connections in a single session. However, for effective utilization of the multiple connections feature, the number of multiple connections must be appropriately configured according to the network status. In this paper, we propose the iSCSI-APT that automatically adjusts the number of multiple connections according to the network status. Through experiments using our iSCSI-APT implementation, we demonstrate that iSCSI-APT operates quite effectively regardless of the network delay.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
最大化iSCSI吞吐量使用多个连接与自动并行调优
在本文中,我们提出了一种iSCSI- apt(具有自动并行调优的iSCSI),它可以最大限度地提高长脂肪网络中的iSCSI吞吐量。近年来,iSCSI作为一种构建san (Storage Area network,存储区域网络)的协议,以其低成本和与现有网络基础设施的高兼容性而备受关注。然而,众所周知,iSCSI吞吐量在长脂肪网络中会降低。iSCSI支持一种称为多连接的特性,它允许在单个会话中通过多个TCP连接传输数据。但是,为了有效地利用多连接特性,必须根据网络状况合理配置多连接数。在本文中,我们提出了根据网络状态自动调整多个连接数量的iSCSI-APT。通过使用我们的iSCSI-APT实现的实验,我们证明了无论网络延迟如何,iSCSI-APT都能非常有效地运行。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A Partial-Distribution-Fault-Aware Protocol for Consistent Updates in Distributed Storage Systems DIG: Rapid Characterization of Modern Hard Disk Drive and Its Performance Implication Pre-allocation Size Adjusting Methods Depending on Growing File Size ADMAD: Application-Driven Metadata Aware De-duplication Archival Storage System A Model for Storage Processes in Network Environment and Its Implementation
×
引用
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