hrcak mascot   Srce   HID

Izvorni znanstveni članak
https://doi.org/10.17535/crorr.2016.0003

The critical node problem in stochastic networks with discrete-time Markov chain

Gholam Hassan Shirdel   ORCID icon orcid.org/0000-0003-2759-4606 ; Department of Mathematics, Faculty of Basic Science, University of Qom, Qom, Iran
Mohsen Abdolhosseinzadeh ; Department of Mathematics, Faculty of Basic Science, University of Qom, Qom, Iran

Puni tekst: engleski, pdf (338 KB) str. 33-46 preuzimanja: 455* citiraj
APA 6th Edition
Shirdel, G.H. i Abdolhosseinzadeh, M. (2016). The critical node problem in stochastic networks with discrete-time Markov chain. Croatian Operational Research Review, 7 (1), 33-46. https://doi.org/10.17535/crorr.2016.0003
MLA 8th Edition
Shirdel, Gholam Hassan i Mohsen Abdolhosseinzadeh. "The critical node problem in stochastic networks with discrete-time Markov chain." Croatian Operational Research Review, vol. 7, br. 1, 2016, str. 33-46. https://doi.org/10.17535/crorr.2016.0003. Citirano 05.08.2021.
Chicago 17th Edition
Shirdel, Gholam Hassan i Mohsen Abdolhosseinzadeh. "The critical node problem in stochastic networks with discrete-time Markov chain." Croatian Operational Research Review 7, br. 1 (2016): 33-46. https://doi.org/10.17535/crorr.2016.0003
Harvard
Shirdel, G.H., i Abdolhosseinzadeh, M. (2016). 'The critical node problem in stochastic networks with discrete-time Markov chain', Croatian Operational Research Review, 7(1), str. 33-46. https://doi.org/10.17535/crorr.2016.0003
Vancouver
Shirdel GH, Abdolhosseinzadeh M. The critical node problem in stochastic networks with discrete-time Markov chain. Croatian Operational Research Review [Internet]. 2016 [pristupljeno 05.08.2021.];7(1):33-46. https://doi.org/10.17535/crorr.2016.0003
IEEE
G.H. Shirdel i M. Abdolhosseinzadeh, "The critical node problem in stochastic networks with discrete-time Markov chain", Croatian Operational Research Review, vol.7, br. 1, str. 33-46, 2016. [Online]. https://doi.org/10.17535/crorr.2016.0003

Sažetak
The length of the stochastic shortest path is defined as the arrival probability from a source node to a destination node. The uncertainty of the network topology causes unstable connections between nodes. A discrete-time Markov chain is devised according to the uniform distribution of existing arcs where the arrival probability is computed as a finite transition probability from the initial state to the absorbing state. Two situations are assumed, departing from the current state to a new state, or waiting in the current state while expecting better conditions. Our goal is to contribute to determining the critical node in a stochastic network, where its absence results in the greatest decrease of the arrival probability. The proposed method is a simply application for analyzing the resistance of networks against congestion and provides some crucial information of the individual nodes. Finally, this is illustrated using networks of various topologies.

Ključne riječi
stochastic network; discrete-time Markov chain; arrival probability; critical node problem

Hrčak ID: 157347

URI
https://hrcak.srce.hr/157347

Posjeta: 777 *