Abstract
In the Storage Area Network (SAN), the mature network technology is used to substitute for the IO bus. Usually, the common switch is used in the storage network especially in the iSCSI storage system. Because the common switches are not aware of the environment it is used in, it can not make optimization for the storage network. In this paper, an optimization of storage network is presented which can greatly improve the performance and resource utilization of the whole storage system. In this optimization, the IO acknowledgment commands passing through the switch which is used in storage network are transferred in highest priority. This optimization of SAN has been certified by the simulation experiments.
Chapter PDF
Similar content being viewed by others
Keywords
References
Yao, N., Shu, J.-w., Zheng, W.-M.: Improving the Data Placement Algorithm of Randomization in SAN. In: Sunderam, V.S., van Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds.) ICCS 2005. LNCS, vol. 3516, pp. 415–422. Springer, Heidelberg (2005)
Patterson, D.A., Gibson, G., Katz, R.H.: A case for Redundant Arrays of Inexpensive Disks(RAID). In: Proceedings of the 1988 ACM Conference on Management of Data(SIGMOD), June 1988, pp. 109–116 (1988)
Weikum, G., Zabback, P., Scheuermann, P.: Dynamic File Allocation in Disk Arrays. In: Proc. of ACM SIGMOD, May 1991, pp. 406–415 (1991)
Honicky, R.J., Miller, E.L.: A fast algorithm for online placement and reorganization of replicated data. In: 17th International Parallel and Distributed Processing Symposium, IPDPS (2003)
McKeown, N., Anantharam, V., Walrand, J.: Achieving 100
Giaccone, P., Prabhakar, B., Shah, D.: Toward simple, high-performance schedulers for high-aggregate bandwidth switches. In: Proc. IEEE INFOCOM, pp. 1160–1169 (2002)
Partridge, C., et al.: A 50-Gb/s IP router. IEEE/ACM Trans. Networking 6, 237–248 (1998)
Anderson, T., Owicki, S., Saxe, J., Thacker, C.: High speed switch scheduling for local area networks. ACM Trans. Comput. Syst. 11(4), 319–352 (1993)
Marsan, M.A., Bianco, A., Giaccone, P., et al.: Packet-mode scheduling in input -queued cell-based switches. IEEE/ACM Trans. Networking 10(5), 666–678 (2002)
Ganjali, Y., Keshavarzian, A., Shah, D.: Input queued switches: cell switching vs. packet switching. IEEE/ACM Trans. Networking 13(4), 782–789 (2005)
Li, W.-J., Liu, B.: Preemptive Short-Packet-First Scheduling in Input Queuing Switches. Acta Electronic Sinica 33(4), 577–583 (2005)
Develop group of Simpy: Purpose of the Simpy Laboratory pages. Simpy Homepage, Available at http://simpy.sourceforge.net
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Yao, N., Zhao, X., Meng, H., Jiang, X. (2007). Optimization of the Switches in Storage Networks. In: Shi, Y., van Albada, G.D., Dongarra, J., Sloot, P.M.A. (eds) Computational Science – ICCS 2007. ICCS 2007. Lecture Notes in Computer Science, vol 4489. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72588-6_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-72588-6_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72587-9
Online ISBN: 978-3-540-72588-6
eBook Packages: Computer ScienceComputer Science (R0)