ECEN 619: Internet Protocols & Modeling

𝑯𝒐𝒎𝒆𝒘𝒐𝒓𝒌 𝟒
Sridhar Mareguddi April 16, 2015
UIN: 823000772

Please give your rigorous proof for the theorem that the Jain Fairness is lower bounded by 0, but
upper-bounded by 1, respectively
(∑ 𝑥𝑖 )2
Raj Jain Fairness index is given by 𝐹𝑎𝑖𝑟𝑛𝑒𝑠𝑠 ≜ 𝑛 ∑ 𝑥𝑖2

The Cauchy Schwarz inequality is given by

|〈𝑥, 𝑦〉|2 ≤ ‖𝑥‖2 . ‖𝑦‖2 → 𝐸𝑞𝑛 (1)

which implies, |〈𝑥, 𝑦〉| ≤ ‖𝑥‖. ‖𝑦‖ → 𝐸𝑞𝑛(2)
𝑦𝑖 = 𝑘 ∗ 𝑥𝑖 → (3)
Substituting (3) in (2) and summing,
𝑛 𝑛 𝑛

∑ 𝑥𝑖 ∗ 𝑘𝑥𝑖 ≤ √∑ 𝑥𝑖2 ∗ 𝑘 ∗ √∑ 𝑥𝑖2

𝑖=1 𝑖=1 𝑖=1

Squaring the above equation as in equation (1),

𝑛 2 𝑛

(∑ 𝑥𝑖 ) ≤ ∑ 𝑥𝑖2 → 𝐸𝑞𝑛(3)
𝑖=1 𝑖=1
𝐿𝑒𝑡 𝑦 = [1,1,1 … 1] 𝑜𝑓 𝑙𝑒𝑛𝑔𝑡ℎ 𝑛 𝑎𝑛𝑑 𝑥 = [𝑥1 , 𝑥2 , 𝑥3 .. . 𝑥𝑛 ]
𝑛 2 𝑛 𝑛

𝑇ℎ𝑒𝑛 𝐶𝑎𝑢𝑐ℎ𝑦 𝑠𝑐ℎ𝑤𝑎𝑟𝑧 𝑖𝑛𝑒𝑞𝑢𝑎𝑙𝑖𝑡𝑦 𝑔𝑖𝑣𝑒𝑠, (∑ 𝑥𝑖 ∗ 1) ≤ ∑ 𝑥𝑖2 . ∑ 1.

𝑖=1 𝑖=1 𝑖=1
𝑛 2 𝑛

𝐼𝑚𝑝𝑙𝑖𝑒𝑠, (∑ 𝑥𝑖 ∗ 1) ≤ 𝑛 ∑ 𝑥𝑖2 → (4)

𝑖=1 𝑖=1

(∑ 𝑥𝑖 )2
𝑆𝑖𝑛𝑐𝑒, 𝐹𝑎𝑖𝑟𝑛𝑒𝑠𝑠 ≜ , 𝑖𝑡 𝑓𝑜𝑙𝑙𝑜𝑤𝑠 𝑓𝑟𝑜𝑚 (4)𝑡ℎ𝑎𝑡 𝐹𝑎𝑖𝑟𝑛𝑒𝑠𝑠 𝑖𝑠 𝑖𝑛 𝑡ℎ𝑒 𝑖𝑛𝑡𝑒𝑟𝑣𝑎𝑙 [0,1].
𝑛 ∑ 𝑥𝑖2

That is the fairness is bounded between 0 and 1, That is a totally fair allocation, with all 𝑥𝑖′ 𝑠 = 1,
will have Fairness index =1 and a totally unfair allocation, with all resources given to only one user,
1
will have fairness index of 𝑛 which tends to 0 as 𝑛 → ∞.