Please wait a minute...
J4  2010, Vol. 44 Issue (9): 1698-1704    DOI: 10.3785/j.issn.1008-973X.2010.09.012
自动化技术、计算机技术     
基于预留带宽的光纤通道交换网硬实时通信
舒宇,余锋,汪乐宇
浙江大学 仪器科学与工程学系,浙江 杭州 310027
Hard real-time communication in fibre channel based on
bandwidth reservation
SHU Yu, YU Feng, WANG Le-yu
Department of Instrumentation Science and Engineering, Zhejiang University, Hangzhou 310027, China
 全文: PDF  HTML
摘要:

为了保证光纤通道(FC)交换网中硬实时通信,提出一种采用通用处理器共享(generalized processor sharing)调度方式交换机构建交换网,并且采用模拟退化算法根据数据流硬实时通信需求找出交换网ISL(interswitch link)权重参数和数据流预留带宽参数优化配置的方法.在对FC网络以及GPS调度方式进行分析的基础上,建立基于光纤通道交换网的硬实时通信模型,将保证硬实时通信问题转换为组合优化问题;构造了最小预留带宽和目标函数,并采用模拟退火算法找出该问题的最优解.仿真实验结果验证了该方法的有效性,但是通过可接受解和最优解的实验结果比较发现最优解并不能总是获得最佳的系统延迟时间率.

Abstract:

To guarantee hard realtime communication in fibre channel fabric, generalized processor sharing (GPS) scheduling switches were used to build fibre channel (FC) fabric, and simulated annealing algorithm was used to find the fabrics link weight and GPS bandwidth reservation configuration parameters according to data streams realtime requirements. After analyzing FC fabric and GPS scheduling, a FC fabric model for hard realtime communication was built, and the hard realtime problem was turned into a combinatorial optimization problem. Then a minimum bandwidth reservation sum objective function was designed, and simulated annealing algorithm was used to find the best solution. The framework was verified by simulation with random topology and data streams with random hard realtime requirements, and all data streams worstcase delays met targets. Simulation results comparison between acceptable solutions and best solutions show that the fabric configured with best solution cannot always get the best system delay rates.

出版日期: 2010-09-01
:  TP 393.04  
通讯作者: 余锋,男,教授.     E-mail: osfengyu@dial.zju.edu.cn
作者简介: 舒宇(1982-),男,辽宁凌源人,博士生,从事光纤通道协议与交换网研究.
服务  
把本文推荐给朋友
加入引用管理器
E-mail Alert
RSS
作者相关文章  

引用本文:

舒宇, 余锋, 汪乐宇. 基于预留带宽的光纤通道交换网硬实时通信[J]. J4, 2010, 44(9): 1698-1704.

SHU Yu, TU Feng, HONG Le-Yu. Hard real-time communication in fibre channel based on
bandwidth reservation. J4, 2010, 44(9): 1698-1704.

链接本文:

http://www.zjujournals.com/eng/CN/10.3785/j.issn.1008-973X.2010.09.012        http://www.zjujournals.com/eng/CN/Y2010/V44/I9/1698

[1] ANSI std 3732003 Fibre channel framing and signaling (FCFS) rev 190 [S]. [S. l.]: T11 Technical Committee, 2003.
[2] FAN Xing, MAGUS J, JONSSON J. Guaranteed realtime communication in packetswitched networks with FCFS [J]. Computer Networks, 2009,53(3): 400417.
[3] WATSON K, JASPERNEITE J. Determining endtoend delays using network calculus [C]∥ A Proceedings Volume from the 5th Fieldbus Systems and Their Application. Aveiro,Portugal:ELSEVIER,2003:251256.
[4] WATSON K S.Network calculus in star and line networks with centralized communication[R]. Karlsruhe, Germany:Fraunhofer IITB,2002.
[5] 王子君, 许维胜, 王中杰, 等. 控制网络的确定性延迟演算理论研究 [J]. 电子学报, 2006,34(2): 380384.
WANG Zijun, XU Weisheng, WANG Zhongjie, et al. Research on the deterministic delay calculus theory of control networks [J]. Acta Electronica Sinica, 2006,34(2): 380384.
[6] 张奇智, 张彬, 张卫东. 基于网络演算计算交换式工业以太网中的最大时延 [J]. 控制与决策, 2005,20(1): 361364.
ZHANG Qizhi, ZHANG Bin, ZHANG Weidong. Calculation of maximum delay in switched industrial Ethernet based on network calculus [J]. Control and Decision, 2005,20(1): 361364.
[7] ANSI std 4612010,FIBRE CHANNEL SWITCH FABRIC5 (FCSW5) REV 85 [S]. [S. l.]: T11 Technical Committee, 2009.
[8] CLARK T. Designing storage area networks: a practical reference for implementing fibre channel and IP SANs [M]. 2nd ed. [S. l.]: AddisonWesley Professional, 2003:85.
[9] BERTSEKAS D, GALLAGER R. Data networks [M]. New Jersey: PrenticeHall, 1992:322323.
10] AHUJA R K, MAGNANTI T L, ORLIN J B. Network flows: theory, algorithms and applications [M]. New Jersey: PrenticeHall, 1993:108112.
[11] PAREKHAND A K, GALLAGER R G. A generalized processor sharing approach to flow control in integrated service networks: the single node case [J]. IEEE/ACM Trans Networking,1993,1(3): 344357.
[12] BOUDEC L J, THIRAN P. NETWORK CALCULUS a theory of deterministic queuing systems for the internet [M/OL].[20040510]. http:∥citeseer.ist.psu.edu/696516.html.
[13] 周天然, 宋丽茹, 熊华钢, 等. 航空电子环境下FC网络的建模与仿真 [J]. 北京航空航天大学学报, 2008,34(10): 11171125.
ZHOU Tianran, SONG Liru, XIONG Huagang, et al. Modeling and simulation of fibre channel for avionics [J]. journal of Beijing University of Aeronautics and Astronautics, 2008, 34(10): 11171125.
[14] WROCLAWSKI J. RFC2210 [EB/OL]. [19970930]. http://tools.ietf.orghtmlrfc2210
[15] BENNETT J C R, ZHANG Hui. WF2Q: worstcase fair weighted fair queueing [C]∥INFOCOM 96. Fifteenth Annual Joint Conference of the IEEE Computer Societies.  San Francisco, CA:IEEE, 1996: 120128.
[16] 约翰森·乔, 郭晓雷. 高速网络中的QoS控制(影印版) [M]. 北京: 清华大学出版社, 2004:136137.
[17] 康立山, 谢云, 罗祖华. 非数值并行算法:模拟退火算法 [M]. 北京: 科学出版社, 2000:22.
[18] 模拟退火 [EB/OL]. [2010015].http:∥zh.wikipedia.orgwiki%E6%A8%A1%E6%8B%9F%E9%80%80%E7%81%AB.?
[19] FORTZ B, THORUP M. Internet traffic enginerring by optimizing OSPF weights [C]∥INFOCOM 2000. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies.  Tel Aviv:IEEE, 2000: 519528.
[20] ERICSSON M, RESENDE M G C, PARDALOS P M. A genetic algorithm for the weight setting problem in OSPF routing [J]. Journal of Combinatorial Optimizaiton, 2002,6(3): 299333.
[21] SQALLI M H, SAIL S M, MOHIUDDIN M A. An enhanced estimator to multiobjective ospf weight setting problem [C]∥ Network Operations and Management Symposium, 2006. 10th IEEE/IFIP. Vancouver, BC:IEEE, 2006: 240247.
[22] ZUO Yong. Impact of link weight ranges on OSPF weight solutions [C]∥ Communications and Networking in China, 2007. Shanghai:[s. n.], 2007: 7276.
[23] OMNET++ 40 [CP/OL]. [20090515].http://www.omnetpp.org/
[24] GTITM [CP/OL]. [20100115].http://www.cc.gatech.edu/projects/gtitm/gtitm/gtitm.tar.gz.

No related articles found!