TY - JOUR
T1 - Maintainable stochastic communication network reliability within tolerable packet error rate
AU - Kumari, Suchi
AU - Kumar, Rajesh
AU - Kadry, Seifedine
AU - Namasudra, Suyel
AU - Taniar, David
N1 - Funding Information:
I am thankful to Prof. Aparajita Ojha for supporting in my early research work related to this area.
Publisher Copyright:
© 2021 Elsevier B.V.
Copyright:
Copyright 2021 Elsevier B.V., All rights reserved.
PY - 2021/10/1
Y1 - 2021/10/1
N2 - The communication networks are complex and considered a stochastic flow network. This throws enormous challenges for the service provider to provide a desired Quality of Service (QoS) to the customer. Due to the stochastic behavior of the network, ensuring QoS requires serious efforts to make the entire system work within the given time constraint, cost, and failure rate. When the communication problem is time-bound, providing a quick and reasonable solution with a permissible error rate is of great importance. Therefore, in this paper, fast solutions to data communication problems are proposed to send the required d units of user's data from the desired source node to the destination node within some constraints such as permissible error rate ϵ, time constraint T and maintenance budget constraints B. System reliability and the performance of the proposed approaches are evaluated using minimal paths. All the minimal flow vectors evaluated from minimal paths that satisfy all the above-mentioned constraints are considered for network reliability evaluation. Further, the proposed approaches are observed as faster concerning computation time than the existing approaches.
AB - The communication networks are complex and considered a stochastic flow network. This throws enormous challenges for the service provider to provide a desired Quality of Service (QoS) to the customer. Due to the stochastic behavior of the network, ensuring QoS requires serious efforts to make the entire system work within the given time constraint, cost, and failure rate. When the communication problem is time-bound, providing a quick and reasonable solution with a permissible error rate is of great importance. Therefore, in this paper, fast solutions to data communication problems are proposed to send the required d units of user's data from the desired source node to the destination node within some constraints such as permissible error rate ϵ, time constraint T and maintenance budget constraints B. System reliability and the performance of the proposed approaches are evaluated using minimal paths. All the minimal flow vectors evaluated from minimal paths that satisfy all the above-mentioned constraints are considered for network reliability evaluation. Further, the proposed approaches are observed as faster concerning computation time than the existing approaches.
KW - Maintainable stochastic flow network
KW - Minimal path
KW - Packet transmission error rate
KW - Quality of Services
UR - http://www.scopus.com/inward/record.url?scp=85111929116&partnerID=8YFLogxK
U2 - 10.1016/j.comcom.2021.07.023
DO - 10.1016/j.comcom.2021.07.023
M3 - Article
AN - SCOPUS:85111929116
SN - 0140-3664
VL - 178
SP - 161
EP - 168
JO - Computer Communications
JF - Computer Communications
ER -