Multi-Dimensional Bid Greedy Auction Mechanism for Bandwidth Allocation

Since current bandwidth mechanisms need communicating general functions or long convergence phase, they are not feasible in practice. In this letter, an efficient bandwidth allocation mechanism is proposed, which called Multi-dimensional Bid Greedy auction mechanism. It presents the advantage that the Multi-dimensional bid is submitted once only, saving a lot of signalization overhead. We formulate the problem of bandwidth allocation in networks as a combinatorial auction problem and propose an allocation rule to solve it. This allocation rule is complemented by a payment rule of the VCG (Vickrey-Clarke-Groves) type, which provides users with the incentive to bid truthfully, thus simplifying bidding. We argue that our mechanism is simple and applicable to real networks. Since our mechanism´s computational complexity is low, it can serve as a fast and practical solution to bandwidth allocation.