Paper
1 July 2002 Auction-based bandwidth allocation in the Internet
Jiaolong Wei, Chi Zhang
Author Affiliations +
Proceedings Volume 4866, Quality of Service over Next-Generation Internet; (2002) https://doi.org/10.1117/12.473014
Event: ITCom 2002: The Convergence of Information Technologies and Communications, 2002, Boston, MA, United States
Abstract
It has been widely accepted that auctioning which is the pricing approach with minimal information requirement is a proper tool to manage scare network resources. Previous works focus on Vickrey auction which is incentive compatible in classic auction theory. In the beginning of this paper, the faults of the most representative auction-based mechanisms are discussed. And then a new method called uniform-price auction (UPA), which has the simplest auction rule is proposed and it's incentive compatibility in the network environment is also proved. Finally, the basic mode is extended to support applications which require minimum bandwidth guarantees for a given time period by introducing derivative market, and a market mechanism for network resource allocation which is predictable, riskless, and simple for end-users is completed.
© (2002) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Jiaolong Wei and Chi Zhang "Auction-based bandwidth allocation in the Internet", Proc. SPIE 4866, Quality of Service over Next-Generation Internet, (1 July 2002); https://doi.org/10.1117/12.473014
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Internet

Motion models

Silicon

Artificial intelligence

Electronics

Electronics engineering

Image processing

RELATED CONTENT

Self-similarity-based image edge detection
Proceedings of SPIE (August 30 2002)
Geometric modeling of noisy image objects
Proceedings of SPIE (March 01 1991)
Man-machine interactive 3D route planner for unmanned aircraft
Proceedings of SPIE (September 25 2001)
Graph-incorporated active learning with SVM
Proceedings of SPIE (November 23 2011)

Back to Top