RIS ID
11205
Abstract
This paper describes an on-line auction process for dynamic bandwidth allocation in communication networks. The auction is intended to be repeated at short (perhaps ten minute) intervals. The outcome of the auction gives both the bandwidth allocation, and the price to be paid for it. The network is assumed to be MPLS capable, and two variations are provided, one in which a single LSP is available between each source/destination pair, and another in which multiple LSPs are available. We show that the present algorithms are scalable up to about 150 nodes.
Publication Details
This paper originally appeared as: Que, YP and Platt, D, Online bandwidth auctions for efficient allocation of bandwidth, Proceedings. 12th IEEE International Conference on Networks, 16-19 November 2004, vol 2, 630-634. Copyright IEEE 2004.