Large profits or fast gains: A dilemma in maximizing throughput with applications to network processors

Kirill Kogan; Alejandro López-Ortiz; Sergey I. Nikolenko; Gabriel Scalosub; Michael Segal

doi:10.1016/j.jnca.2016.07.010

Large profits or fast gains: A dilemma in maximizing throughput with applications to network processors

Kirill Kogan, Alejandro López-Ortiz, Sergey I. Nikolenko, Gabriel Scalosub, Michael Segal

Research output: Contribution to journal › Article › peer-review

4 Scopus citations

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.

Original language	English
Pages (from-to)	31-43
Number of pages	13
Journal	Journal of Network and Computer Applications
Volume	74
DOIs	https://doi.org/10.1016/j.jnca.2016.07.010
State	Published - 1 Oct 2016

Keywords

Online buffer management
Online scheduling

ASJC Scopus subject areas

Hardware and Architecture
Computer Science Applications
Computer Networks and Communications

Access to Document

10.1016/j.jnca.2016.07.010

Cite this

@article{8d1c297016a54a3aa9383f2e0d639039,

title = "Large profits or fast gains: A dilemma in maximizing throughput with applications to network processors",

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.",

keywords = "Online buffer management, Online scheduling",

author = "Kirill Kogan and Alejandro L{\'o}pez-Ortiz and Nikolenko, {Sergey I.} and Gabriel Scalosub and Michael Segal",

note = "Publisher Copyright: {\textcopyright} 2016 Elsevier Ltd",

year = "2016",

month = oct,

day = "1",

doi = "10.1016/j.jnca.2016.07.010",

language = "English",

volume = "74",

pages = "31--43",

journal = "Journal of Network and Computer Applications",

issn = "1084-8045",

publisher = "Academic Press",

}

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

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 - 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 -

Large profits or fast gains: A dilemma in maximizing throughput with applications to network processors

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this