基于拍卖的网络带宽分配方法的研究  

Research on Auction-Based Bandwidth Allocation for Computer Networks

作　　者：魏蛟龙[1] 张驰[1] 

机构地区：[1]华中科技大学电子与信息工程系,湖北武汉430074

出　　处：《电子学报》2003年第6期891-894,共4页Acta Electronica Sinica

基　　金：湖北省自然科学基金 (No 99J0 4 1 ;No 2 0 0 1ABB1 0 4 )

摘　　要：基于拍卖的网络带宽分配方法的研究日益受到学术界的重视 ,主要集中在具有激励兼容性的Vickrey拍卖上 .本文首先分析并比较了目前最具代表性的两种Vickrey拍卖方案 (灵活市场模型和改进的第二价格拍卖 ) ,指出其在网络可扩展性、工程效率等方面的不足 .然后提出了一种新的基于统一价格拍卖的资源分配算法 ,论证了其在网络这一特定环境中具有激励兼容性 .该算法具有与网络状态无关的特性和更高的运行效率 .最后 ,用NS 2仿真平台验证了该算法的有效性 .It has been widely accepted that auctioning is a proper tool to manage scare network resources. Previous works focus on Vickrey auction which is incentively compatible. The most representative Vickrey auction-based mechanisms (smart market model and progressive second price auction) are introduced and their faults in scalability and engineering efficiency are also pointed out. Then the paper presents a new resource allocation algorithm based on uniform-price auction, which is stateless and efficient in engineering, and proves its incentive compatibility in the network environment. Finally, simulation experiments with NS-2 (Network Simulator) are conducted to evaluate performances of the proposed algorithm.

关 键 词：网络资源分配 基于使用的计费 Vickrey拍卖 灵活市场模型 改进的第二价格拍卖 统一价格拍卖 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]