| Document Date: 2004-07-29 09:42:18
Open Document File Size: 178,78 KBShare Result on Facebook
City Redmond / New Haven / / Company Rocketfuel / AT&T Labs / Ford / Sprint / Microsoft / Tiscali / / Event FDA Phase / / Facility Yale University / / IndustryTerm adaptive networks / large scale networks / wireless users / wireless ad hoc network / stochastic approximation algorithms / wireless ad hoc networks / stochastic iterative algorithms / normal Internet routing / large networks / distributed gradient projection algorithms / adaptive routing protocols / gradient projection algorithms / update algorithm / transportation networks / user-optimal routing algorithm / time-scale stochastic iterative algorithms / search space / overlay network / wireless networks / asynchronous distributed gradient algorithms / / Organization National Science Foundation / Yale University / Computer Science Department / / Person Spike / Lili Qiu / Yang Richard Yang / / Product Figure / / ProvinceOrState New Jersey / Connecticut / Washington / / Technology projected stochastic approximation algorithms / computationally demanding algorithms / update algorithm / stochastic iterative algorithms / ISP / Pdh / stochastic approximation algorithms / distributed gradient projection algorithms / simulation / Quality of Service / adaptive routing protocols / asynchronous distributed gradient algorithms / previous gradient projection algorithms / two time-scale stochastic iterative algorithms / Frank Wolfe algorithm / routing algorithm / /
SocialTag |
On Self Adaptive Routing in Dynamic Environments ∗ — An Evaluation and Design Using a Simple, Probabilistic Scheme Haiyong Xie† , Lili Qiu‡ , Yang Richard Yang† , and Yin Zhang§ † Computer Science Departmen