Optimal Worst-Case QoS Routing in Constrained AWGN Channel Network

In this paper, we extend the optimal worst-case QoS routing algorithm and metric definition given in [1]. We prove that in addition to the q-ary symmetric and q-ary erasure channel model, the necessary and sufficient conditions defined in [2] for the Generalized Dijkstra's Algorithm (GDA) can be used with a constrained non-negative-mean AWGN channel. The generalization allowed the computation of the worst-case QoS metric value for a given edge weight density. The worst-case value can then be used as the routing metric in networks where some nodes have error correcting capabilities. The result is an optimal worst-case QoS routing algorithm that uses the Generalized Dijkstra's Algorithm as a subroutine with a polynomial time complexity of O(V^3)

P2P live streaming towards best video quality

Reproduced with the kind permission of the copyright owne

A high-throughput overlay multicast infrastructure with network coding

Network coding has been recently proposed in information theory as a new dimension of the information multicast problem that helps achieve optimal transmission rate or cost. End hosts in overlay networks are natural candidates to perform network coding, due to its available computational capabilities. In this paper, we seek to bring theoretical advances in network coding to the practice of high-throughput multicast in overlay networks. We have completed the first real implementation of network coding in end hosts, as well as decentralized algorithms to construct the routing strategies and to perform random code assignment. Our experiences suggest that approaching maximum throughput with network coding is not only theoretically sound, but also practically promising. We also present a number of unique challenges in designing and realizing coded data dissemination, and corresponding solution techniques to address them