TY - JOUR
T1 - Large profits or fast gains
T2 - A dilemma in maximizing throughput with applications to network processors
AU - Kogan, Kirill
AU - López-Ortiz, Alejandro
AU - Nikolenko, Sergey I.
AU - Scalosub, Gabriel
AU - Segal, Michael
N1 - Publisher Copyright:
© 2016 Elsevier Ltd
PY - 2016/10/1
Y1 - 2016/10/1
N2 - We consider the fundamental problem of managing a bounded size queue buffer where traffic consists of packets of varying size, each packet requires several rounds of processing before it can be transmitted out, and the goal is to maximize the throughput, i.e., total size of successfully transmitted packets. Our work addresses the tension between two conflicting algorithmic approaches: favoring packets with fewer processing requirements as opposed to packets of larger size. We present a novel model for studying such systems and study the performance of online algorithms that aim to maximize throughput.
AB - We consider the fundamental problem of managing a bounded size queue buffer where traffic consists of packets of varying size, each packet requires several rounds of processing before it can be transmitted out, and the goal is to maximize the throughput, i.e., total size of successfully transmitted packets. Our work addresses the tension between two conflicting algorithmic approaches: favoring packets with fewer processing requirements as opposed to packets of larger size. We present a novel model for studying such systems and study the performance of online algorithms that aim to maximize throughput.
KW - Online buffer management
KW - Online scheduling
UR - http://www.scopus.com/inward/record.url?scp=84984824813&partnerID=8YFLogxK
U2 - 10.1016/j.jnca.2016.07.010
DO - 10.1016/j.jnca.2016.07.010
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:84984824813
SN - 1084-8045
VL - 74
SP - 31
EP - 43
JO - Journal of Network and Computer Applications
JF - Journal of Network and Computer Applications
ER -