Bounds on the greedy routing algorithm for array networks

DOI10.1006/JCSS.1996.0072zbMATH Open0864.68041OpenAlexW4212763492MaRDI QIDQ676436FDOQ676436

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

Recommendations

• Greedy Dynamic Routing on Arrays
• Publication:4886091

zbMATH Keywords

greedy routingarray networks

Mathematics Subject Classification ID

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

Cited In (7)

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

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)