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

DOI10.1007/S00453-007-9143-1MaRDI QIDQ2391188zbMATH OpenOpenAlexFDO

Authors Stanislav Angelov, Sanjeev Khanna, Keshav Kunal

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

network routingonline algorithmstroughput maximization

Mathematics Subject Classification ID

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

Recommendations

• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
• scientific article; zbMATH DE number 2079411
• Network flow with intermediate storage: models and algorithms
• Concurrent threads and optimal parallel minimum spanning trees algorithm
• scientific article; zbMATH DE number 4025135
• Deterministic routing with bounded buffers: turning offline into online protocols
• Routing with bounded buffers and hot-potato routing in vertex-symmetric networks
• Reconfigurable distributed storage for dynamic networks
• With Great Speed Come Small Buffers

Cites work

• Adversarial queuing theory
• Algorithms – ESA 2005
• Bounds on the greedy routing algorithm for array networks
• Buffer overflows of merging streams
• Concurrent threads and optimal parallel minimum spanning trees algorithm
• Direct routing: Algorithms and complexity
• Harmonic buffer management policy for shared memory switches
• scientific article; zbMATH DE number 1256752 (Why is no real title available?)
• scientific article; zbMATH DE number 2079411 (Why is no real title available?)
• Nearly optimal FIFO buffer management for DiffServ
• Universal continuous routing strategies
• Universal-stability results and performance bounds for greedy contention-resolution protocols

Cited in

(14)

• Online packet-routing in grids with bounded buffers
• From static to dynamic routing: efficient transformations of store-and-forward protocols
• Rate vs. buffer size -- greedy information gathering on the line
• An \(O(\log n)\)-competitive online centralized randomized packet-routing algorithm for lines
• scientific article; zbMATH DE number 3934807 (Why is no real title available?)
• Competitive buffer management with packet dependencies
• scientific article; zbMATH DE number 2079411 (Why is no real title available?)
• From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols
• Growing Half-Balls: Minimizing Storage and Communication Costs in Content Delivery Networks
• Maximizing throughput in minimum rounds in an application-level relay service
• Optimal Node Routing
• Algorithms – ESA 2005
• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
• Approximation algorithms for time-constrained scheduling on line networks

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

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