Routing algorithms for switching networks with probabilistic traffic

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0037(199608)28:1<21::AID-NET4>3.0.CO;2-F" /><21::AID-NET4>3.0.CO;2-F 10.1002/(SICI)1097-0037(199608)28:1<21::AID-NET4>3.0.CO;2-FzbMath0865.90057OpenAlexW1984501778MaRDI QIDQ5689815

Geng Lin, Nicholas J. Pippenger

Publication date: 7 January 1997

Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199608)28:1<21::aid-net4>3.0.co;2-f

zbMATH Keywords

switching networksseries-parallel networksblocking probabilitycommunication pathmeasures of performanceefficient routingprobabilistic traffic

Mathematics Subject Classification ID

Communication networks in operations research (90B18)

Related Items (2)

Local versus global search in channel graphs ⋮ Unnamed Item

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