An O( n)-competitive online centralized randomized packet-routing algorithm for lines

DOI10.1007/978-3-642-14162-1_12MaRDI QIDQ3587434zbMATH OpenOpenAlexFDO

Authors Guy Even, Moti Medina

Publication date 7 September 2010

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-14162-1_12

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Randomized algorithms (68W20) Online algorithms; streaming algorithms (68W27)

Recommendations

• Online packet-routing in grids with bounded buffers
• Algorithms – ESA 2005
• The network as a storage device: dynamic routing with bounded buffers
• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
• STACS 2005

Cited in

(3)

• Online packet-routing in grids with bounded buffers
• Packet forwarding algorithms in a line network
• Algorithms – ESA 2005

This page was built for publication: An \(O(\log n)\)-competitive online centralized randomized packet-routing algorithm for lines

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