Bounds on the greedy routing algorithm for array networks
From MaRDI portal
Publication:676436
DOI10.1006/JCSS.1996.0072zbMath0864.68041OpenAlexW4212763492MaRDI QIDQ676436
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
Network design and communication in computer systems (68M10) Parallel algorithms in computer science (68W10)
Related Items (5)
The network as a storage device: dynamic routing with bounded buffers ⋮ Probabilistic Analysis of Online Bin Coloring Algorithms Via Stochastic Comparison ⋮ Stochastic comparisons for rooted butterfly networks and tree networks, with random environments ⋮ Stochastic dominance and the bijective ratio of online algorithms ⋮ Adaptive packet routing for bursty adversarial traffic
This page was built for publication: Bounds on the greedy routing algorithm for array networks
