Loading [MathJax]/extensions/TeX/mhchem.js
A Unified Approach to Optimizing Performance in Networks Serving Heterogeneous Flows | IEEE Conference Publication | IEEE Xplore

A Unified Approach to Optimizing Performance in Networks Serving Heterogeneous Flows


Abstract:

In this work, we study the control of communication networks in the presence of both inelastic and elastic traffic flows. The characteristics of these two types of traffi...Show More

Abstract:

In this work, we study the control of communication networks in the presence of both inelastic and elastic traffic flows. The characteristics of these two types of traffic differ significantly. Hence, earlier approaches that focus on homogeneous scenarios with a single traffic type are not directly applicable. We formulate a new network optimization problem that incorporates the performance requirements of inelastic and elastic traffic flows. The solution of this problem provides us with a new queueing architecture, and distributed load balancing and congestion control algorithm with provably optimal performance. In particular, we show that our algorithm achieves the dual goal of maximizing the aggregate utility gained by the elastic flows while satisfying the demands of inelastic flows. Our base optimal algorithm is extended to provide better delay performance for both types of traffic with minimal degradation in throughput. It is also extended to the practically relevant case of dynamic arrivals and departures. Our solution allows for a controlled interaction between the performance of inelastic and elastic traffic flows. This performance can be tuned to achieve the appropriate design tradeoff. The network performance is studied both theoretically and through extensive simulations.
Published in: IEEE INFOCOM 2009
Date of Conference: 19-25 April 2009
Date Added to IEEE Xplore: 02 June 2009
ISBN Information:
Print ISSN: 0743-166X
Conference Location: Rio de Janeiro, Brazil

Contact IEEE to Subscribe

References

References is not available for this document.