Understanding XCP: equilibrium and fairness

— We prove that the XCP equilibrium solves a constrained max-min fairness problem by identifying it with the unique solution of a hierarchy of optimization problems, namely those solved by max-min fair allocation, but solved by XCP under an additional constraint. We describe an algorithm to compute this equilibrium and derive a lower and upper bound on link utilization. While XCP reduces to max-min allocation at a single link, in a network the additional constraint can cause a flow to receive an arbitrarily small fraction of its maxmin allocation. We present simulation results to confirm our analytical findings.

• Type: Conference
• Year: 2005
• Where: INFOCOM
• Authors: Steven H. Low, Lachlan L. H. Andrew, Bartek P. Wydrowski
• Keywords: Additional Constraint, Communications, INFOCOM 2005, Max-min Fair Allocation, XCP Equilibrium