Balancing work and size with bounded buffers

Kirill Kogan, Alejandro Lopez-Ortiz, Sergey I. Nikolenko, Gabriel Scalosub, Michael Segal

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    15 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 languageEnglish
    Title of host publication2014 6th International Conference on Communication Systems and Networks, COMSNETS 2014
    DOIs
    StatePublished - 17 Mar 2014
    Event2014 6th International Conference on Communication Systems and Networks, COMSNETS 2014 - Bangalore, India
    Duration: 7 Jan 201410 Jan 2014

    Publication series

    Name2014 6th International Conference on Communication Systems and Networks, COMSNETS 2014

    Conference

    Conference2014 6th International Conference on Communication Systems and Networks, COMSNETS 2014
    Country/TerritoryIndia
    CityBangalore
    Period7/01/1410/01/14

    ASJC Scopus subject areas

    • Computer Networks and Communications

    Fingerprint

    Dive into the research topics of 'Balancing work and size with bounded buffers'. Together they form a unique fingerprint.

    Cite this