Title:
Pricing Network Resources for Differentiated Service Networks

Simple item page
dc.contributor.advisor Blough, Douglas M.
dc.contributor.advisor Owen, Henry L., III
dc.contributor.author Yang, Weilai en_US
dc.contributor.committeeMember Copeland John
dc.contributor.committeeMember Riley George
dc.contributor.department Electrical and Computer Engineering en_US
dc.date.accessioned 2005-03-03T22:07:23Z
dc.date.available 2005-03-03T22:07:23Z
dc.date.issued 2004-04-12 en_US
dc.description.abstract We developed a price-based resource allocation scheme for Differentiated Service (DiffServ) data networks. The DiffServ framework was proposed to provide multiple QoS classes over IP networks. Since the provider supports multiple service classes, we need a differentiated pricing scheme, as supposed to the flat-rate scheme employed by the Internet service providers of today. Charging efficiently is a big issue. The utility of a client correlates to the amount of bandwidth allocated. One difficulty we face is that determining the appropriate amount of bandwidth to provision and allocate is problematic due to different time scales, multiple QoS classes and the unpredictable nature of users. To approach this problem, we designed a pricing strategy for Admission Control and bandwidth assignment. Despite the variety of existing pricing strategies, the common theme is that the appropriate pricing policy rewards users for behaving in ways to improve the overall utilization and performance of the network. Among existing schemes, we chose auction because it is scalable, and efficiently and fairly shares resources. Our pricing model takes the system's availability and each customer's requirements as inputs and outputs the set of clients who are admitted into the network and their allocated resource. Each client proposes a desired bandwidth and a price that they are willing to pay for it. The service provider collects this information and produces parameters for each class of service they provide. This information is used to decide which customers to admit. We proposed an optimal solution to the problem of maximizing the provider's revenue for the special case where there is only one bottleneck link in the network. Then for the generalized network, we resort to a simple but effective heuristic method. We validate both the optimal solution and the heuristic algorithm with simulations driven by a real traffic scenario. Finally, we allow customers to bid on the duration for which the service is needed. Then we study the performance of those heuristic algorithms in this new setting and propose possible improvements. en_US
dc.description.degree Ph.D. en_US
dc.format.extent 1702010 bytes
dc.format.mimetype application/pdf
dc.identifier.uri http://hdl.handle.net/1853/5227
dc.language.iso en_US
dc.publisher Georgia Institute of Technology en_US
dc.subject Auction en_US
dc.subject Pricing
dc.subject Resource allocation
dc.subject Differentiated service networks
dc.subject.lcsh Customer services Pricing en_US
dc.subject.lcsh Internet service providers Pricing en_US
dc.subject.lcsh Computer industry Customer services Pricing en_US
dc.title Pricing Network Resources for Differentiated Service Networks en_US
dc.type Text
dc.type.genre Dissertation
dspace.entity.type Publication
local.contributor.advisor Blough, Douglas M.
local.contributor.advisor Owen, Henry L., III
local.contributor.corporatename School of Electrical and Computer Engineering
local.contributor.corporatename College of Engineering
relation.isAdvisorOfPublication 361410e1-2656-48cf-8d91-a4cd3d538c29
relation.isAdvisorOfPublication d3983de1-d725-47f4-b653-a318b39d8fd9
relation.isOrgUnitOfPublication 5b7adef2-447c-4270-b9fc-846bd76f80f2
relation.isOrgUnitOfPublication 7c022d60-21d5-497c-b552-95e489a06569
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
yang_weilai_200405_phd.pdf
Size:
1.62 MB
Format:
Adobe Portable Document Format
Description:
Download
Collections
Theses and Dissertations