[an error occurred while processing this directive]
   
 
���¿��ټ��� �߼�����
   ��ҳ  �ڿ�����  ��ί��  Ͷ��ָ��  �ڿ�����  ��������  �� �� ��  ��ϵ����
�������պ����ѧѧ�� 2012, Vol. Issue (2) :228-232    DOI:
���� ����Ŀ¼ | ����Ŀ¼ | ������� | �߼����� << | >>
��������ʽ�㷨������ɿ��Է��䷽��
����Ө, ����Խ*
�������պ����ѧ �ɿ�����ϵͳ����ѧԺ, ���� 100191
Network reliability allocation method based on heuristic algorithm
Li Ruiying, Ren Wuyue*
School of Reliability and Systems Engineering, Beijing University of Aeronautics and Astronautics, Beijing 100191, China

ժҪ
�����
�������
Download: PDF (KB)   HTML KB   Export: BibTeX or EndNote (RIS)      Supporting Info
ժҪ ��������Ľṹ������,���еľ���ɿ��Է��䷽������ֱ��Ӧ��.��AGREE(Advisory Group on Reliability of Electronic Equipment)�����Ļ�����,��������ɿ����벿���ɿ��Եĺ�����ϵȷ�����粿����Ҫ��,��������ʽ�㷨�𲽵���ʵ��������k/N�˿ɿ��Է���,������޷�������Ӧ�ô���ģ�Ϳ�չ�ɿ��Է��������.���й�������(CERNET,China Education and Research Network)�Ǹ���Ϊ����,Ӧ�ø÷���ʵ����75%����ڵ���ͨ�ɿ���ָ��ķ���,����һ�������˵�����ֹ����������ɿ���ָ��Ҫ��Ȳ����Է�������Ӱ��,ͨ�����ƿɿ�����ʱ��仯������֤���˷���������������ɿ���ָ��Ҫ��,˵���˸÷�������ȷ�Ժ�������.
Service
�ѱ����Ƽ�������
�����ҵ����
�������ù�����
Email Alert
RSS
�����������
����Ө
����Խ
�ؼ����� ����   �ɿ���   ����ʽ�㷨   ����������     
Abstract�� As network structure is difficult to be described with series and parallel models. Those traditional reliability allocation methods cannot be used by networks directly. A new method based on heuristic algorithm was advanced to solve the k/N terminal reliability allocation problem. Like advisory group on reliability of electronic equipment(AGREE) method, the new method also concerns about component importance and complexity. The component importance was calculated by taking partial derivatives of the function that relates component reliabilities to network reliability. The component complexity depends on the parts number which it owns. It solves the problem that the network reliability cannot be allocated by AGREE method with simple series models. This new method was applied to China education and research network (CERNET) backbone. Its reliability requirement, the connection probability among 75% of nodes, was allocated. It also discussed the affection to reliability allocation if some parameters, such as iteration termination value and network reliability requirements, shift. The curve of reliability over time verifies that the allocation results can meet reliability requirement of CERNET. The case study illustrates the applicability and correctness of this new allocation method.
Keywords�� networks   reliability   heuristic algorithms   binary search     
Received 2010-10-29;
Fund:��������Ȼ����������Ŀ(4113074)
���ñ���:   
����Ө, ����Խ.��������ʽ�㷨������ɿ��Է��䷽��[J]  �������պ����ѧѧ��, 2012,V(2): 228-232
Li Ruiying, Ren Wuyue.Network reliability allocation method based on heuristic algorithm[J]  JOURNAL OF BEIJING UNIVERSITY OF AERONAUTICS AND A, 2012,V(2): 228-232
���ӱ���:  
http://bhxb.buaa.edu.cn//CN/     ��     http://bhxb.buaa.edu.cn//CN/Y2012/V/I2/228
Copyright 2010 by �������պ����ѧѧ��