Adaptive shortest-path routing under unknown and stochastically varying link states

2012 10th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks, WiOpt 2012

Volumn , Issue , 2012, Pages 232-237

  Liu, Keqin ^a   Zhao, Qing ^a  

^a University of California Davis   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADDITIONAL COSTS; BEST PATHS; DYNAMIC COMMUNICATION; GENERAL MODEL; HEAVY-TAILED DISTRIBUTION; LINK STATE; MULTI ARMED BANDIT; NETWORK DYNAMICS; NETWORK SIZE; PATH SELECTION; PATH SELECTION ALGORITHMS; QUALITY OF COMMUNICATION; SHARP CONTRAST; SHORTEST PATH ROUTING;

COMMUNICATION; RANDOM PROCESSES; ROUTERS; WIRELESS NETWORKS;

OPTIMIZATION;

EID: 84866935969     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (11)

1. T. Lai and H. Robbins, "Asymptotically Efficient Adaptive Allocation Rules," Advances in Applied Mathematics, vol. 6, no. 1, pp. 4-22, 1985.
2. T. Lai, "Adaptive Treatment Allocation and The Multi-Armed Bandit Problem," Ann. Statist., vol 15, pp. 1091-1114, 1987.
3. R. Agrawal, "Sample Mean Based Index Policies with O(logn) Regret for the Multi-armed Bandit Problem," Advances in Applied Probability, vol. 27, pp. 1054-1078, 1995.
4. P. Auer, N. Cesa-Bianchi, P. Fischer, "Finite-time Analysis of the Multiarmed Bandit Problem," Machine Learning, vol. 47, pp. 235-256, 2002. (Pubitemid 34126111)
5. K. Liu and Q. Zhao, "Multi-Armed Bandit Problems with Heavy Tail Reward Distributions," in Proc. of Allerton Conference on Communications, Control, and Computing, September, 2011.
6. K. Liu and Q. Zhao, "Extended UCB1 for Light-Tailed Reward Distributions," available at http://arxiv.org/abs/1112.1768.
7. V. Dani, T. Hayes, S. Kakade, "Stochastic Linear Optimization under Bandit Feedback," in Proc. of the 21st Annual Conference on Learning Theory, 2008.
8. K. Liu and Q. Zhao, "Online Learning for Stochastic Linear Optimization Problems," in Proc. of Information Theory and Applications Workshop (ITA), February, 2012.
9. Y. Gai, B. Krishnamachari, and R. Jain, "Combinatorial Network Optimization with Unknown Variables: Multi-Armed Bandits with Linear Rewards and Individual Observations," IEEE/ACM Transactions on Networking, vol. 20, no. 5, 2012.
10. B. Awerbuch, R. Kleinberg, "Online Linear Optimization and Adaptive Routing," Journal of Computer and System Sciences, pp. 97-114, 2008. (Pubitemid 47625408)
11. P. Chareka, O. Chareka, S. Kennendy, "Locally Sub-Gaussian Random Variable and the Stong Law of Large Numbers," Atlantic Electronic Journal of Mathematics, vol. 1, no. 1, pp. 75-81, 2006.