<?xml version="1.0" encoding="UTF-8"?>
<article xmlns:xlink="http://www.w3.org/1999/xlink">
<front><article-meta>
<title-group><article-title>Availability and Reliability in Software Defined Networks</article-title></title-group>
<contrib-group>
<contrib contrib-type="author"><name><surname>Shojaie</surname><given-names>Amir Abbas</given-names></name><xref ref-type="aff" rid="aff1"/></contrib>
<contrib contrib-type="author"><name><surname>Seyedsadr</surname><given-names>Taha</given-names></name><xref ref-type="aff" rid="aff1"/></contrib>
<aff id="aff1">Institute of Communications, Transportation and Logistics, ST.C, Tehran Branch, Islamic Azad University, Tehran, Iran.</aff>
</contrib-group>
<abstract><p>Today’s computer networks experience a momentum toward a modern era. There must be some modifications in their servicing form, the network bandwidth and network delay should be increased and minimized respectively to achieve more effective performance. SDNs compared with current networks are less costly and more flexible. In SDN, the control unit is separated from data flow. Increasing reliability and accessibility are among most important SDN’s challenges. In this survey various reliability forms in software have been reviewed, subsequently a SDN architecture model has been studied containing 6 hosts and a storage. The results have shown that with increase in links’ number among hosts, higher the network reliability is.</p></abstract>
<kwd-group kwd-group-type="author"><kwd>Software defined networking</kwd><kwd>Reliability</kwd><kwd>Markov chains</kwd><kwd>Availability</kwd></kwd-group>
</article-meta></front>
<body>
<sec id="sec-1"><label>1</label><title>Introduction</title>
<p>Today&apos;s computer networks experience the momentum of technology and architecture to new technology and architecture and their service provision must be modified. The mobile and video world requires wider bandwidth and faster response while exposes minimal delay. Nowadays people tend to communicate via video services and applications, also cloud-based applications usage has been increased in businesses. Today, technologies are required which can direct WAN network traffic faster and more intelligently. Occurrence of problems, Shortcomings and inability in meeting the new needs has led to create new approaches to network architecture, including the Software Defined Network (SDN) <xref ref-type="bibr" rid="ref-1">[1]</xref>, <xref ref-type="bibr" rid="ref-2">[2]</xref>.</p>
<sec id="sec-2"><label>1.1</label><title>Software Defined Networks</title>
<p>In fact, SDNs are a new architecture in computer networks that are cheaper and more flexible compared to current networks. Routers and switches play the main role in routing and transferring information in current networks, in contrast the network control section is separated form information flow section in SDN and a central controller directs the network. Mostly, the central controller is an Open Source software and the routers which merely direct data, have less intelligence. In SDNs, routers and switches may be deployed virtually on the network <xref ref-type="bibr" rid="ref-1">[1]</xref>, <xref ref-type="bibr" rid="ref-2">[2]</xref>.</p>
<p>SDN components are divide into three layers:</p>
<sec id="sec-3"><label>1.1.1</label><title>Infrastructure layer</title>
<p>This layer contains physical infrastructures such as switches and routers which play the role of simple and intelligent-less components. It is worth mentioning that the routing in the network is the second layer or Control Plane duty in SDN architecture.</p>
<p>In general, this layer is responsible for directing packets into a path recognized suitable by controller. This layer is called Data Plane too.</p>
</sec>
<sec id="sec-4"><label>1.1.2</label><title>Control plane</title>
<p>It includes a central software controller which can be implemented on a server. The controller communication with the infrastructure is done through APIs. Handling data transfer through best path is up to this layer. Controller monitors data flow and network traffic dynamically in SDN architecture, so making decision and smartening is done by it and devices such as switches and routers to this issue.</p>
</sec>
<sec id="sec-5"><label>1.1.3</label><title>Application layer or management plane</title>
<p>This layer contains various programs and applications used on network level and often interact with end-user such as audio and video software. Mostly, business related programs belong to this layer. Usually, these programs communicate to controller via APIs.</p>
<p>South band API: this band’s main duty is to establish communication between control layer and physical layer.</p>
<p>North band API: this band’s main duty is to establish communication between control layer and application layer or management layer.</p>
</sec>
</sec>
<sec id="sec-6"><label>1.2</label><title>Advantages of Using SDN Architecture</title>
<p>Advantages of using SDNs includes saving on purchasing and supporting hardware equipment such as routers and switches, optimized bandwidth utilization. A SDN could be a proper option for providing the following services <xref ref-type="bibr" rid="ref-3">[3]</xref>:</p>
<p>I. A good platform for cloud services provision.</p>
<p>II. Enterprise ICT services secure utilization through devices such as smartphones, tablets and laptops, and protecting network security.</p>
<p>III. Reducing and smartening network traffic.</p>
<p>IV. Distributing and processing Big data.</p>
<p>V. Providing a proper platform for Internet of Things (IoT).</p>
<p>But there is a long way to go before exploiting SDN-based network technology. For example some challenges such as scalability and security, reliability and availability are some of the issues which need to be addressed.</p>
</sec>
</sec>
<sec id="sec-7"><label>2</label><title>Literature Review</title>
<p>One of the most significant challenges of traditional networks is the link failure recovery; in some cases, the network administrator interference is essential for rebuilding the data path in the network <xref ref-type="bibr" rid="ref-4">[4]</xref>.</p>
<p>In a general view of SDN networks, it seems that these networks will provide users with customized recovery algorithms, when the failed signal is received in the recovery mechanism, the network controller directs data into a substitution path. Same as switches and routers failure in traditional networks which causes network disruption, in SDN, misusing or attacking the controller will result in network to fail.</p>
<p>For this reason, network reliability can be increased through backup controllers, in these cases, coordinating and updating information among main controller and backup ones is a necessary factor.</p>
<p>Main controller information Backup is performed when a failure is detected <xref ref-type="bibr" rid="ref-5">[5]</xref>. Paper <xref ref-type="bibr" rid="ref-6">[6]</xref> discusses various algorithms for determining the location of controllers in order to maximize the reliability of the SDN. Among the studied algorithms, the annealing algorithm has yielded the best results.</p>
<p>The issue of controller substitution has been studied in various papers <xref ref-type="bibr" rid="ref-7">[7]</xref>. Authors in <xref ref-type="bibr" rid="ref-8">[8]</xref> discussed the controllers’ deployment and its impact on network traffic, in <xref ref-type="bibr" rid="ref-9">[9]</xref> authors used the Pareto algorithm to deploy controllers in the network. <xref ref-type="bibr" rid="ref-6">[6]</xref> surveyed controllers deployment based on maximizing network reliability. Unlike previous works, <xref ref-type="bibr" rid="ref-7">[7]</xref> has examined the distance between the controller and switches using different algorithms based on two criteria: distances optimization and reliability maximization.</p>
<p>Paper <xref ref-type="bibr" rid="ref-10">[10]</xref> considers a hypothetical model with three switches, six hosts and one storage for SDN. Hosts and switches accessibility to storage is considered in two modes: first, regardless of the switches’ role and second with taking them into account.</p>
<sec id="sec-8"><label>2.1</label><title>Evaluation of System Reliability Using Markov Model</title>
<p>In this model, every component of the system is considered as a block with input and output terminals. The block operates like a switch, if the component is working then the switch is closed; otherwise when the component has failed to perform, the switch is open <xref ref-type="bibr" rid="ref-11">[11]</xref>. Considering the fact that every component’s failure may lead to some blocks being open or closed, the whole system is assumed to be working when there is at least one path between the input and output of the model, and if there is no such a path the system is in failure situation <xref ref-type="bibr" rid="ref-12">[12]</xref>.</p>
<sec id="sec-9"><label>2.1.1</label><title>Markov model</title>
<p>In order to understand the Markov process, let us divide the time into three states: previous, current, and future. The future state of this process does not depend on the path it has passed before, and it solely depends on its current state <xref ref-type="bibr" rid="ref-12">[12]</xref>. Markov model is a stochastic model used to model randomly changing systems. Every state describes a disjoint combination of hale and faulty modules of the system. When the system has n modules, with each module having the possibility to be in working or failure condition, one can consider n + 1 states for the system. In such a system, a failure in a previously working component or maintenance of a previously failed module can cause a change in the system state <xref ref-type="bibr" rid="ref-12">[12]</xref>, <xref ref-type="bibr" rid="ref-13">[13]</xref>.</p>
<p>In the Markov model, the possibility of failure for a module with failure rate , during the time instance ∆ is assumed to be ∆ <xref ref-type="bibr" rid="ref-14">[14]</xref>. Among the different Markov models, let us mention the discrete Markov chain and the hidden Markov model. If a system has a different state S1, … , Sn in each instant, that is, a discrete condition with regular distances, then the system state will change based on a set of probabilities. For a suitable description of this system one needs to know the current state along all the previous states of the system, see <xref ref-type="fig" rid="fig1">Fig.1</xref> <xref ref-type="bibr" rid="ref-15">[15]</xref>, <xref ref-type="bibr" rid="ref-16">[16]</xref> The Markov chain is a model whose output is a set of states where each state corresponds to an observation. One can produce a sequence of expected observations and calculate the probability of its occurrence in the Markov chain <xref ref-type="bibr" rid="ref-12">[12]</xref>. In this process, every state corresponds to an observable event, while in the hidden Markov model observations are random variables of states. Thus, the model is a stochastic hidden model and it is observable through a set of random processes that produce the sequence of observations <xref ref-type="bibr" rid="ref-16">[16]</xref>, <xref ref-type="bibr" rid="ref-17">[17]</xref>.</p>
<fig id="fig1"><label>Figure 1</label><caption><p>A Markov chain with five states.</p></caption><graphic content-type="pdf-region" xlink:href="pdf-region:3:66,544,537.1,778.9"/><p content-type="note">This figure is shown in the PDF version of the article.</p></fig>
</sec>
<sec id="sec-10"><label>2.1.2</label><title>Hidden Markov model</title>
<p>Hidden Markov model was introduced in the late 1960s and its usage in diverse applications is growing rapidly. There are two main reasons for this development: First of all, this model has a strong mathematical structure that provides the theoretical basis of many applied disciplines. Secondly, the hidden Markov model can be used for a variety of different applications, assuming it has been formed in a suitable way.</p>
<p>In the non-hidden Markov model, every state corresponds to an observable event, whereas in the hidden Markov model, observations are probabilistic functions of the states. Therefore, the resultant model is a stochastic model with a hidden random process and it is observable just through a set of random processes that produce the sequence of observations. In the general schematic of the hidden Markov model, shown in <xref ref-type="fig" rid="fig2">Fig. 2</xref>, different states of (previous, current, and future) represent the hidden states and different states of (previous, current, and future) represent the observable states <xref ref-type="bibr" rid="ref-18">[18]</xref></p>
<fig id="fig2"><label>Figure 2</label><caption><p>The general schematic of the hidden markov model.</p></caption><graphic content-type="pdf-region" xlink:href="pdf-region:3:66,131.5,537.1,276.4"/><p content-type="note">This figure is shown in the PDF version of the article.</p></fig>
</sec>
</sec>
<sec id="sec-11"><label>2.2</label><title>Evaluation of System Reliability Using Poisson Model</title>
<p>It is assumed that the software’s test step includes three processes: failure observation, fault discovery, and fault elimination. Software faults are divided into three categories: simple faults, independent complex faults, and dependent complex faults. It is also assumed that no new faults could occur during the fault elimination process. Hence, the total number of discovered faults during the time interval (0, t) could be obtained from the following relation <xref ref-type="bibr" rid="ref-17">[17]</xref>, <xref ref-type="bibr" rid="ref-19">[19]</xref>:</p>
<p>M(t) = m1(t) + m2(t − φ1(t)) + m3(t − φ2(t) ). (1)</p>
<sec id="sec-12"><label>2.2.1</label><title>Modeling the elimination of simple faults ( )</title>
<p>Since it is possible to eliminate the simple faults from the system immediately after being observed by a tester, one can ignore the time delay between observing the failure, discovering the fault and its elimination <xref ref-type="bibr" rid="ref-20">[20]</xref>.</p>
</sec>
<sec id="sec-13"><label>2.2.2</label><title>Modeling the elimination of independent complex faults ( )</title>
<p>When dealing with complex faults the software test team needs more time in order to diagnose the failure causes and eliminate them. For the independent complex faults the time delay between discovery of the fault and its elimination cannot be ignored <xref ref-type="bibr" rid="ref-19">[19]</xref>.</p>
</sec>
<sec id="sec-14"><label>2.2.3</label><title>Modeling the elimination of dependent complex faults ( )</title>
<p>The possibility to eliminate these types of faults is usually less than the independent complex faults, and one cannot eliminate them before resolving the cause of failure <xref ref-type="bibr" rid="ref-19">[19]</xref>.</p>
</sec>
</sec>
<sec id="sec-15"><label>2.3</label><title>Evaluation of System Reliability Using Petri Net</title>
<p>The theory of Petri nets were invented in 1962 by Carl Petri. Simplicity and high capability of using these nets to evaluate software architecture and create operational models has drawn lots of attention to them <xref ref-type="bibr" rid="ref-17">[17]</xref>, <xref ref-type="bibr" rid="ref-20">[20]</xref>.</p>
</sec>
</sec>
<sec id="sec-16"><label>3</label><title>An Example of SDN Architecture</title>
<p>A common SDN architecture is represented in <xref ref-type="fig" rid="fig3">Fig. 3</xref>. Six hosts and a storage are devised to interconnect according to <xref ref-type="table" rid="tab1">Table 1</xref>, in which six hosts are partitioned into three pairs. Basically, host5 and host6 are designated to manage the shared storage by system administrator. Network controller determine switches’ routing topology in order to implement the SDN architecture. Assuming the network user tends to store some information on host1 or host2, the controller assigns static IPs to each host and it is capable of specifying routing paths among the host to accelerate the operation within network. Terminologically, it should be pointed out that a network is called reachable or available, in which transactions and interactions between hosts and storage system are always conducted regardless of any unexpected failure. Also, existing of more paths reaching the storage system for user, makes the network more available.</p>
<table-wrap id="tab1"><label>Table 1</label><caption><p>How hosts and storage communicate.</p></caption><graphic content-type="pdf-region" xlink:href="pdf-region:4:66,178.5,537.1,278.1"/><p content-type="note">This table is shown in the PDF version of the article.</p></table-wrap>
<p>As it is shown in the table above, for instance, host1 only communicates to host3. It is hos1 and host2 responsibility to receive users’ data and transfer it to storage for persistent saving with by means of other hosts, this process is shown in <xref ref-type="fig" rid="fig3">Fig. 3</xref>.</p>
<fig id="fig3"><label>Figure 3</label><caption><p>How hosts and storage communicate.</p></caption><graphic content-type="pdf-region" xlink:href="pdf-region:5:66,594.9,537.1,778.9"/><p content-type="note">This figure is shown in the PDF version of the article.</p></fig>
<p><xref ref-type="fig" rid="fig4">Fig. 4</xref> is representation of the table above in which every state is designated its corresponding value.</p>
<fig id="fig4"><label>Figure 4</label><caption><p>Links reliability in the model.</p></caption><graphic content-type="pdf-region" xlink:href="pdf-region:5:66,353.3,537.1,560.1"/><p content-type="note">This figure is shown in the PDF version of the article.</p></fig>
<p>As it is clear from <xref ref-type="fig" rid="fig4">Fig. 4</xref>, the dark blue color indicates lack of link or connection with zero probability and dark red color implies utmost Reliability.</p>
<p>The architecture makes link between (host1, host2), (host3, host4) and (host5, host6) pairs in order to boost reliability and its impact on overall system reliability is examined. The changes are demonstrated in <xref ref-type="fig" rid="fig5">Fig. 5</xref>.</p>
<fig id="fig5"><label>Figure 5</label><caption><p>How hosts and storage communicate after more links establishment.</p></caption><graphic content-type="pdf-region" xlink:href="pdf-region:5:66,109.9,537.1,269.9"/><p content-type="note">This figure is shown in the PDF version of the article.</p></fig>
<fig id="fig6"><label>Figure 6</label><caption><p>The model reliability after more links establishment.</p></caption><graphic content-type="pdf-region" xlink:href="pdf-region:6:66,577.4,537.1,779.1"/><p content-type="note">This figure is shown in the PDF version of the article.</p></fig>
</sec>
<sec id="sec-17"><label>4</label><title>Conclusion</title>
<p>Initially, SDN was discussed and reliability examination methods in SDN was reviewed. Eventually, a particular architecture was studied containing six hosts and a storage. Network reliability was calculated and determined by means of Markov chain. If more paths exit for user to reach to the storage, the network will be more available. The results above imply the management and control of reliability, and availability in SDN. At end, it seems to improve reliability and recovery in SDN there is need for more survey on increasing mean failure time and decreasing mean repair time, seeking higher availability to be achieved.</p>
</sec>
<sec id="sec-18"><title>Conflict of Interest</title>
<p>The authors declare no conflict of interest.</p>
</sec>
<sec id="sec-19"><title>Data Availability</title>
<p>All data are included in the text.</p>
</sec>
<sec id="sec-20"><title>Funding</title>
<p>This research received no specific grant from funding agencies in the public, commercial, or not-for-profit sectors.</p>
</sec>
</body>
<back><ref-list><title>References</title>
<ref id="ref-1"><label>1</label><mixed-citation>Ghasempour, M. (2016). Software-based networks (with practical workshop) level: beginner - intermediate. Kerman province university jihad. <ext-link ext-link-type="uri" xlink:href="https://b2n.ir/j78826">https://b2n.ir/j78826</ext-link></mixed-citation></ref>
<ref id="ref-2"><label>2</label><mixed-citation>Alirezaei, Saeideh, Khosravi, H. (2016). Software-defined networking (sdn) review. The second national conference on new approaches in computer and electrical engineering. Roudsar, Iran. Civilica. (In Persian). <ext-link ext-link-type="uri" xlink:href="https://civilica.com/doc/522613">https://civilica.com/doc/522613</ext-link></mixed-citation></ref>
<ref id="ref-3"><label>3</label><mixed-citation>Horvath, R., Nedbal, D., &amp; Stieninger, M. (2015). A literature review on challenges and effects of software defined networking. Pcomputer science, 64, 552–561. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.procs.2015.08.563">https://doi.org/10.1016/j.procs.2015.08.563</ext-link></mixed-citation></ref>
<ref id="ref-4"><label>4</label><mixed-citation>Valdivieso Caraguay, Á. L., Benito Peral, A., Barona Lopez, L. I., &amp; Garcia Villalba, L. J. (2014). SDN: evolution and opportunities in the development IoT applications. International journal of distributed sensor networks, 10(5), 735142. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1155/2014/735142">https://doi.org/10.1155/2014/735142</ext-link></mixed-citation></ref>
<ref id="ref-5"><label>5</label><mixed-citation>Valdivieso Caraguay, A. L., &amp; Garcia Villalba, L. J. (2017). Monitoring and discovery for self-organized network management in virtualized and software defined networks. Sensors, 17(4), 731. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.3390/s17040731">https://doi.org/10.3390/s17040731</ext-link></mixed-citation></ref>
<ref id="ref-6"><label>6</label><mixed-citation>Hu, Y., Wang, W., Gong, X., Que, X., &amp; Cheng, S. (2014). On reliability-optimized controller placement for software-defined networks. China communications, 11(2), 38–54. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/CC.2014.6821736">https://doi.org/10.1109/CC.2014.6821736</ext-link></mixed-citation></ref>
<ref id="ref-7"><label>7</label><mixed-citation>Liu, J., Liu, J., &amp; Xie, R. (2016). Reliability-based controller placement algorithm in software defined networking. Computer science and information systems, 13(2), 547–560. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.2298/CSIS160225014L">https://doi.org/10.2298/CSIS160225014L</ext-link></mixed-citation></ref>
<ref id="ref-8"><label>8</label><mixed-citation>Heller, B., Sherwood, R., &amp; McKeown, N. (2012). The controller placement problem. ACM sigcomm computer communication review, 42(4), 473–478. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1145/2377677.2377767">https://doi.org/10.1145/2377677.2377767</ext-link></mixed-citation></ref>
<ref id="ref-9"><label>9</label><mixed-citation>Hock, D., Hartmann, M., Gebert, S., Jarschel, M., Zinner, T., &amp; Tran-Gia, P. (2013). Pareto-optimal resilient controller placement in sdn-based core networks. Proceedings of the 2013 25th international teletraffic congress (ITC). IEEE. (pp. 1–9). <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/ITC.2013.6662939">https://doi.org/10.1109/ITC.2013.6662939</ext-link></mixed-citation></ref>
<ref id="ref-10"><label>10</label><mixed-citation>Nguyen, T. A., Eom, T., An, S., Park, J. S., Hong, J. B., &amp; Kim, D. S. (2015). Availability modeling and analysis for software defined networks. 2015 IEEE 21st pacific rim international symposium on dependable computing (PRDC). IEEE. (pp. 159–168). <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/PRDC.2015.27">https://doi.org/10.1109/PRDC.2015.27</ext-link></mixed-citation></ref>
<ref id="ref-11"><label>11</label><mixed-citation>Khosravi, S., Kargari, M., Teimourpour, B., Talebi, M., Eshghi, A., &amp; Aliabdi, A. (2024). GHM: an ensemble approach to fraud detection with a graph-based hmm method. 2024 10th international conference on web research (ICWR). IEEE. (pp. 99–104). <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/ICWR61162.2024.10533348">https://doi.org/10.1109/ICWR61162.2024.10533348</ext-link></mixed-citation></ref>
<ref id="ref-12"><label>12</label><mixed-citation>Zargar, R. H. M., &amp; Yaghmaee Moghaddam, M. H. (2020). Development of a markov-chain-based solar generation model for smart microgrid energy management system. IEEE transactions on sustainable energy, 11(2), 736–745. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/TSTE.2019.2904436">https://doi.org/10.1109/TSTE.2019.2904436</ext-link></mixed-citation></ref>
<ref id="ref-13"><label>13</label><mixed-citation>Zhang, Q., &amp; Liu, Y. (2022). Reliability evaluation of markov cyber--physical system oriented to cognition of equipment operating status. Computer communications, 181, 80–89. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1016/j.comcom.2021.10.004">https://doi.org/10.1016/j.comcom.2021.10.004</ext-link></mixed-citation></ref>
<ref id="ref-14"><label>14</label><mixed-citation>Raj, J. S., &amp; Rachel, I. S. (2013). A survey on reliability scheduling on grid computing. 2013 7th international conference on intelligent systems and control (ISCO). IEEE. (pp. 331–334). <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/ISCO.2013.6481173">https://doi.org/10.1109/ISCO.2013.6481173</ext-link></mixed-citation></ref>
<ref id="ref-15"><label>15</label><mixed-citation>Kang, K., Nam, M. Y., &amp; Sha, L. (2013). Model-based analysis of wireless system architectures for real-time applications. IEEE transactions on mobile computing. IEEE. 12(2), 219–232. <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1109/TMC.2011.260">https://doi.org/10.1109/TMC.2011.260</ext-link></mixed-citation></ref>
<ref id="ref-16"><label>16</label><mixed-citation>Zaidi, P., &amp; Javadani, T. (2017). Review of three models for assessing software reliability. The first national conference on information technology, communications and soft computing. Esfahan, Iran. Civilica. (In Persian). <ext-link ext-link-type="uri" xlink:href="https://civilica.com/doc/517851">https://civilica.com/doc/517851</ext-link></mixed-citation></ref>
<ref id="ref-17"><label>17</label><mixed-citation>Zaidi, P., &amp; Javadani, T. (2017). Review of three software reliability assessment models. National conference on information technology, communications and software computing. Esfahan, Iran. Civilica. (In Persian) <ext-link ext-link-type="uri" xlink:href="https://civilica.com/doc/517851">https://civilica.com/doc/517851</ext-link></mixed-citation></ref>
<ref id="ref-18"><label>18</label><mixed-citation>Darwish, M. M. G. S. (2017). Intrusion detection using the phi markov model. The 9th national command and control conference of Iran. Tehran, Iran. Civilica. (In Persian) <ext-link ext-link-type="uri" xlink:href="https://civilica.com/doc/661340/">https://civilica.com/doc/661340/</ext-link></mixed-citation></ref>
<ref id="ref-19"><label>19</label><mixed-citation>Mieghem, P. (2006). Performance analysis of communications networks and systems. Cambridge University Press. <ext-link ext-link-type="uri" xlink:href="http://dx.doi.org/10.1017/CBO9780511616488">http://dx.doi.org/10.1017/CBO9780511616488</ext-link></mixed-citation></ref>
<ref id="ref-20"><label>20</label><mixed-citation>Khatrian, S., Yaghoubi, T. (2014). A new model for evaluating software reliability based on the inhomogenous poisson process. Conference on computer engineering and sustainable development with a focus on computer networking, modeling and systems security. Mashhad, Iran, Civilica. (In Persian). <ext-link ext-link-type="uri" xlink:href="https://civilica.com/doc/239073">https://civilica.com/doc/239073</ext-link></mixed-citation></ref>
<ref id="ref-21"><label>21</label><mixed-citation>Akhtarian, S., &amp; Yaghoobi, T. (2016). A generalized model for software reliability evaluation based on non-homogeneous poisson process. Journal of statistical sciences, 10(1). (In Persian). <ext-link ext-link-type="uri" xlink:href="http://jss.irstat.ir/article-1-250-en.html">http://jss.irstat.ir/article-1-250-en.html</ext-link></mixed-citation></ref>
<ref id="ref-22"><label>22</label><mixed-citation>Ajmone Marsan, M., Balbo, G., Conte, G., Donatelli, S., Franceschinis, G., &amp; others. (1995). Modelling with generalized stochastic Petri nets. John Wiley &amp; Sons Inc. <ext-link ext-link-type="uri" xlink:href="https://iris.unito.it/handle/2318/25289">https://iris.unito.it/handle/2318/25289</ext-link></mixed-citation></ref>
</ref-list></back>
</article>