Routing algorithms for switching networks with probabilistic traffic

DOI10.1002/(SICI)1097-0037(199608)28:1%3C21::AID-NET4%3E3.0.CO;2-FMaRDI QIDQ5689815zbMATH OpenOpenAlexFDO

Authors Geng Lin, Nicholas Pippenger

Publication date 7 January 1997

Full work available at URL https://doi.org/10.1002/(sici)1097-0037(199608)28:1%3C21::aid-net4%3E3.0.co;2-f

zbMATH Keywords

blocking probabilitycommunication pathefficient routingmeasures of performanceprobabilistic trafficseries-parallel networksswitching networks

Mathematics Subject Classification ID

Communication networks in operations research (90B18)

Recommendations

• scientific article; zbMATH DE number 3887398
• An algorithm for sub-optimal routeing in series-parallel queueing networks
• scientific article; zbMATH DE number 3880602
• A fast parallel algorithm for routing in permutation networks
• Parallel algorithms for routing in nonblocking networks

Cited in

(3)

• scientific article; zbMATH DE number 1334210 (Why is no real title available?)
• scientific article; zbMATH DE number 1775423 (Why is no real title available?)
• Local versus global search in channel graphs

This page was built for publication: Routing algorithms for switching networks with probabilistic traffic

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