The network as a storage device: dynamic routing with bounded buffers

DOI10.1007/s00453-007-9143-1zbMath1194.68070OpenAlexW2157099159MaRDI QIDQ2391188

Stanislav Angelov, Keshav Kunal, Sanjeev Khanna

Publication date: 24 July 2009

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-007-9143-1

zbMATH Keywords

online algorithmsnetwork routingtroughput maximization

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Randomized algorithms (68W20)

Related Items (3)

Online packet-routing in grids with bounded buffers ⋮ Competitive buffer management with packet dependencies ⋮ Approximation algorithms for time-constrained scheduling on line networks

Cites Work

• Unnamed Item
• Unnamed Item
• Bounds on the greedy routing algorithm for array networks
• Universal continuous routing strategies
• Harmonic buffer management policy for shared memory switches
• Direct routing: Algorithms and complexity
• Adversarial queuing theory
• Universal-stability results and performance bounds for greedy contention-resolution protocols
• Concurrent threads and optimal parallel minimum spanning trees algorithm
• Nearly optimal FIFO buffer management for DiffServ
• Algorithms – ESA 2005
• Algorithms - ESA 2003

This page was built for publication: The network as a storage device: dynamic routing with bounded buffers