Model the network as a flow graph:
Nodes: the computers.
Edges: each connection with speed becomes a directed edge with capacity .
Source: node .
Sink: node .
Since the connections are bidirectional, add both and with capacity . The max flow algorithm will use whichever direction is better. This models the ability to route data in either direction on each link.