TY - GEN
T1 - Routing in max-min fair networks
T2 - 18th IEEE International Conference on Network Protocols, ICNP'10
AU - Yang, Dejun
AU - Xue, Guoliang
AU - Fang, Xi
AU - Misra, Satyajayant
AU - Zhang, Jin
PY - 2010
Y1 - 2010
N2 - In this paper, we study the problem of routing in networks with max-min fair congestion control at the link level. The goal of each user is to maximize its own bandwidth by selecting its path. The problem is formulated as a non-cooperative game. We first prove the existence of Nash Equilibria. This is important, because at a Nash Equilibrium (NE), no user has the incentive to change its routing strategy. In addition, we investigate how the selfish behavior of the users may affect the performance of the network as a whole. We next introduce a novel concept of observed available bandwidth on each link. It allows a user to find a path with maximum bandwidth under max-min fair congestion control in polynomial time. We then present a game based algorithm to compute an NE and prove that by following the natural game course the network converges to an NE. Extensive experiments show that the network can converge to an NE in less than 10 iterations and also significantly improves the fairness compared with other algorithms. Our results have the implication for the future routing protocol design.
AB - In this paper, we study the problem of routing in networks with max-min fair congestion control at the link level. The goal of each user is to maximize its own bandwidth by selecting its path. The problem is formulated as a non-cooperative game. We first prove the existence of Nash Equilibria. This is important, because at a Nash Equilibrium (NE), no user has the incentive to change its routing strategy. In addition, we investigate how the selfish behavior of the users may affect the performance of the network as a whole. We next introduce a novel concept of observed available bandwidth on each link. It allows a user to find a path with maximum bandwidth under max-min fair congestion control in polynomial time. We then present a game based algorithm to compute an NE and prove that by following the natural game course the network converges to an NE. Extensive experiments show that the network can converge to an NE in less than 10 iterations and also significantly improves the fairness compared with other algorithms. Our results have the implication for the future routing protocol design.
KW - Max-min fair bandwidth allocation
KW - Nash Equilibrium
KW - non-cooperative game
UR - http://www.scopus.com/inward/record.url?scp=79957652029&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=79957652029&partnerID=8YFLogxK
U2 - 10.1109/ICNP.2010.5762749
DO - 10.1109/ICNP.2010.5762749
M3 - Conference contribution
AN - SCOPUS:79957652029
SN - 9781424486458
T3 - Proceedings - International Conference on Network Protocols, ICNP
SP - 1
EP - 10
BT - 18th IEEE International Conference on Network Protocols, ICNP'10
Y2 - 5 October 2010 through 8 October 2010
ER -