Volume 16, Issue 1 (4-2019)                   2019, 16(1): 11-28 | Back to browse issues page

XML Persian Abstract Print

Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

Khodayifar S, Raayatpanah M A, Fouladi A. Optimal Coding Subgraph Selection under Survivability Constraint. Journal of Operational Research and Its Applications. 2019; 16 (1) :11-28
URL: http://jamlu.liau.ac.ir/article-1-1550-en.html
Department of Mathematics, Institute for Advanced Studies in Basic Sciences (IASBS), Gavazang Road, Zanjan, Iran.
Abstract:   (128 Views)
Nowadays communication networks have become an essential and inevitable part of human life. Hence, there is an ever-increasing need for expanding bandwidth, decreasing delay and data transfer costs. These needs necessitate the efficient use of network facilities. Network coding is a new paradigm that allows the intermediate nodes in a network to create new packets by combining the packets received on their incoming edges. Also, in communication network, the extensive use of high capacity physical media like fiber increases the potential damage to network services due to failures in links or nodes (cable cuts, electronic failures on switching centers, etc.). Since quality of service has become a competitive advantage for services in the industry, planners are looking for end-to-end survivable designs that are robust with respect to failure in network components. Survivability is considered as a fraction of the demand that can still be satisfied after each failure scenario. In this paper, attempt has been made to select minimum-cost coding sub-graphs in a single or multiple multicasts over coded packet networks under survivability constraint. First, mathematical optimization models are presented for the problem. Then, the proposed model is solved by using Lagrangian relaxation method. Finally, the efficiency of the proposed model is evaluated through simulation results.
Full-Text [PDF 1023 kb]   (44 Downloads)    
Type of Study: Research | Subject: Special
Received: 2017/08/16 | Accepted: 2019/01/13

Add your comments about this article : Your username or Email: