Approximation and Online Algorithms

DOI10.1007/B106130MaRDI QIDQ5713426zbMATH OpenOpenAlexFDO

Authors Yossi Azar

Publication date 14 December 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b106130

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

Recommendations

• Competitive on-Line switching policies
• Online packet scheduling for CIOQ and buffered crossbar switches
• An experimental study of new and known online packet buffering algorithms
• An Experimental Study of New and Known Online Packet Buffering Algorithms
• scientific article; zbMATH DE number 2119707

Cited in

(10)

• A universal randomized packet scheduling algorithm
• On queuing lengths in on-line switching
• Universal Bufferless Packet Switching
• scientific article; zbMATH DE number 2088473 (Why is no real title available?)
• On the population dynamics of the malaria vector
• Packet Switching Networks for Multiprocessors and Data Flow Computers
• The zero-one principle for switching networks
• Randomized competitive algorithms for online buffer management in the adaptive adversary model
• scientific article; zbMATH DE number 3976736 (Why is no real title available?)
• Packet Bundling

This page was built for publication: Approximation and Online Algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5713426)