Elsevier

Computer Networks

Volume 66, 19 June 2014, Pages 32-45
Computer Networks

Optimization-based resource allocation in communication networks

https://doi.org/10.1016/j.comnet.2014.03.013Get rights and content

Abstract

The continuously growing number of applications competing for resources in current communication networks highlights the necessity for efficient resource allocation mechanisms to maximize user satisfaction. Optimization Theory can provide the necessary tools to develop such mechanisms that will allocate network resources optimally and fairly among users. The aim of this paper is to provide a starting point for researchers interested in applying optimization techniques in the resource allocation problem for current communication networks. To achieve that we, first, describe the fundamental optimization theory tools necessary to design optimal resource allocation algorithms. Then, we describe the Network Utility Maximization (NUM) framework, a framework that has already found numerous applications in network optimization, along with some recent advancements of the initial NUM framework. Finally, we summarize some of our recent work in the area and discuss some of the remaining research challenges towards the development of a complete optimization-based resource allocation protocol.

Introduction

Since the creation of ARPANET [1], the first packet switching communication network in 1969 that connected university laboratories, industrial and government research centers in the US, there has been a tremendous change in the extent and characteristics of communication networks, and especially the internet, the amount of data that is shared through them and the variety of applications that generate this traffic.

Recent Cisco IP traffic studies [2], [3] provide useful information and insights regarding the traffic characteristics in current communication networks. The total internet traffic currently exceeds 40 Exa-bytes per month. On the other hand, mobile traffic has seen an explosive increase in the past years. While total mobile traffic in 2008 was no more than 33 Peta-bytes per month, mobile traffic is forecasted to reach 2.1 Exa-bytes per month by the end of 2013. The reason causing this abrupt increase in the traffic in both internet and mobile networks can be justified if one looks carefully at these statistics from another perspective; that of the applications that generate the traffic. In 2008, the majority of the traffic was generated by “traditional” types of applications, such as web browsing, email and file sharing applications, that accounted for 77% of the total traffic in the internet. However, multimedia applications, such as VoIP and video streaming, dominate the traffic nowadays exceeding 57% of the total traffic in the internet. The statistics are similar in the mobile internet as well, where the video traffic alone currently accounts for two-thirds of the total mobile traffic.

This abrupt increase of the total traffic highlights the necessity for more efficient methods of sharing the available bandwidth so that users are receiving the maximum possible satisfaction and the best possible experience when using a communication network. In addition, taking into account that users are being charged by the network providers for access, the more efficient the resource allocation is, the more satisfied the users will be and consequently the more willing to continue paying the provider for the service. The heterogeneity of the provided applications also shows that all traffic does not have the same resource requirements. This strengthens the need for more sophisticated allocation methods that will be able to distinguish between different types of applications and try to allocate resources in a way that maximizes user satisfaction for each application type.

Optimization Theory can provide a powerful tool in the development of such methods for various reasons. Optimization Theory has been used successfully in many areas related to communication networks, such as optimal routing, flow control and power control. In particular, pioneering and early work that is based on optimization techniques on link capacity assignment, routing and flow control in communication networks can be found in, e.g., [4], [5], [6]. Besides these, optimization theory is also widely applied to other applications, such as chemical engineering [7], fleet management and inventory organization, since it leads to the best possible solutions for a given problem. In addition, there are techniques, such as the Langrangian Method that can lead to the development of distributed algorithms. Distributed calculation of the optimal solution is of significant importance in communication networks, which consist of numerous network nodes and traffic sources that behave independently and selfishly to achieve the maximum possible level of satisfaction using the resources of the network. Moreover, optimization theory can also be used to assure that the allocation of resources to each application will follow its Quality of Service requirements and satisfy some notion of fairness. This can be achieved by the appropriate formulation of the optimization problem and the use of specific allocation policies according to the desired type of fairness.

The purpose of this paper is twofold; first, to introduce Lagrangian Optimization as a technique to solve the resource allocation problem in communication networks, and then, to provide some samples of recent work in the area and outline some of the most important challenges that need to be tackled in the future. The rest of the paper is organized as follows. Section 2 provides a summary of the most important notions of Optimization Theory, necessary for someone to do research in the area. Then, Section 3 describes the Network Utility Maximization (NUM) framework and the most important enhancements of the initial NUM framework. Then, Section 4 provides an overview of our recent research in the area as a motivation to tackle some of the remaining open research challenges, which are summarized in Section 5.

Section snippets

Optimization theory overview

This section provides a brief description of the basic notions in Optimization Theory, based on textbooks [8], [9]. The main focus of this overview is on the areas of function and problem convexity, optimization problem formulation, as well as on the advantages that distributed optimization techniques can offer to solve such problems. The interested reader is referred to the aforementioned textbooks for a complete presentation and analysis of Optimization Theory.

A set C is a convex set if it is

Optimization-based resource allocation

The resource allocation problem is one of the numerous research areas in which Optimization Theory has found extensive use, since it can lead to the development of distributed algorithms to assure optimal allocation of resources in a network. This section introduces the Network Utility Maximization framework and provides an overview of prior research in the area.

Highlights of recent research in the area

Section 3 has presented the most significant prior work in literature in the area of Network Utility Maximization. Despite the significant advancements and extensions since the initial NUM framework, there are a number of remaining research challenges that motivated us. Our recent research results in tackling some of these challenges are highlighted in this section. Readers interested in the full details of our research are kindly referred to publications [13], [48], [49], [50].

Conclusion and future work

Despite the aforementioned pieces of work, there are significant research challenges yet to be answered, which are part of our future research plans and will be outlined in this section.

The non-convex optimization framework described in Section 4, can identify the non-convex problems that can be solved distributedly using a gradient-based algorithm. In addition, in case that the condition of Theorem 1 does not hold and oscillations occur, the proposed heuristic can assure stability of the

Georgios Tychogiorgos received the Diploma in Computer, Networks & Telecommunications Engineering from University of Thessaly, Greece in 2006, and an M.Sc. in Communications & Signal Processing and a Ph.D. in Electrical Engineering from Imperial College London in 2007 and 2013 respectively.

In the period May 2009–January 2013, he had been working as a Research Assistant at the Communications & Signal Processing Group at Imperial College London working on network optimization and operational

References (50)

  • C.A. Floudas et al.

    Global optimization in the 21st century: advances and challenges

    Comp. Chem. Eng.

    (2005)
  • L. Kleinrock

    On communications and networks

    IEEE Trans. Comp.

    (1976)
  • Cisco, Cisco Visual Networking Index: Global Mobile Data Traffic Forecast Update, 2010015, Cisco Systems Inc., Tech....
  • Cisco, Cisco Visual Networking Index: Forecast and Methodology, 20100015, Cisco Systems Inc., Tech. Rep., June 2011...
  • L. Fratta et al.

    The flow deviation method: an approach to store-and-forward communication network design

    Networks

    (1973)
  • L. Kleinrock

    Queueing Systems

    (1976)
  • D.P. Bertsekas et al.

    Data Networks

    (1992)
  • S. Boyd et al.

    Convex Optimization

    (2004)
  • D.P. Bertsekas

    Nonlinear Programming

    Athena Scientific

    (1999)
  • R. Horst et al.

    Introduction to Global Optimization

    (1995)
  • P. Pardalos et al.

    Handbook of global optimization

  • C.A. Floudas et al.

    A review of recent advances in global optimization

    J. Glob. Optim.

    (2009)
  • G. Tychogiorgos et al.

    A non-convex distributed optimization framework and its application to wireless ad-hoc networks

    IEEE Trans. Wirel. Commun.

    (2013)
  • T. Weise, Global Optimization Algorithms – Theory and Application, it-weise.de (self-published), 2009...
  • D. Bertsekas et al.

    Parallel and Distributed Computation: Numerical Methods

    (1989)
  • Z. quan Luo et al.

    Semidefinite relaxation of quadratic optimization problems

    IEEE Sig. Process. Magaz.

    (2010)
  • J.B. Lasserre, An explicit exact sdp relaxation for nonlinear 0-1 programs, in: Proceedings of the 8th International...
  • M. Fazel and M. Chiang, Network utility maximization with nonconcave utilities using sum-of-squares method, in: IEEE...
  • X.L. Sun et al.

    A convexification method for a class of global optimization problems with applications to reliability optimization

    J. Glob. Optim.

    (2001)
  • F.P. Kelly et al.

    Rate control in communication networks: shadow prices, proportional fairness and stability

    J. Operat. Res. Soc.

    (1998)
  • S. Low et al.

    Optimization flow control. i. Basic algorithm and convergence

    IEEE/ACM Trans. Network.

    (1999)
  • D. Palomar et al.

    A tutorial on decomposition methods for network utility maximization

    IEEE J. Select. Areas Commun.

    (2006)
  • D.P. Palomar et al.

    Alternative distributed algorithms for network utility maximization: framework and applications

    IEEE Trans. Auto. Control

    (2007)
  • M. Chiang, To layer or not to layer: balancing transport and physical layers in wireless multihop networks, in: IEEE...
  • M. Chiang et al.

    Layering as optimization decomposition: a mathematical theory of network architectures

    Proc. IEEE

    (2007)
  • Cited by (29)

    • Non-cooperative game based congestion control for data rate optimization in vehicular ad hoc networks

      2020, Ad Hoc Networks
      Citation Excerpt :

      The convergence of the vehicles to the same data rate is only determined when all the vehicles are in the same range and this cannot be employed for multi-hop scenarios. Network Utility Maximization (FABRIC) [13] models have been the mathematical support for multiple allocation problems in communication networks especially for congestion control and adaptive routing, or for transmission power allocation in cellular networks, persistence probability optimization in Aloha-type MAC protocols and coordinated transmission in vehicular networks [14]. The FABRIC method [15] requires every vehicle to upload its current data rate and the estimated Lagrange multipliers to its beacon messages.

    • Optimal power allocation for protective jamming in wireless networks: A flow based model

      2015, Computer Networks
      Citation Excerpt :

      A flow-based data models for wireless networks was considered in [23–26]. The authors of [27,28] discussed the resource allocation aspect in a communication network. Our scheduling and jamming problem differs from these as we incorporate an extra element: jamming the eavesdroppers.

    View all citing articles on Scopus

    Georgios Tychogiorgos received the Diploma in Computer, Networks & Telecommunications Engineering from University of Thessaly, Greece in 2006, and an M.Sc. in Communications & Signal Processing and a Ph.D. in Electrical Engineering from Imperial College London in 2007 and 2013 respectively.

    In the period May 2009–January 2013, he had been working as a Research Assistant at the Communications & Signal Processing Group at Imperial College London working on network optimization and operational research. During summer 2011 and 2010, he had been working for IBM at T.J. Watson Research Center, NY, USA, where he worked on the prominent areas of Internet of Things (IoT) and Quality of Information (QoI). Previously, during November 2007–April 2009, he was with British Telecom in Ipswich, UK, working on network design for multimedia applications.

    In 2012, he received the Best Student Paper award at IEEE PIMRC Conference. In July 2011, he received the IBM First Patent Award for submitting a patent application at the US Patent Office. In November 2007, he received the Ericsson Award of Excellence in Telecommunications for the best undergraduate final project.

    Kin K. Leung received his B.S. degree from the Chinese University of Hong Kong in 1980, and his M.S. and Ph.D. degrees from University of California, Los Angeles, in 1982 and 1985, respectively.

    He joined AT&T Bell Labs in New Jersey in 1986 and worked at its successor companies, AT&T Labs and Bell Labs of Lucent Technologies, until 2004. Since then, he has been the Tanaka Chair Professor in the Electrical and Electronic Engineering (EEE), and Computing Departments at Imperial College in London. He serves as the Head of Communications and Signal Processing Group in the EEE Department at Imperial. His research interests focus on networking, protocols, optimization and modeling issues of wireless broadband, sensor and ad hoc networks. He also works on multi-antenna and cross-layer designs for the physical layer of these networks.

    He received the Distinguished Member of Technical Staff Award from AT&T Bell Labs in 1994, and was a co-recipient of the 1997 Lanchester Prize Honorable Mention Award. He was elected as an IEEE Fellow in 2001. He received the Royal Society Wolfson Research Merits Award from 2004 to 2009 and became a member of Academia Europaea in 2012. He has actively served on many conference committees. He serves as a member (2009–2011) and the chairman (2012–2015) of the IEEE Fellow Evaluation Committee for Communications Society. He was a guest editor for the IEEE Journal on Selected Areas in Communications (JSAC), IEEE Wireless Communications and the MONET journal, and as an editor for the JSAC: Wireless Series, IEEE Transactions on Wireless Communications and IEEE Transactions on Communications. Currently, he is an editor for the ACM Computing Survey and International Journal on Sensor Networks.

    Research was partially sponsored by the U.S. Army Research Laboratory and the U.K. Ministry of Defence and was accomplished under Agreement Number W911NF-06-3-0001. The views and conclusions contained in this document are those of the author(s) and should not be interpreted as representing the official policies of the U.S. Army Research Laboratory, the U.S. Government, the U.K. Ministry of Defence or the U.K. Government. The U.S. and U.K. Governments are authorized to reproduce and distribute reprints for Government purposes notwithstanding any copyright notation hereon.

    View full text