Open AccessPosted Content
Large Profits or Fast Gains: A Dilemma in Maximizing Throughput with Applications to Network Processors
Reads0
Chats0
TLDR
This work addresses the tension between two conflicting algorithmic approaches: favoring packets with fewer processing requirements as opposed to packets of larger size, and studying the performance of online algorithms that aim to maximize throughput.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.read more
Citations
More filters
Job-Shop Scheduling with Limited Capacity Buffers
TL;DR: To find a compact representation of solutions for the jobshop problem with buffers, two such representations are proposed and one which is achieved by adapting the alternative graph model and a second which is based on the disjunctive graph model.
Proceedings Article
An improved algorithm for CIOQ switches
Yossi Azar,Yossi Richter +1 more
TL;DR: In this paper, the authors proposed a constant-competitive algorithm for the general case of the problem, with arbitrary speedup and packet values, and implemented it in a simple and easy implementation.
Proceedings ArticleDOI
Multi-queued network processors for packets with heterogeneous processing requirements
TL;DR: A simplified architecture for priority queueing by remaining processing and the push-out mechanism simultaneously in an NP is designed and worst-case guarantees for its throughput performance in different settings are provided.
Book ChapterDOI
FIFO queueing policies for packets with heterogeneous processing
TL;DR: This work considers the problem of managing a bounded size First-In-First-Out (FIFO) queue buffer, where each incoming unit-sized packet requires several rounds of processing before it can be transmitted out and provides analytical guarantees for the throughput performance of the algorithms.
Proceedings ArticleDOI
A taxonomy of Semi-FIFO policies
TL;DR: A taxonomy of Semi-FIFO policies is built and worst case guarantees for different processing orders are provided and shown how these properties affect performance.