Publication:4471370

From MaRDI portal
Revision as of 07:03, 7 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)


zbMath1092.68508MaRDI QIDQ4471370

An Zhu, Yishay Mansour, Nir Andelman

Publication date: 28 July 2004



68M10: Network design and communication in computer systems

68M20: Performance evaluation, queueing, and scheduling in the context of computer systems


Related Items

A \(\boldsymbol{\phi }\) -Competitive Algorithm for Scheduling Packets with Deadlines, An optimal algorithm for 2-bounded delay buffer management with lookahead, Better bounds for online \(k\)-frame throughput maximization in network switches, Competitive buffer management with packet dependencies, An optimal lower bound for buffer management in multi-queue switches, Competitive buffer management for multi-queue switches in QoS networks using packet buffering algorithms, Buffer management for colored packets with deadlines, Randomized competitive algorithms for online buffer management in the adaptive adversary model, An experimental study of new and known online packet buffering algorithms, Lower and upper bounds on FIFO buffer management in QoS switches, Comparison-based buffer management in QoS switches, Collecting weighted items from a dynamic queue, Maximizing throughput in multi-queue switches, Online algorithms for maximizing weighted throughput of unit jobs with temperature constraints, Non-preemptive buffer management for latency sensitive packets, Online packet scheduling with bounded delay and lookahead, Online competitive algorithms for maximizing weighted throughput of unit jobs, The loss of serving in the dark, Optimal Buffer Management for 2-Frame Throughput Maximization, Tight Analysis of Priority Queuing for Egress Traffic, Online Algorithms for Maximizing Weighted Throughput of Unit Jobs with Temperature Constraints, Randomized Algorithms for Buffer Management with 2-Bounded Delay, Improved Online Algorithms for Multiplexing Weighted Packets in Bounded Buffers