Determining the optimal double-component assignment for a stochastic computer network
This study determines the optimal double-component assignment based on the system reliability criterion for a computer system, in which the computer system is represented as a network with a set of links and a set of vertices. The double-component assignment is to assign a set of transmission lines (resp. facilities) to the links (resp. vertices) of the network, in which each transmission line (resp. facility) has multiple states due to maintenance or failure. Thus, the computer system according to any double-component assignment is called a stochastic computer network. The system reliability is the probability that the specific units of data are successfully transmitted through the stochastic computer network. An optimization algorithm which integrates the genetic algorithm, minimal paths, and Recursive Sum of Disjoint Products is utilized to find the optimal double-component assignment with maximal system reliability. Several computer networks are utilized to demonstrate the efficiency of the proposed algorithm compared with other algorithms. By solving this problem, data can be more reliably transmitted and thus the organization operation is executed more smoothly.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 40 (2012)
Issue (Month): 1 (January)
|Contact details of provider:|| Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description|
|Order Information:|| Postal: http://www.elsevier.com/wps/find/supportfaq.cws_home/regional|
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Pentico, David W., 2007. "Assignment problems: A golden anniversary survey," European Journal of Operational Research, Elsevier, vol. 176(2), pages 774-793, January.
- Lin, Yi-Kuei, 2007. "On a multicommodity stochastic-flow network with unreliable nodes subject to budget constraint," European Journal of Operational Research, Elsevier, vol. 176(1), pages 347-360, January.
- Yeh, Wei-Chang, 2004. "Multistate network reliability evaluation under the maintenance cost constraint," International Journal of Production Economics, Elsevier, vol. 88(1), pages 73-83, March.
- Vallada, Eva & Ruiz, Rubén, 2010. "Genetic algorithms with path relinking for the minimum tardiness permutation flowshop problem," Omega, Elsevier, vol. 38(1-2), pages 57-67, February.
- Yao, Ming-Jong & Chu, Weng-Ming, 2008. "A genetic algorithm for determining optimal replenishment cycles to minimize maximum warehouse space requirements," Omega, Elsevier, vol. 36(4), pages 619-631, August.
- Martin, Clarence H, 2009. "A hybrid genetic algorithm/mathematical programming approach to the multi-family flowshop scheduling problem with lot streaming," Omega, Elsevier, vol. 37(1), pages 126-137, February.
- Udhayakumar, A. & Charles, V. & Kumar, Mukesh, 2011. "Stochastic simulation based genetic algorithm for chance constrained data envelopment analysis problems," Omega, Elsevier, vol. 39(4), pages 387-397, August.
- repec:eee:reensy:v:94:y:2009:i:5:p:913-921 is not listed on IDEAS
When requesting a correction, please mention this item's handle: RePEc:eee:jomega:v:40:y:2012:i:1:p:120-130. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Dana Niculescu)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.