Conference Paper

A Unified Approach to Optimizing Performance in Networks Serving Heterogeneous Flows.

Conference: INFOCOM 2009. 28th IEEE International Conference on Computer Communications, Joint Conference of the IEEE Computer and Communications Societies, 19-25 April 2009, Rio de Janeiro, Brazil
Source: DBLP
Download full-text


Available from: Atilla Eryilmaz, Mar 31, 2015
  • Source
    • "NRT processes may perform computations which satisfy their timing requirements but resource management is not time or constraint driven. The definition of RT is divided into hard real-time (HRT) and soft real-time (SRT) and the latter has further been subdivided into inelastic and elastic SRT (Li et al., 2011): HRT processes have strict end-to-end delay requirements, and late packets are considered unusable. This is because the completion of a related computation after its deadline will impede a systems ability to operate correctly or have a critical impact on the system. "
    [Show abstract] [Hide abstract]
    ABSTRACT: This paper provides a review of the different cross-layer design and protocol tuning approaches that may be used to meet a growing need to support inelastic soft real-time streams in MANETs. These streams are characterised by critical timing and throughput requirements and low packet loss tolerance levels. Many cross-layer approaches exist either for provision of QoS to soft real-time streams in static wireless networks or to improve the performance of real and non-real-time transmissions in MANETs. The common ground and lessons learned from these approaches, with a view to the potential provision of much needed support to real-time applications in MANETs, is therefore discussed.
    Full-text · Article · Nov 2011 · Journal of Network and Computer Applications
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: We consider the network with two kinds of traffic: inelastic and elastic traffic. The inelastic traffic requires fixed throughput, high priority while the elastic traffic has controllable rate and low priority. Giving the fixed rate of inelastic traffic, how to inject the elastic traffic into the network to achieve the maximum utility of elastic traffic is solved in this paper. The Lagrangian Duality method is applied to solve the optimization problem. We decompose the Lagrangian into subproblems, and each sub-problem associates with each layer. The convexity of the primal problem guarantees the duality gap between primal and dual solutions is zero. The Lagrange multipliers, which are indeed the queue length on nodes for every destinations, implicitly update according to subgradient algorithm. The joint algorithm for rate control, routing, and scheduling is proposed. However, the scheduling is Max-weight scheduling and centralized algorithm actually. The Greedy distributed scheduling is introduced to implement scheduling in a distributed sense.
    Full-text · Conference Paper · Feb 2011
  • [Show abstract] [Hide abstract]
    ABSTRACT: Ideally, networks should be designed to accommodate a variety of different traffic types, while at the same time maximizing its efficiency and utility. Network utility maximization (NUM) serves as an effective approach for solving the problem of network resource allocation (NRA) in network analysis and design. In existing literature, the NUM model has been used to achieve optimal network resource allocation such that the network utility is maximized. This is important, since network resources are at premium with the exponential increase in Internet traffic. However, most research work considering network resource allocation does not take into consideration key issues, such as routing and delay. A good routing policy is the key to efficient network utility, and without considering the delay requirements of the different traffic, the network will fail to meet the user’s quality of service (QoS) constraints. In this paper, we propose a new NUM framework that achieves improved network utility while taking into routing and delay requirements of the traffic. Then, we propose a decomposition technique-based algorithm, D-NUM, for solving this model efficiently. We compare our approach with existing approaches via simulations and show that our approach performs well. KeywordsMathematical programming–Optimization–Network resource allocation–Network utility maximization–Optimal provisioning
    No preview · Article · Oct 2011 · Photonic Network Communication
Show more