Computer Science – Networking and Internet Architecture
Scientific paper
2011-09-30
Computer Science
Networking and Internet Architecture
6 pages, conference submission
Scientific paper
In recent years, there has been an increasing demand for ubiquitous streaming like applications in data networks. In this paper, we concentrate on NUM-based rate allocation for streaming applications with the so-called S-curve utility functions. Due to non-concavity of such utility functions, the underlying NUM problem would be non-convex for which dual methods might become quite useless. To tackle the non-convex problem, using elementary techniques we make the utility of the network concave, however this results in reverse-convex constraints which make the problem non-convex. To deal with such a transformed NUM, we leverage Sequential Convex Programming (SCP) approach to approximate the non-convex problem by a series of convex ones. Based on this approach, we propose a distributed rate allocation algorithm and demonstrate that under mild conditions, it converges to a locally optimal solution of the original NUM. Numerical results validate the effectiveness, in terms of tractable convergence of the proposed rate allocation algorithm.
Khonsari Ahmad
Sehati Ali
Talebi Mohammad Sadegh
No associations
LandOfFree
NUM-Based Rate Allocation for Streaming Traffic via Sequential Convex Programming does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with NUM-Based Rate Allocation for Streaming Traffic via Sequential Convex Programming, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and NUM-Based Rate Allocation for Streaming Traffic via Sequential Convex Programming will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-668565