| Document Date: 2014-01-09 20:53:18
Open Document File Size: 699,77 KBShare Result on Facebook
City New York / / Company Substituting / ANDREW / IEEE Authorized / Authorized / Google Inc. / Let Authorized / / Country United States / Australia / / Currency USD / / / Event Product Recall / Product Issues / / Facility California Institute of Technology / Swinburne University of Technology / / IndustryTerm iterative algorithm / problems crete algorithm / max-min algorithm / abstract algorithm / problems unique solution / computing / above algorithm / private networks / larger solution / packet networks / rate allocation algorithm / lower bandwidth delay product / / Organization California Institute of Technology / National Science Foundation / Swinburne University of Technology / SWINBURNE UNIV OF TECHNOLOGY / / Person Steven H. Low / Consider / / Position MODEL / NETWORKING Editor / / Product period / / ProvinceOrState New York / / Technology following abstract algorithm / rate allocation algorithm / above algorithm / XCP algorithm / max-min algorithm / Using protocols / iterative algorithm / simulation / Digital Object Identifier / problems crete algorithm / / URL http /
SocialTag |
IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 17, NO. 6, DECEMBERUnderstanding XCP: Equilibrium and Fairness Lachlan L. H. Andrew, Senior Member, IEEE, Steven H. Low, Fellow, IEEE, and Bartek P. Wydrowski, Member