By Topic

Optimal Bandwidth Allocation for Dynamically Priced Network Services

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Shelford, S. ; Univ. of Victoria, Victoria ; Shoja, G.C. ; Manning, E.G.

We have proposed the use of dynamically priced network services to provide QoS guarantees within a network. End-to-end QoS can be achieved by using several of these services, perhaps from different ISPs. In this paper we consider the problem of determining the bandwidth to allocate each service in order to maximize revenue, assuming that a single ISP can estimate the demand curves for each of its services. We develop and analyze two heuristics which provide time versus revenue tradeoffs. To determine the optimality of our solutions, we map the optimal allocation problem into a multiple choice multidimensional knapsack problem that approaches optimality as we increase the number of bandwidth allocation choices for each service. Our first heuristic, IterLP, achieves revenue close to 99% of the optimal solution, achieving this result in a very short time. The second heuristic, IterGreedy, achieves approximately 93% optimality, but executes more quickly than IterLP.

Published in:

Broadband Communications, Networks and Systems, 2006. BROADNETS 2006. 3rd International Conference on

Date of Conference:

1-5 Oct. 2006