scientific article
From MaRDI portal
Publication:2934598
zbMath1302.68043MaRDI QIDQ2934598
Jay Sethuraman, Fei Li, Clifford Stein
Publication date: 18 December 2014
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Internet topics (68M11) Online algorithms; streaming algorithms (68W27)
Related Items (15)
A \(\boldsymbol{\phi }\) -Competitive Algorithm for Scheduling Packets with Deadlines ⋮ A comprehensive study of an online packet scheduling algorithm ⋮ A near-optimal memoryless online algorithm for FIFO buffering two packet classes ⋮ Bounded delay packet scheduling in a bounded buffer ⋮ The loss of serving in the dark ⋮ Collecting weighted items from a dynamic queue ⋮ Scheduling packets with values and deadlines in size-bounded buffers ⋮ An optimal lower bound for buffer management in multi-queue switches ⋮ Comparison-based buffer management in QoS switches ⋮ Buffer management for colored packets with deadlines ⋮ A universal randomized packet scheduling algorithm ⋮ Increasing Machine Speed in On-Line Scheduling of Weighted Unit-Length Jobs in Slotted Time ⋮ Online packet scheduling for CIOQ and buffered crossbar switches ⋮ Prompt Mechanisms for Online Auctions ⋮ Improved Online Algorithms for Multiplexing Weighted Packets in Bounded Buffers
This page was built for publication:
