Optimal many-to-one routing on the mesh with constant queues

DOI10.1016/j.ipl.2005.04.006zbMath1184.68138OpenAlexW1970684463MaRDI QIDQ1044696

Andrea Pietracaprina, Geppino Pucci

Publication date: 18 December 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2005.04.006

zbMATH Keywords

parallel algorithmsinterconnection networksmeshpacket routing

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Randomized algorithms (68W20)

Related Items (1)

Store-and-forward multicast routing on the mesh

Cites Work

• A guided tour of Chernoff bounds
• Packet routing in fixed-connection networks: A survey
• Unnamed Item
• Unnamed Item

This page was built for publication: Optimal many-to-one routing on the mesh with constant queues