From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols

DOI10.1137/S0097539799353431MaRDI QIDQ4507387zbMATH OpenFDO

Authors Berthold Vöcking, Christian Scheideler

Publication date 18 October 2000

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/S0097539799353431

zbMATH Keywords

communication networkspacket schedulingstore-and-forward routing

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Deterministic scheduling theory in operations research (90B35)

Recommendations

• From static to dynamic routing: efficient transformations of store-and-forward protocols
• Concurrent threads and optimal parallel minimum spanning trees algorithm
• Adaptive packet routing for bursty adversarial traffic
• The network as a storage device: dynamic routing with bounded buffers
• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques

Cited in

(4)

• Stability preserving transformations: Packet routing networks with edge capacities and speeds
• From static to dynamic routing: efficient transformations of store-and-forward protocols
• Concurrent threads and optimal parallel minimum spanning trees algorithm
• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques

This page was built for publication: From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols

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