This problem refers to the network on Chapter 6, Slide 33, but with different notation. The network contains 5 nodes labeled A, B, C, D, E, with the following links: AC, DE, BC, CE. All the links have capacity equal to one. There are 5 flows with the paths indicated: Flow 1 (ACE), Flow 2 (BC), Flow 3 (BC), Flow 4 (DE), Flow 5 (BCE). Let xi be the rate for Flow i. For each of the following performance criteria, determine the values for the rates of the 5 flows, as well as the resulting total throughput. (a) maxmin (this was done in class) (b) proportional fair (c) minimum potential delay (all weights are equal to one) (d) maximum total throughput (there will not be a unique solution)

The slide 33 is following

Max-Min Fairness 4 4 1. All sessions get rate of 1/3, link (2,3) saturated, r2 r3 r5-1/3 saturated, r1-2/3 r4-1 2. Sessions 1 and 4 get rate increment of 1/3, link(3,5) 3. Session 4 gets rate increment of 1/3, link(4,5) saturated, What happens with the rates if session 2 leaves? Max-Min Fairness 4 4 1. All sessions get rate of 1/3, link (2,3) saturated, r2 r3 r5-1/3 saturated, r1-2/3 r4-1 2. Sessions 1 and 4 get rate increment of 1/3, link(3,5) 3. Session 4 gets rate increment of 1/3, link(4,5) saturated, What happens with the rates if session 2 leaves