Markov approximation for combinatorial network optimization

Proceedings - IEEE INFOCOM

Volumn , Issue , 2010, Pages

  Chen, Minghua ^a   Liew, Soung Chang ^a   Shao, Ziyu ^a   Kai, Caihong ^a  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL NETWORKS; COMBINATORIAL OPTIMIZATION PROBLEMS; COMBINATORIAL PROBLEM; DISTRIBUTED ALGORITHM; DISTRIBUTED SOLUTIONS; MARKOV APPROXIMATION; MARKOV CHAIN; NETWORK DESIGN PROBLEMS; NETWORK OPTIMIZATION PROBLEM; OPTIMAL VALUES;

COMBINATORIAL OPTIMIZATION; MARKOV PROCESSES; PROBABILITY DISTRIBUTIONS;

APPROXIMATION ALGORITHMS;

EID: 77953309268     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2010.5461998     Document Type: Conference Paper

References (20)

1. X. Lin, N. Shro., and R. Srikant, "A tutorial on cross-layer optimization in wireless networks," IEEE Journals on Selected Areas on Communications, vol. 24, no. 8, pp. 1452-1463, 2006.
2. P. Key, L. Massoulie, and D. Towsley, "Path selection and multipath congestion control," in Proceedings of IEEE INFOCOM, 2007.
3. S. Liew, C. Kai, J. Leung, and B. Wong, "Back-of-the-Envelope Computation of Throughput Distributions in CSMA Wireless Networks," to appear in IEEE Transactions on Mobile Computing. Technical report also available at http://arxiv.org//pdf/0712.1854.
4. X. Wang and K. Kar, "Throughput modelling and fairness issues in CSMA/CA based ad-hoc networks," in Proceedings IEEE INFOCOM, 2005.
5. L. Jiang and J. Walrand, "A distributed csma algorithm for throughput and utility maximization in wireless networks," in Proceedings of 46th Allerton Conference, 2008.
6. J. Liu, Y. Yi, A. Proutiere, M. Chiang, and H. Poor, "Towards Utility-optimal Random Access Without Message Passing," Special issue in Wiley Journal of Wireless Communications and Mobile Computing, Dec, 2009.
7. S. Rajagopalan and D. Shah, "Distributed algorithm and reversible network," in Proceedings of CISS, 2008.
8. J. Walrand, "Entropy in communication and chemical systems," in First International Symposium on Applied Sciences on Biomedical and Communication Technologies, (ISABEL'08), 2008, pp. 1-5.
9. J. Ni, B. Tan, and R. Srikant, "Q-CSMA: Queue-Length Based CSMA/CA Algorithms for Achieving Maximum Throughput and Low Delay in Wireless Networks," in Proceedings of IEEE INFOCOM Mini-Conference, 2010.
10. M. Chen and S. Liew and Z. Shao and C. Kai, "Markov approximation for combinatorial network optimization," CUHK Technical Report, 2009, available at http://www.ie.cuhk.edu/~mhchen/ma.tr.pdf.
11. M. Chiang, Geometric programming for communication systems. Now Publishers Inc., 2005.
12. S. Boyd and L. Vandenberghe, Convex optimization. Cambridge university press, 2004.
13. P. Laarhoven and E. Aarts, Simulated annealing: theory and applications. Springer, 1987.
14. S. Chau, M. Chen, and S. Liew, "Capacity of Large Scale CSMA Wireless Networks," in Proceedings of ACM MOBICOM, 2009.
15. S. Liu, T. Basar, and R. Srikant, "Controlling the Internet: A survey and some new results," in Proceedings of the 42nd IEEE Conference on Decision and Control, vol. 3, 2003.
16. L. Jiang and J. Walrand, "Convergence and Stability of a Distributed CSMA Algorithm for Maximal Network Throughput," UC Berkeley, Mar. 2009. URL: http://www.eecs.berkeley.edu/Pubs/TechRpts/2009/ EECS-2009-43.html, Tech. Rep.
17. H. Kushner and G. Yin, Stochastic approximation and recursive algorithms and applications. Springer Verlag, 2003.
18. M. Kijima, Markov processes for stochastic modeling. CRC Press, 1997.
19. P. Diaconis and D. Stroock, "Geometric bounds for eigenvalues of Markov chains," The Annals of Applied Probability, pp. 36-61, 1991.
20. C. Cetinkaya and E. Knightly, "Opportunistic tra.c scheduling over multiple network paths," in Proceedings of INFOCOM, vol. 3, 2004.