HyperSCSI

HyperSCSI was a computer network protocol for accessing storage by sending and receiving SCSI commands. It was developed by researchers at the Data Storage Institute in Singapore in 2000 to 2003.[1] HyperSCSI is unlike iSCSI in that it bypassed the internet protocol suite (TCP/IP) and works directly over Ethernet to form its Storage area network. It skipped the routing, retransmission, segmentation, reassembly, and all the other problems that the TCP/IP suite addresses. Compared to iSCSI, this was meant to give a performance benefit at the cost of IP's flexibility. An independent performance test showed that performance was unstable with network congestion.[2] Since HyperSCSI was in direct competition with the older and well established Fibre Channel, and the standardized iSCSI, it was not adopted by commercial vendors. Some researchers at Huazhong University of Science and Technology noted the failure to provide any transport layer protocol, so implemented a reliability layer in 2007.[3] Another version called HS/IP was developed over the Internet Protocol (IP).[4]

References

  1. W.Y.H. Wang; H.N. Yeo; Y.L. Zhu; T.C. Chong (November 19, 2004). "Design and development of Ethernet-based storage area network protocol". Proceedings of the 12th IEEE International Conference on Networks. IEEE: 48–52. doi:10.1109/ICON.2004.1409086. ISBN 0-7803-8783-X.
  2. Mathias Gug (March 24, 2003). "Performance comparison between iSCSI and other hardware and software solutions" (PDF). Computing in High Energy and Nuclear Physics. La Jolla, California. Retrieved May 5, 2011.
  3. Gongye Zhou; Peng Chen (July 31, 2007). "RH-SCSI: A Reliable HyperSCSI Protocol for Networking Storage". International Conference on Networking, Architecture, and Storage 2007. IEEE: 29–31. doi:10.1109/NAS.2007.45. ISBN 0-7695-2927-5.
  4. Wang Yonghong. "Network Storage Technology Division: HyperSCSI Overview". Data Storage Institute. Retrieved May 5, 2011.

See also

External links

This article is issued from Wikipedia - version of the 4/10/2013. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.