%0 Conference Proceedings
%T A Flexible Auction Model for Virtual Private Networks
%+ Warsaw University of Technology [Warsaw]
%A Kołtyś, Kamil
%A Pieńkosz, Krzysztof
%A Toczyłowski, Eugeniusz
%Z Part 2: Pricing
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 10th IFIP Networking Conference (NETWORKING)
%C Valencia, Spain
%Y Jordi Domingo-Pascual
%Y Pietro Manzoni
%Y Sergio Palazzo
%Y Ana Pont
%Y Caterina Scoglio
%I Springer
%3 NETWORKING 2011
%V LNCS-6641
%N Part II
%P 97-108
%8 2011-05-09
%D 2011
%R 10.1007/978-3-642-20798-3_8
%K auction model
%K virtual private network
%K bandwidth trading
%Z Computer Science [cs]
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Conference papers
%X We consider the resource allocation problem related to Virtual Private Networks (VPNs). VPN provides connections between geographically dispersed endpoints over a shared network. To realize VPN service, sufficient amount of bandwidth of network resources must be reserved for any traffic demand specified by a customer. We assume that there are many customers that want to purchase VPN services, and many network providers that offer their network resources for sale. We present a multicommodity auction model that enables the efficient management of the network resources in the market environment. On the other hand it is very convenient for the customers as it allows them to specify the bandwidth requirements concerning VPN in a very flexible way, including pipe and hose VPN representations. The proposed model has also many other valuable properties, such as individual rationality and budget balance. The auction model has a form of LP for which the computational efficiency can be improved by applying the column generation technique.
%G English
%Z TC 6
%2 https://inria.hal.science/hal-01597966/document
%2 https://inria.hal.science/hal-01597966/file/978-3-642-20798-3_8_Chapter.pdf
%L hal-01597966
%U https://inria.hal.science/hal-01597966
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC6
%~ IFIP-NETWORKING
%~ IFIP-LNCS-6641