Skip to main content
Log in

Stochastic computer network with multiple terminals under total accuracy rate

  • Published:
Journal of Zhejiang University SCIENCE C Aims and scope Submit manuscript

Abstract

From the viewpoint of service level agreements, data transmission accuracy is one of the critical performances for assessing Internet by service providers and enterprise customers. The stochastic computer network (SCN), in which each edge has several capacities and the accuracy rate, has multiple terminals. This paper is aimed mainly to evaluate the system reliability for an SCN, where system reliability is the probability that the demand can be fulfilled under the total accuracy rate. A minimal capacity vector allows the system to transmit demand to each terminal under the total accuracy rate. This study proposes an efficient algorithm to find all minimal capacity vectors by minimal paths. The system reliability can then be computed in terms of all minimal capacity vectors by the recursive sum of disjoint products (RSDP) algorithm.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Alexopoulos, C., 1995. A note on state-space decomposition methods for analyzing stochastic flow networks. IEEE Trans. Rel., 44(2):354–357. [doi:10.1109/24.387394]

    Article  Google Scholar 

  • Amer, P.D., 1982. A measurement center for the NBS local area computer network. IEEE Trans. Comput., C-31(8): 723–729. [doi:10.1109/TC.1982.1676078]

    Article  Google Scholar 

  • Aven, T., 1985. Reliability evaluation of multistate systems with multistate components. IEEE Trans. Rel., R-34(5): 473–479. [doi:10.1109/TR.1985.5222235]

    Article  MathSciNet  Google Scholar 

  • Cheng, S.T., 1998. Topological optimization of a reliable communication network. IEEE Trans. Rel., 47(3):225–233. [doi:10.1109/24.740489]

    Article  Google Scholar 

  • Chlamtac, I., 1980. Issues in Design and Measurement of Local Area Networking. 6th Int. Computer Measurement Group Conf., p.32–34.

  • Choi, B.Y., Park, J., Zhang, Z.L., 2003. Adaptive Random Sampling for Traffic Load Measurement. IEEE Int. Conf. on Communications, p.1552–1556. [doi:10.1109/ICC.2003.1203863]

  • Claffy, K.C., Polyzos, G.C., Braun, H.W., 1993. Application of Sampling Methodologies to Network Traffic Characterization. Proc. ACM SIGCOMM, p.194–203. [doi:10.1145/166237.166256]

  • Feldmann, A., Greenberg, A., Reingold, N., Lund, C., Rexford, J., True, F., 2001. Deriving traffic demands for operational IP networks: methodology and experience. IEEE/ACM Trans. Network., 9(3):265–279. [doi:10.1109/90.929850]

    Article  Google Scholar 

  • Ford, L.R., Fulkerson, D.R., 1962. Flow in Networks. Princeton University Press, USA.

    Google Scholar 

  • Huang, F.M., Lan, C.W., Yang, J.H., 2009. An optimal QoS-based Web service selection scheme. Inf. Sci., 179(19):3309–3322. [doi:10.1016/j.ins.2009.05.018]

    Article  Google Scholar 

  • Hudson, J.C., Kapur, K.C., 1985. Reliability bounds for multi-state systems with multistate components. Oper. Res., 33(1):153–160. [doi:10.1287/opre.33.1.153]

    Article  MATH  Google Scholar 

  • Jain, R., Routhier, S.A., 1986. Packet trains: measurements and a new model for computer network traffic. IEEE J. Sel. Areas Commun., 4(6):986–995. [doi:10.1109/JSAC.1986.1146410]

    Article  Google Scholar 

  • Jane, C.C., Lin, J.S., Yuan, J., 1993. On reliability evaluation of a limited-flow network in terms of minimal cutsets. IEEE Trans. Rel., 42(3):354–361. [doi:10.1109/24.257817]

    Article  MATH  Google Scholar 

  • Jedwab, J., Phaal, P., Pinna, B., 1992. Traffic Estimation for the Largest Sources, on a Network, Using Packet Sampling with Limited Storage. Technical Report HPL-92-35, HP Labs Technical Report.

  • Lin, J.S., Jane, C.C., Yuan, J., 1995. On reliability evaluation of a capacitated-flow network in terms of minimal pathsets. Networks, 25(3):131–138. [doi:10.1002/net.3230250306]

    Article  MATH  Google Scholar 

  • Lin, Y.K., 2001. A simple algorithm for reliability evaluation of a stochastic-flow network with node failure. Comput. Oper. Res., 28(13):1277–1285. [doi:10.1016/S0305-0548(00)00039-3]

    Article  MathSciNet  MATH  Google Scholar 

  • Lin, Y.K., 2002. Using minimal cuts to evaluate the system reliability of a stochastic flow network with failures at nodes and arcs. Rel. Eng. Syst. Safety, 75(1):41–46. [doi:10.1016/S0951-8320(01)00110-7]

    Article  Google Scholar 

  • Lin, Y.K., 2009. Optimal routing policy of a stochastic-flow network. Comput. Ind. Eng., 56(4):1414–1418. [doi:10.1016/j.cie.2008.09.002]

    Article  Google Scholar 

  • Lin, Y.K., 2010. A stochastic model to study the system capacity for supply chains in terms of minimal cuts. Int. J. Prod. Econ., 124(1):181–187. [doi:10.1016/j.ijpe.2009.10.022]

    Article  Google Scholar 

  • Lin, Y.K., Yeh, C.T., 2011. Reliability optimization of component assignment problem for a multistate network in terms of minimal cuts. J. Ind. Manag. Optim., 7(1):211–227. [doi:10.3934/jimo.2011.7.211]

    Article  MathSciNet  MATH  Google Scholar 

  • Mori, T., Takine, T., Pan, J., Kawahara, R., Uchida, M., Goto, S., 2007. Identifying heavy-hitter flows from sampled flow statistics. IEICE Trans. Commun., E90-B(11):3061–3072. [doi:10.1093/ietcom/e90-b.11.3061]

    Article  Google Scholar 

  • Ramirez-Marquez, J.E., Rocco, C.M., 2009. Stochastic network interdiction optimization via capacitated network reliability modeling and probabilistic solution discovery. Rel. Eng. Syst. Safety, 94(5):913–921. [doi:10.1016/j.ress.2008.10.006]

    Article  Google Scholar 

  • Ramirez-Marquez, J.E., Rocco, S.C.M., Levitin, G., 2009. Optimal protection of general source-sink networks via evolutionary techniques. Rel. Eng. Syst. Safety, 94(10): 1676–1684. [doi:10.1016/j.ress.2009.05.002]

    Article  Google Scholar 

  • Sausen, P.S., Spohn, M.A., Perkusich, A., 2010. Broadcast routing in wireless sensor networks with dynamic power management and multi-coverage backbones. Inf. Sci., 180(5):653–663. [doi:10.1016/j.ins.2009.11.016]

    Article  Google Scholar 

  • Wang, J.Z., Varman, P., Xie, C.S., 2011. Optimizing storage performance in public cloud platforms. J. Zhejiang Univ.-Sci. C (Comput. & Electron.), 12(12):951–964. [doi:10.1631/jzus.C1100097]

    Article  Google Scholar 

  • Xue, J., 1985. On multistate system analysis. IEEE Trans. Rel., R-34(4):329–337. [doi:10.1109/TR.1985.5222178]

    Article  Google Scholar 

  • Yarlagadda, R., Hershey, J., 1991. Fast algorithm for computing the reliability of communication network. Int. J. Electron., 70(3):549–564. [doi:10.1080/00207219108921308]

    Article  MathSciNet  Google Scholar 

  • Yeh, W.C., 1998. A revised layered-network algorithm to search for all d-minpaths of a limited-flow acyclic network. IEEE Trans. Rel., 47(4):436–442. [doi:10.1109/24.756087]

    Article  Google Scholar 

  • Yeh, W.C., 2004. Multistate network reliability evaluation under the maintenance cost constraints. Int. J. Prod. Econ., 88(1):73–83. [doi:10.1016/S0925-5273(03)00180-4]

    Article  Google Scholar 

  • Yeh, W.C., 2005. A new approach to evaluating reliability of multistate networks under the cost constraint. Omega, 33(3):203–209. [doi:10.1016/j.omega.2004.04.005]

    Article  Google Scholar 

  • Zibanezhad, B., Zamanifar, K., Sadjady, R.S., Rastegari, Y., 2011. Applying gravitational search algorithm in the QoS-based Web service selection problem. J. Zhejiang Univ.-Sci. (Comput. & Electron.), 12(9):730–742. [doi:10.1631/jzus.C1000305]

    Article  Google Scholar 

  • Zuo, M.J., Tian, Z., Huang, H.Z., 2007. An efficient method for reliability evaluation of multistate networks given all minimal path vectors. IIE Trans., 39(8):811–817. [doi:10.1080/07408170601013653]

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yi-Kuei Lin.

Additional information

Project (No. NSC 99-2221-E-011-066-MY3) supported in part by the National Science Council, Taiwan

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lin, YK., Huang, CF. Stochastic computer network with multiple terminals under total accuracy rate. J. Zhejiang Univ. - Sci. C 14, 75–84 (2013). https://doi.org/10.1631/jzus.C1200220

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1631/jzus.C1200220

Key words

CLC number

Navigation