TY - GEN
T1 - Joint network and rate allocation for video streaming over multiple wireless networks
AU - Jurca, D.
AU - Kellerer, W.
AU - Steinbach, E.
AU - Khan, S.
AU - Thakolsri, S.
AU - Frossard, P.
PY - 2007
Y1 - 2007
N2 - We address the problem of video streaming over multiple parallel networks. In the context of multiple users, accessing different types of applications, we are looking for efficient ways of allocating network resources and selecting network paths for each application, in order to maximize the overall systems performance. Our optimization joint problem consists of finding the appropriate application rate allocation and network parameters for each individual user, such that a universal system quality metric is maximized. A specific mapping between the requirements of each considered application and the overall quality metric is introduced, and our results are compared to other solutions based on throughput optimization strategies. The superiority and robustness of our approach is shown through extensive simulations in constant and dynamic systems, when clients can join/leave the access networks. Furthermore, we introduce heuristic algorithms which can obtain good results and are inexpensive in terms of computation and execution time.
AB - We address the problem of video streaming over multiple parallel networks. In the context of multiple users, accessing different types of applications, we are looking for efficient ways of allocating network resources and selecting network paths for each application, in order to maximize the overall systems performance. Our optimization joint problem consists of finding the appropriate application rate allocation and network parameters for each individual user, such that a universal system quality metric is maximized. A specific mapping between the requirements of each considered application and the overall quality metric is introduced, and our results are compared to other solutions based on throughput optimization strategies. The superiority and robustness of our approach is shown through extensive simulations in constant and dynamic systems, when clients can join/leave the access networks. Furthermore, we introduce heuristic algorithms which can obtain good results and are inexpensive in terms of computation and execution time.
UR - http://www.scopus.com/inward/record.url?scp=48649099757&partnerID=8YFLogxK
U2 - 10.1109/ISM.2007.31
DO - 10.1109/ISM.2007.31
M3 - Conference contribution
AN - SCOPUS:48649099757
SN - 0769530583
SN - 9780769530581
T3 - Proceedings - 9th IEEE International Symposium on Multimedia, ISM 2007
SP - 229
EP - 236
BT - Proceedings - 9th IEEE International Symposium on Multimedia, ISM 2007
T2 - 9th IEEE International Symposium on Multimedia, ISM 2007
Y2 - 10 December 2007 through 12 December 2007
ER -