@inproceedings{Ehsan2007,
abstract = {Video streaming applications have gained in popularity in recent years. The quality of service offered by such applications is limited by the available transmission rates as well as timevarying conditions, such as, channel fading and network congestion, which lead to packet losses. Scalable video coding techniques that allow for the flexible adaptation of temporal resolution as well as quality of an encoded bitstream can be immensely useful in developing video streaming applications that can adapt to time-varying network and channel conditions. Scalable coding techniques, however, are generally designed to offer progressive refinement, which introduces dependencies between encoded video packets. Therefore, when determining a packet scheduling technique for scalable coded video, the possibility of random packet losses, which might affect the decodability of subsequent packets, must be taken into account. In this paper, we take into account the available transmission rate, possibly time-varying channel conditions, and the possibility of random packet losses, to design a scheduling technique for video packets in a scalable bitstream. Since the optimal solution to the scheduling problem requires an exhaustive, and therefore, intractable computation, we propose a greedy algorithm that will schedule the optimal packet for transmission at a given transmission opportunity based on the encoded content and the available channel state information. Simulation results show significant gains in performance when the proposed technique is compared to content and channel independent packet scheduling techniques.},
author = {Maani, Ehsan and Luo, Yijing and Pahalawatta, Peshala and Katsaggelos, Aggelos},
booktitle = {2007 16th International Conference on Computer Communications and Networks},
doi = {10.1109/ICCCN.2007.4317882},
isbn = {978-1-4244-1250-1},
issn = {10952055},
month = {aug},
pages = {591--596},
publisher = {IEEE},
title = {{Packet Scheduling for Scalable Video Streaming Over Lossy Packet Access Networks}},
url = {http://ieeexplore.ieee.org/document/4317882/},
year = {2007}
}

{"_id":"AGByBHWTW4cEyapHe","bibbaseid":"maani-luo-pahalawatta-katsaggelos-packetschedulingforscalablevideostreamingoverlossypacketaccessnetworks-2007","author_short":["Maani, E.","Luo, Y.","Pahalawatta, P.","Katsaggelos, A."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","abstract":"Video streaming applications have gained in popularity in recent years. The quality of service offered by such applications is limited by the available transmission rates as well as timevarying conditions, such as, channel fading and network congestion, which lead to packet losses. Scalable video coding techniques that allow for the flexible adaptation of temporal resolution as well as quality of an encoded bitstream can be immensely useful in developing video streaming applications that can adapt to time-varying network and channel conditions. Scalable coding techniques, however, are generally designed to offer progressive refinement, which introduces dependencies between encoded video packets. Therefore, when determining a packet scheduling technique for scalable coded video, the possibility of random packet losses, which might affect the decodability of subsequent packets, must be taken into account. In this paper, we take into account the available transmission rate, possibly time-varying channel conditions, and the possibility of random packet losses, to design a scheduling technique for video packets in a scalable bitstream. Since the optimal solution to the scheduling problem requires an exhaustive, and therefore, intractable computation, we propose a greedy algorithm that will schedule the optimal packet for transmission at a given transmission opportunity based on the encoded content and the available channel state information. Simulation results show significant gains in performance when the proposed technique is compared to content and channel independent packet scheduling techniques.","author":[{"propositions":[],"lastnames":["Maani"],"firstnames":["Ehsan"],"suffixes":[]},{"propositions":[],"lastnames":["Luo"],"firstnames":["Yijing"],"suffixes":[]},{"propositions":[],"lastnames":["Pahalawatta"],"firstnames":["Peshala"],"suffixes":[]},{"propositions":[],"lastnames":["Katsaggelos"],"firstnames":["Aggelos"],"suffixes":[]}],"booktitle":"2007 16th International Conference on Computer Communications and Networks","doi":"10.1109/ICCCN.2007.4317882","isbn":"978-1-4244-1250-1","issn":"10952055","month":"aug","pages":"591–596","publisher":"IEEE","title":"Packet Scheduling for Scalable Video Streaming Over Lossy Packet Access Networks","url":"http://ieeexplore.ieee.org/document/4317882/","year":"2007","bibtex":"@inproceedings{Ehsan2007,\nabstract = {Video streaming applications have gained in popularity in recent years. The quality of service offered by such applications is limited by the available transmission rates as well as timevarying conditions, such as, channel fading and network congestion, which lead to packet losses. Scalable video coding techniques that allow for the flexible adaptation of temporal resolution as well as quality of an encoded bitstream can be immensely useful in developing video streaming applications that can adapt to time-varying network and channel conditions. Scalable coding techniques, however, are generally designed to offer progressive refinement, which introduces dependencies between encoded video packets. Therefore, when determining a packet scheduling technique for scalable coded video, the possibility of random packet losses, which might affect the decodability of subsequent packets, must be taken into account. In this paper, we take into account the available transmission rate, possibly time-varying channel conditions, and the possibility of random packet losses, to design a scheduling technique for video packets in a scalable bitstream. Since the optimal solution to the scheduling problem requires an exhaustive, and therefore, intractable computation, we propose a greedy algorithm that will schedule the optimal packet for transmission at a given transmission opportunity based on the encoded content and the available channel state information. Simulation results show significant gains in performance when the proposed technique is compared to content and channel independent packet scheduling techniques.},\nauthor = {Maani, Ehsan and Luo, Yijing and Pahalawatta, Peshala and Katsaggelos, Aggelos},\nbooktitle = {2007 16th International Conference on Computer Communications and Networks},\ndoi = {10.1109/ICCCN.2007.4317882},\nisbn = {978-1-4244-1250-1},\nissn = {10952055},\nmonth = {aug},\npages = {591--596},\npublisher = {IEEE},\ntitle = {{Packet Scheduling for Scalable Video Streaming Over Lossy Packet Access Networks}},\nurl = {http://ieeexplore.ieee.org/document/4317882/},\nyear = {2007}\n}\n","author_short":["Maani, E.","Luo, Y.","Pahalawatta, P.","Katsaggelos, A."],"key":"Ehsan2007","id":"Ehsan2007","bibbaseid":"maani-luo-pahalawatta-katsaggelos-packetschedulingforscalablevideostreamingoverlossypacketaccessnetworks-2007","role":"author","urls":{"Paper":"http://ieeexplore.ieee.org/document/4317882/"},"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"https://sites.northwestern.edu/ivpl/files/2023/06/IVPL_Updated_publications-1.bib","dataSources":["KTWAakbPXLGfYseXn","ePKPjG8C6yvpk4mEK","ya2CyA73rpZseyrZ8","qhF8zxmGcJfvtdeAg","fvDEHD49E2ZRwE3fb","H7crv8NWhZup4d4by","DHqokWsryttGh7pJE","vRJd4wNg9HpoZSMHD","sYxQ6pxFgA59JRhxi","w2WahSbYrbcCKBDsC","XasdXLL99y5rygCmq","3gkSihZQRfAD2KBo3","t5XMbyZbtPBo4wBGS","bEpHM2CtrwW2qE8FP","teJzFLHexaz5AQW5z"],"keywords":[],"search_terms":["packet","scheduling","scalable","video","streaming","over","lossy","packet","access","networks","maani","luo","pahalawatta","katsaggelos"],"title":"Packet Scheduling for Scalable Video Streaming Over Lossy Packet Access Networks","year":2007}