A Price Dynamics in Bandwidth Markets for Point-to-point Connections

We describe a model of a network of N sub-networks (or routers) where M network users making concurrent point-to-point connections by selling and buying router capacity to and from each other. The resources need to be acquired in complete bundles, but there is only one spot market for each router, i.e. no way to place bids on complete bundles. In order to describe the internal dynamics of the market, we model the observed prices by N-dimensional Ito-processes. Modeling using stochastic processes is novel in this context of describing interactions between end-users in a system with shared resources, and allows a standard set of mathematical tools to be applied. The derived models is intended to price contingent claims on network capacity and thus to price complex network services such as, trading resource bundles, pricing quality of service levels, multicast service, etc.

[1]  Nemo Semret,et al.  Spot and Derivative Markets in Admission Control , 1999 .

[2]  F. Black,et al.  The Pricing of Options and Corporate Liabilities , 1973, Journal of Political Economy.

[3]  Tuomas Sandholm,et al.  An algorithm for optimal winner determination in combinatorial auctions , 1999, IJCAI 1999.

[4]  C. Sierra,et al.  Automated Negotiation for Provisioning Virtual Private Networks Using FIPA-Compliant Agents , 2000 .

[5]  J. Farmer Market Force, Ecology, and Evolution , 1998, adap-org/9812005.

[6]  Donald F. Ferguson,et al.  An approach to pricing, optimal allocation and quality of service provisioning in high-speed packet networks , 1995, Proceedings of INFOCOM'95.

[7]  Tad Hogg,et al.  Spawn: A Distributed Computational Economy , 1992, IEEE Trans. Software Eng..

[8]  Lars Rasmusson,et al.  Pricing Virtual Paths with Quality-of-Service Guarantees as Bundle Derivatives , 2001, cs/0106028.

[9]  S. Rassenti,et al.  A Combinatorial Auction Mechanism for Airport Time Slot Allocation , 1982 .

[10]  Rahul Simha,et al.  A Microeconomic Approach to Optimal Resource Allocation in Distributed Computer Systems , 1989, IEEE Trans. Computers.

[11]  Ronald M. Harstad,et al.  Computationally Manageable Combinational Auctions , 1998 .

[12]  Quantitative Modeling of Derivative Securities: From Theory To Practice , 1999 .

[13]  Donald F. Ferguson,et al.  Microeconomic algorithms for load balancing in distributed computer systems , 1988, [1988] Proceedings. The 8th International Conference on Distributed.