| dc.contributor.author | Kogan, Kirill | |
| dc.contributor.author | López-Ortiz, Alejandro | |
| dc.contributor.author | Nikolenko, Sergey | |
| dc.contributor.author | Scalosub, Gabriel | |
| dc.contributor.author | Segal, Michael | |
| dc.date.accessioned | 2021-07-13T09:32:17Z | |
| dc.date.available | 2021-07-13T09:32:17Z | |
| dc.date.issued | 2016-10 | |
| dc.identifier.issn | 1084-8045 | |
| dc.identifier.uri | http://hdl.handle.net/20.500.12761/500 | |
| dc.description.abstract | 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. | |
| dc.language.iso | eng | |
| dc.publisher | Elsevier | |
| dc.title | Large Profits or Fast Gains: A Dilemma in Maximizing
Throughput with Applications to Network Processors | en |
| dc.type | journal article | |
| dc.journal.title | Journal of Network and Computer Applications | |
| dc.type.hasVersion | VoR | |
| dc.rights.accessRights | open access | |
| dc.volume.number | 74 | |
| dc.identifier.doi | http://dx.doi.org/10.1016/j.jnca.2016.07.010 | |
| dc.page.final | 43 | |
| dc.page.initial | 31 | |
| dc.subject.keyword | Buffer management | |
| dc.subject.keyword | admission control | |
| dc.subject.keyword | online algorithms | |
| dc.description.status | pub | |
| dc.eprint.id | http://eprints.networks.imdea.org/id/eprint/1737 | |
