Username   Password       Forgot your password?  Forgot your username? 

ISSUES BY YEAR

Volume 8 - 2012

No.1 January 2012
No.2 March 2012
No.3 May 2012

Volume 7 - 2011

No.1 January 2011
No.2 March 2011
No.3 May 2011
No.4 July 2011
No.5 September 2011
No.6 November 2011

Volume 6 - 2010

No.1 January 2010
No.2 March 2010
No.3 May 2010
No.4 July 2010
No.5 September 2010
No.6 November 2010

Volume 5 - 2009

No.1 January 2009
No.2 January 2009
No.3 April 2009
No.4 July 2009
No.5 October 2009

Volume 4 - 2008

No.1 January 2008
No.2 April 2008
No.3 July 2008
No.4 October 2008

Volume 3 - 2007

No.1 January 2007
No.2 April 2007
No.3 July 2007
No.4 October 2007

Volume 2 - 2006

No.1 January 2006
No.2 April 2006
No.3 July 2006
No.4 October 2006

Volume 1 - 2005

No.1 July 2005
No.2 October 2005

Network Reliability Evaluation with Changes in Layout

Volume 6, Number 1, January 2010 - Paper 5  - pp. 63-7

N. K. GOYAL

Reliability Engineering Centre, IIT Kharagpur, INDIA

(Received on September 3, 2008, revised on February 20, 2009)


Abstract:

Network reliability evaluation techniques, e.g., path (cut) set techniques, factoring theorem based techniques etc., evaluate various network reliability measures based on different connectivity criterion of nodes, which is a NP hard problem. A little change in network layout requires repetition of the complete procedure. In this paper, a new approach based on path set technique is proposed. The proposed approach stores and process reliability expressions in terms of minimal path sets and disjoint sets using binary data structure. This paper proposes algorithms for modifying these sets with modifications in network layout. This paper also proposes a method to evaluate reliability defined on the basis of different node connectivity requirements.

 

References: 12

 

Please note : You will need Adobe Acrobat viewer to view the full articles.   Get Free Adobe Reader