In collaboration with
This project deals with routing problems. An SAN network connects a set of machines with a set of data storage devices. For each pair (m,s), where m is a machine and s is a strorage device, the required amount of communication between m and s, b(m,s), is given. The goal is to find a routing that keeps the edge weights smaller than the corresponging capacities.