Bounds on end-to-end statistical delay and jitter in multiple multicast coded packet networks

Raayatpanah, Mohammad Ali; Fathabadi, H. Salehi; Khalaj, Babak Hossein; Khodayifar, Salman; Pardalos, Pãnos M.

doi:10.1016/j.jnca.2013.12.004

Cited by 10 publications

(11 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Networks were generated randomly such that there was a link from the node i to the node j with a probability of 0.4. The nominal cost on each link was generated according to an uniform distribution on the interval [2,8]. The source node and the receivers were chosen randomly and uniformly among all of the nodes.…”

Section: Resultsmentioning

confidence: 99%

“…They formulated the problem as a mixed integer linear programming problem and developed an algorithm based on Benders decomposition. The problem of providing the statistical quality of service guarantees over coded packet networks was studied in [8] which proposed a path-based formulation for the problem. However, in many realistic cases, an accurate estimate for the cost per unit rate of sending coded packets over links may be unavailable.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A robust optimization approach for multicast network coding under uncertain link costs

2016

View full text Add to dashboard Cite

Network coding is a technique that can be used to improve the performance of communication networks by performing mathematical operations at intermediate nodes. An important problem in coding theory is that of finding an optimal coding subgraph for delivering network data from a source node throughout intermediate nodes to a set of destination nodes with the minimum transmission cost. However, in many real applications, it can be difficult to determine exact values or specific probability distributions of link costs. Establishing minimum-cost multicast connections based on erroneous link costs might exhibit poor performance when implemented. This paper considers the problem of minimum-cost multicast using network coding under uncertain link costs. We propose a robust optimization approach to obtain solutions that protect the system against the worst-case value of the uncertainty in a prespecified set. The simulation results show that a robust solution provides significant improvement in worst-case performance while incurring a small loss in optimality for specific instances of the uncertainty.

show abstract

Section: Resultsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

A robust optimization approach for multicast network coding under uncertain link costs

2016

View full text Add to dashboard Cite

show abstract

“…Finally, we compared the performance of our algorithm with the End‐to‐end statistical delay and jitter (ESDJ) algorithm proposed by Raayatpanah et al , that established subgraphs over coded packet networks and guaranteed the QoS requirements of end‐to‐end delay and jitter constraints from a source node to receiver nodes. In order to compute between the two algorithms, we should consider a single session multicast, that is, | M |=1.…”

Section: Resultsmentioning

confidence: 99%

“…Hence, current multicast algorithms over coded packet networks are no longer adequate in such applications. One way to avoid breaks in the continuity of services is to provide budget constraints based on QoS parameters while keeping the overall cost of the solution low . A similar problem for routing multicast without using network coding is called a constrained Steiner tree, which was studied in several works .…”

Section: Introductionmentioning

confidence: 99%

Subgraph selection over coded packet networks with multiple QoS parameters based on DEA

Raayatpanah

2016

Trans. Emerging Tel. Tech.

View full text Add to dashboard Cite

Network coding is a generalisation of conventional routing methods that allows a network node to code information flows before forwarding them. Although network coding could be able to improve the throughput, reliability and security of multicast communications, it does not directly consider the quality of service requirements of multicast routing. In this paper, we study the problem of constructing a subgraph to allocate to coded packets, where several quality of service parameters, for example, bandwidth, delay, profit, packet loss and error rates, are associated with each arc in coded packet networks. For this purpose, we first evaluate the relative efficiency of arcs in the network based on data envelopment analysis techniques to send coded packets. Then, a linear programming model is introduced to determine coding subgraphs with respect to the relative efficiency of the arcs. The proposed approach is illustrated and evaluated through numerical examples. Copyright © 2016 John Wiley & Sons, Ltd.

show abstract

“…Although NC can save bandwidth and increase network throughput, it does not consider the Quality of Service (QoS) of multicast routing directly. In order to meet the QoS requirements of end-to-end delay and jitter from source to destination nodes, Raayatpanah et al (2014) attempted to minimize network cost and the number of multicast sessions, by decomposing the NP-hard problem into master problem and sub-problems through feasible path generation. However, these works mainly focused on the single-channel and single-radio scenario.…”

Section: Related Workmentioning

confidence: 99%

A novel adaptive spectrum allocation scheme for multi-channel multi-radio wireless mesh networks

Ning

Song

Guo

et al. 2015

Journal of Network and Computer Applications

View full text Add to dashboard Cite

Bounds on end-to-end statistical delay and jitter in multiple multicast coded packet networks

Cited by 10 publications

References 27 publications

A robust optimization approach for multicast network coding under uncertain link costs

A robust optimization approach for multicast network coding under uncertain link costs

Subgraph selection over coded packet networks with multiple QoS parameters based on DEA

A novel adaptive spectrum allocation scheme for multi-channel multi-radio wireless mesh networks

Contact Info

Product

Resources

About