TY - GEN
T1 - Competitive buffer management with packet dependencies
AU - Kesselman, Alex
AU - Boaz, Patt Shamir
AU - Scalosub, Gabriel
N1 - Funding Information:
✩ A preliminary version of this paper appeared in the Proceedings of the 23rd IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2009. ✩✩ This Research was supported in part by the Next Generation Video (NeGeV) consortium, Israel. ∗ Corresponding author. E-mail addresses: [email protected] (A. Kesselman), [email protected] (B. Patt-Shamir), [email protected] (G. Scalosub).
Funding Information:
The work of B. Patt-Shamir was supported in part by the Israel Science Foundation (grant 1372/09) and by the Israel Ministry of Science and Technology. This work was done while G. Scalosub was with Tel Aviv University.
PY - 2009/11/25
Y1 - 2009/11/25
N2 - We introduce the problem of managing a FIFO buffer of bounded space, where arriving packets have dependencies among them. Our model is motivated by the scenario where large data frames must be split into multiple packets, because maximum packet size is limited by data-link restrictions. A frame is considered useful only if sufficiently many of its constituent packets are delivered. The buffer management algorithm decides, in case of overflow, which packets to discard and which to keep in the buffer. The goal of the buffer management algorithm is to maximize throughput of useful frames. This problem has a variety of applications, e.g., Internet video streaming, where video frames are segmented and encapsulated in IP packets sent over the Internet. We study the complexity of the above problem in both the offline and online settings. We give upper and lower bounds on the performance of algorithms using competitive analysis.
AB - We introduce the problem of managing a FIFO buffer of bounded space, where arriving packets have dependencies among them. Our model is motivated by the scenario where large data frames must be split into multiple packets, because maximum packet size is limited by data-link restrictions. A frame is considered useful only if sufficiently many of its constituent packets are delivered. The buffer management algorithm decides, in case of overflow, which packets to discard and which to keep in the buffer. The goal of the buffer management algorithm is to maximize throughput of useful frames. This problem has a variety of applications, e.g., Internet video streaming, where video frames are segmented and encapsulated in IP packets sent over the Internet. We study the complexity of the above problem in both the offline and online settings. We give upper and lower bounds on the performance of algorithms using competitive analysis.
UR - http://www.scopus.com/inward/record.url?scp=70450056285&partnerID=8YFLogxK
U2 - 10.1109/IPDPS.2009.5161033
DO - 10.1109/IPDPS.2009.5161033
M3 - Conference contribution
AN - SCOPUS:70450056285
SN - 9781424437504
T3 - IPDPS 2009 - Proceedings of the 2009 IEEE International Parallel and Distributed Processing Symposium
BT - IPDPS 2009 - Proceedings of the 2009 IEEE International Parallel and Distributed Processing Symposium
T2 - 23rd IEEE International Parallel and Distributed Processing Symposium, IPDPS 2009
Y2 - 23 May 2009 through 29 May 2009
ER -