Bounds on the greedy routing algorithm for array networks

DOI10.1006/JCSS.1996.0072MaRDI QIDQ676436zbMATH OpenOpenAlexFDO

Authors Michael Mitzenmacher

Publication date 9 June 1997

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jcss.1996.0072

zbMATH Keywords

array networksgreedy routing

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Parallel algorithms in computer science (68W10)

Recommendations

• Greedy Dynamic Routing on Arrays
• Publication:4886091

Cited in

(7)

• Adaptive packet routing for bursty adversarial traffic
• Stochastic dominance and the bijective ratio of online algorithms
• The network as a storage device: dynamic routing with bounded buffers
• Probabilistic Analysis of Online Bin Coloring Algorithms Via Stochastic Comparison
• Greedy Dynamic Routing on Arrays
• scientific article; zbMATH DE number 910914 (Why is no real title available?)
• Stochastic comparisons for rooted butterfly networks and tree networks, with random environments

This page was built for publication: Bounds on the greedy routing algorithm for array networks

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