12.07.2015 Views

Maximum Throughput and Fair Bandwidth Allocation in Multi ...

Maximum Throughput and Fair Bandwidth Allocation in Multi ...

Maximum Throughput and Fair Bandwidth Allocation in Multi ...

SHOW MORE
SHOW LESS
  • No tags were found...

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

This means that when S ≠ S 1, ′ we can always identify atleast one node v ∈ S (β v > 0) such that v ∉ S 1 ′ <strong>and</strong> moveit out of S. Clearly,<strong>in</strong>atmostN −|S 1| ′ iterations, we willhave S = S 1. ′ This shows that we have computed S 1 ′ <strong>and</strong> theb<strong>and</strong>width value for S 1 ′ (α 1 ) correctly.For general k, 1

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!