MC-based Algorithm for a telecommunication network under node and budget constraints

It is an important issue to design some performance indexes in order to measure the performance for a telecommunication network. Network analysis is an available approach to solve the performance problem for a real-life system. We construct a two-commodity stochastic-flow network with unreliable nodes (arcs and nodes all have several possible capacities and may fail) to model the telecommunication network. In which, all types of commodity are transmitted through the same network simultaneously and compete the capacities. This paper defines the system capacity as a 2-tuple vector, and then proposes a performance index, the probability that the upper bound of the system capacity equals a demand vector subject to the budget constraint. An upper boundary point is a vector representing the capacities of arcs and nodes, and is the maximal vector exactly meeting the demand vector. A simple algorithm based on minimal cuts (or named MC-based algorithm) is then presented to generate all upper boundary points in order to evaluate the performance index. The storage and computational time complexity of this algorithm are also analyzed. The performance evaluation for the multicommodity case can be extended easily.

[1]  Yuanlong Shen,et al.  A new simple algorithm for enumerating all minimal paths and cuts of a graph , 1995 .

[2]  Wei-Chang Yeh,et al.  A revised layered-network algorithm to search for all d-minpaths of a limited-flow acyclic network , 1998 .

[3]  John Yuan,et al.  Reliability evaluation of a limited-flow network in terms of minimal cutsets , 1993 .

[4]  Suresh Rai,et al.  An efficient cutset approach for evaluating communication-network reliability with heterogeneous link-capacities , 2005, IEEE Transactions on Reliability.

[5]  Yi-Kuei Lin.  Reliability evaluation for a multi‐commodity flow model under budget constraint , 2002 .

[6]  Yi-Kuei Lin,et al.  Two-commodity reliability evaluation for a stochastic-flow network with node failure , 2002, Comput. Oper. Res..

[7]  K. K. Aggarwal,et al.  A Simple Method for Reliability Evaluation of a Communication System , 1975, IEEE Trans. Commun..

[8]  Nasser Fard,et al.  Cutset enumeration of network systems with link and node failures , 1999 .

[9]  Amjed M. Al-Ghanim,et al.  A heuristic technique for generating minimal path and cutsets of a general network , 1999 .

[10]  Wei-Chang Yeh.  A new approach to evaluate reliability of multistate networks under the cost constraint , 2005 .

[11]  W. Griffith.  MULTISTATE RELIABILITY MODELS , 1980 .

[12]  Yi-Kuei Lin,et al.  ON RELIABILITY EVALUATION OF A STOCHASTIC-FLOW NETWORK IN TERMS OF MINIMAL CUTS , 2001 .

[13]  Chin-Chia Jane,et al.  On reliability evaluation of a capacitated-flow network in terms of minimal pathsets , 1995, Networks.

[14]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

[15]  Yi-Kuei Lin,et al.  A simple algorithm for reliability evaluation of a stochastic-flow network with node failure , 2001, Comput. Oper. Res..

[16]  Xue Janan,et al.  On Multistate System Analysis , 1985, IEEE Transactions on Reliability.

[17]  Jsen-Shung Lin,et al.  Reliability evaluation of capacitated-flow networks with budget constraints , 1998 .

[18]  Wei-Chang Yeh.  A simple algorithm to search for all d-MPs with unreliable nodes , 2001, Reliab. Eng. Syst. Saf..

[19]  Yi-Kuei Lin,et al.  Reliability of a stochastic-flow network with unreliable branches & nodes, under budget constraints , 2004, IEEE Trans. Reliab..

[20]  Yi-Kuei Lin,et al.  ON THE MULTICOMMODITY RELIABILITY FOR A STOCHASTIC- FLOW NETWORK WITH NODE FAILURE UNDER BUDGET CONSTRAINT , 2003 .