Optimization approaches for QoS in computer networks: a survey

Jisuanji Xuebao/Chinese Journal of Computers

Volumn 34, Issue 1, 2011, Pages 1-14

  Lin, Chuang ^a   Li, Yin ^a   Wan, Jian Xiong ^b  

^a TSINGHUA UNIVERSITY   (China)

^b UNIVERSITY OF SCIENCE AND TECHNOLOGY BEIJING   (China)

Author keywords

Optimization models; Performance evaluation; QoS; Resource allocation; Task scheduling

Indexed keywords

COST EVALUATIONS; DIFFERENT STRUCTURE; GENERIC EXPRESSION; HOT RESEARCH TOPICS; LEADING EDGE; NETWORK DESIGN; NETWORK MODELS; OPTIMAL SOLUTIONS; OPTIMIZATION APPROACH; OPTIMIZATION MODELS; OPTIMIZATION OF NETWORK; OPTIMIZATION PROBLEMS; OPTIMIZATION SCHEME; OPTIMIZATION TECHNIQUES; OPTIMIZATION THEORY; PERFORMANCE EVALUATION; QOS; RESEARCH CHALLENGES; RESEARCH FIELDS; RESEARCH PROGRESS; RESOURCE DEPLOYMENTS; SOLVING METHOD; TASK SCHEDULING;

COMPUTER RESOURCE MANAGEMENT; HEURISTIC METHODS; INTERNET; MATHEMATICAL MODELS; MULTITASKING; RESEARCH; RESOURCE ALLOCATION; SCHEDULING; SCHEDULING ALGORITHMS; SITE SELECTION;

OPTIMIZATION;

EID: 79953072432     PISSN: 02544164     EISSN: None     Source Type: Journal    
DOI: 10.3724/SP.J.1016.2011.00001     Document Type: Review

References (56)

1. Haykin S. Cognitive radio: Brain-empowered wireless communications. IEEE Journal on Selected Areas in Communications (JSAC), 2005, 23 (2): 201-220
2. Hossain E, Niyato D, Han Z. Dynamic Spectrum Access and Management in Cognitive Radio Networks. Cambridge, UK: Cambridge University Press, 2009
3. Chipara O, Lu C, Stankovic J. Dynamic conflict-free query scheduling for wireless sensor networks//Proceedings of the 14th IEEE International Conference on Network Protocols (ICNP'06). Santa Barbara, USA, 2006: 321-331
4. Xue C J, Xing G-L, Yuan Z-H, Shao Z-L, Sha E. Joint sleep scheduling and mode assignment in wireless cyber-physical systems//Proceedings of the 2009 29th IEEE International Conference on Distributed Computing Systems Workshops (ICDCSW'09). Montreal, QC, 2009: 1-6
5. Radunovi B, Le Boudec J-Y. A unified framework for max-min and min-max fairness with applications. IEEE/ACM Transactions on Networking (TON), 2007, 15 (5): 1073-1083
6. Zheng H-T, Peng C-Y. Collaboration and fairness in opportunistic spectrum access//Proceedings of the 40th Annual IEEE International Conference on Communications (ICC'05). Seoul, Korea, 2005: 3132-3136
7. Zussman G, Segall A. Energy efficient routing in ad hoc disaster recovery networks//Proceedings of the 22nd Annual Joint Conference of the IEEE Computer and Communications (INFOCOM'03). San Francisco, USA, 2003: 682-691
8. Sarker R A, Newton C S. Optimization Modeling: A Practical Approach. Boca Raton, FL, USA: CRC Press, 2008
9. Jin J, Xu H, Li B-C. Multicast scheduling with cooperation and network coding in cognitive radio networks//Proceedings of the 29th IEEE Conference on Computer Communications (INFOCOM'10). San Diego, USA, 2010: 1-9
10. Fabregat R, Donoso Y, Baran B, Solano F, Marzo J L. Multi-objective optimization scheme for multicast flows: A survey, a model and a MOEA solution//Proceedings of the 3rd International IFIP/ACM Latin American Conference on Networking (LANC'05). New York, USA, 2005: 73-86
11. Donoso Y, Fabregat R, Solano F, Marzo J L, Baran B. Generalized multiobjective multitree model for dynamic multicast groups//Proceedings of the 40th Annual IEEE International Conference on Communications (ICC'05). Seoul, Korea, 2005: 148-152
12. Donoso Y, Fabregat R, Marzo J L. A multi-objective optimization scheme for multicast routing: A multitree approach. Telecommunications Systems Journal, 2004, 27 (2-4): 229-251
13. Wang T, Wu Z, Mao J. A new method for multi-objective TDMA scheduling in wireless sensor networks using Pareto-based PSO and fuzzy comprehensive judgement//Proceedings of the High Performance Computing and Communications (HPCC'07). Lecture Notes in Computer Science 4782. Berlin, Heidelberg: Springer-Verlag, 2007: 144-155
14. Awad M K, Shen X-M. OFDMA based two-hop cooperative relay network resources allocation//Proceedings of the IEEE International Conference on Communications (ICC'08). Beijing, China, 2008: 4414-4418
15. Bley A. An integer programming algorithm for routing optimization in IP networks//Proceedings of the 16th Annual European Symposium on Algorithms (ESA 2008). Lecture Notes in Computer Science 5193. Springer, Berlin, Heidelberg, 2008: 198-209
16. Berry J, Hart W, Phillips C, Uber J, Watson J-P. Sensor placement in municipal water networks with temporal integer programming models. Journal of Water Resources Planning and Management, 2006, 132 (4): 218-224
17. Leonardi E, Mellia M, Marsan M A, Neri F. Joint optimal scheduling and routing for maximum network throughput//Proceedings of the 24th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'05). Miami, USA, 2005: 819-830
18. Mung C, Steven H L, Luo Z-Q, Ness B S, Wei Y. Guest editorial: Nonlinear optimization of communication systems. IEEE Journal on Selected Areas in Communications, 2006, 24 (8): 1421-1423
19. Chiang M. Nonconvex optimization in communication systems. Advances in Mechanics and Mathematics, 2006, 17 (1): 1-60
20. Luo Z-Q, Yu W. An introduction to convex optimization for communications and signal processing. IEEE Journal on Selected Areas in Communications (JSAC), 2006, 24 (8): 1426-1438
21. Georgiadis L, Neely M J, Tassiulas L. Resource allocation and cross-layer control in wireless networks. Foundations and Trends in Networking, 2006, 1 (1): 1-149
22. Floyd S, Jacobson V. Random early detection gateways for congestion avoidance. IEEE/ACM Transactions on Networking (TON), 1993, 1 (4): 397-413
23. Krishnan S, Chaporkar P. Stochastic approximation algorithm for optimal throughput performance of wireless LANs//Proceedings of the Annual Conference of the ACM Special Interest Group on Data Communication (SIGCOMM'10). New Delhi, India, 2010: 409-410
24. Palomar D P, Chiang M. A tutorial on decomposition methods for network utility maximization. IEEE Journal on Selected Areas in Communications (JSAC), 2006, 24 (8): 1439-1451
25. Dennis J E, Schnabel R S. Numerical Methods for Unconstrained Optimization and Nonlinear Equations. Englewood Cliffs, NJ, USA: Prentice-Hall Inc., 1996
26. Boyd S, Vandenberghe L. Convex Optimization. Cambridge, UK: Cambridge University Press, 2004
27. Johansson B, Johansson M. Mathematical decomposition techniques for distributed cross-layer optimization of data networks. IEEE Journal on Selected Areas in Communications (JSAC), 2006, 24 (8): 1535-1547
28. Mehrotra S. On the implementation of a primal-dual interior point method. SIAM Journal on Optimization, 1992, 2 (4): 575-601
29. Cheng M X, Li Y, Du D-Z. Combinatorial Optimization in Communication Networks. Secaucus, NJ, USA: Springer-Verlag New York, Inc., 2006
30. Jia X, Li D, Du D. QoS topology control in Ad Hoc wireless networks//Proceedings of the 23rd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'04). Hong Kong, China, 2004: 1264-1272
31. Qiu L, Chandra R, Jain K, Mahdian R. Optimizing the placement of integration points in multi-hop wireless net-works//Proceedings of the 12th IEEE International Conference on Network Protocols (ICNP'04). Berlin, Germany, 2004: 1092-1648
32. Szymanski T. Challenges in deploying novel systems and networks//Technical Report: Proceedings of the 5th International Conference on Systems and Networks Communications (CENTRIC). Nice, France, 2010
33. Cormen T H, Leiserson C E, Rivest L R, Clifford S. Introduction to Algorithms. 2nd Edition. Cambridge, MA, USA: The MIT Press, 2001
34. Kangasharju J, Roberts J, Ross K. Object replication strategies in content distribution networks. Computer Communications, 2002, 25 (4): 367-383
35. Cheng X Z, Narahari B, Simha R, Cheng M X, Liu D. Strong minimum energy topology in wireless sensor networks: NP-completeness and heuristics. IEEE Transactions on Mobile Computing, 2003, 2 (3): 248-256
36. Yang H K, Ren F Y, Lin C, Zhang J. Frequency-domain packet scheduling for 3GPP LTE uplink//Proceedings of the 29th Conference on Computer Communications (INFOCOM'10). San Diego, CA, USA, 2010: 2597-2605
37. Crescenzi P. A short guide to approximation preserving reductions//Proceedings of the 12th Annual IEEE Conference on Computational Complexity (CCC'97). Ulm, Germany, 1997: 262-273
38. Amotz B N, Reuven B Y, Ari F, Joseph N, Baruch S. A unified approach to approximating resource allocation and scheduling. Journal of the ACM, 2001, 48 (5): 1069-1090
39. Hochbaum D. Approximation Algorithms for NP-hard Problems. Boston, MA, USA: PWS Publishing Company, 1997
40. Vazirani V V. Approximation Algorithms. Atlanta, GA, USA: Springer, 2001
41. Xue G L. Minimum-cost QoS multicast and unicast routing in communication networks. IEEE Transactions on Communications, 2003, 51 (5): 817-824
42. Fei Xiang, Lou Junzhou, Wei Jieyi, Gu Guanqun. QoS routing based on genetic algorithm. Computer Communications, 1999, 22 (15-16): 1394-1399
43. Bertsekas D P. Dynamic Programming and Optimal Control. New Hampshire, USA: Athena Scientific, 1995
44. Smallwood R, Sondik E. The optimal control of partially observable Markov processes over a finite horizon. Operations Research, 1971, 21 (5): 1071-1088
45. Zhao Q, Tong L, Swami A, Chen Y. Decentralized cognitive MAC for opportunistic spectrum access in ad hoc networks: A POMDP framework. IEEE Journal Selected Areas in Com-munucations: Special Issue on Adaptive, Spectrum Agile and Cognitive Wireless Networks, 2007, 25 (3): 589-600
46. Rykov V V, Efrosinin D. Optimal control of queueing systems with heterogeneous servers. Queueing Systems, 2004, 46 (3-4): 389-407
47. Rykov V V. Monotone control of queueing systems with heterogeneous servers. Queueing Systems, 2001, 37 (4): 391-403
48. Ye Y, Guler O, Tapia R A, Zhang Y. A quadratically convergent O (nL)-iteration algorithm for linear programming. Mathematical Programming, 1993, 59 (2): 151-162
49. Freund R M, Mizuno S. Interior point methods: Current status and future directions. High Performance Optimization, 1996, 51: 1-9
50. Kojima M, Shida M, Shindoh S. Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs. Mathematical Programming, Series A, 1998, 80 (2): 129-160
51. Acharya S, Gupta B, Chang Y, Risbood P, Srivastava A. Precomputing high quality routes for bandwidth guaranteed traffic//Proceedings of the Global Telecommunications Conference (Globecomm'04). Dallas, Texas, USA, 2004: 1202-1207
52. Kallitsis M, Kallitsis R, Callaway R D, Devetskiotis M, Michalidis G. A distributed algorithm for resource allocation for delay sensitive services//Proceedings of the IEEE 14th International Workshop on Computer Aided Modeling and Design of Communication Links and Networks (CAMAD'09). Pisa, Italy, 2009: 1-6
53. Neely M J, Urgaonkar R. Opportunism, backpressure, and stochastic optimization with the wireless broadcast advantage//Proceedings of the Asilomar Conference on Signals, Systems, and Computers. Pacific Grove, CA, 2008: 2152-2158
54. Neely M J. Delay-based network utility maximization//Proceedings of the IEEE International 29th Conference on Computer Communications (INFOCOM'10). San Diego, CA, USA, 2010: 2669-2677
55. Neely M J. Universal scheduling for networks with arbitrary traffic, channels, and mobility. Technical Report: arXiv: 1001.0960. Cornell University, Ithaca, New York, USA, 2010
56. Urgaonkar K, Neely M J. Opportunistic scheduling with reliability guarantees in cognitive radio networks. IEEE Transactions on Mobile Computing, 2009, 8 (6): 766-777