A Linear Programming Duality Approach to Analyzing Strictly Nonblocking d-ary Multilog Networks under General Crosstalk Constraints

DOI10.1007/978-3-540-69733-6_50zbMath1148.90347OpenAlexW213939972MaRDI QIDQ3511362

No author found.

Publication date: 10 July 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-69733-6_50

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Communication networks in operations research (90B18)

Cites Work

• Unnamed Item
• On Multicast Rearrangeable 3-stage Clos Networks Without First-Stage Fan-Out
• Log/sub 2/ (N, m, p) strictly nonblocking networks
• Nonblocking conditions of multicast three-stage interconnection networks

This page was built for publication: A Linear Programming Duality Approach to Analyzing Strictly Nonblocking d-ary Multilog Networks under General Crosstalk Constraints