A Market-Based Model of Bandwidth and a New Approach to End-to-End Path Computation with Quality Guarantees

A market-based end-to-end IP service model with quality-of-service (QoS) is proposed based on a recently introduced commodity contract for bandwidth. A percentage of the total trading volume in the bandwidth market is traded in terms of standard commodity contracts and across multiple public marketplaces. The various roles in this model and their relationships are explained and the notion of a bandwidth contract graph is introduced. The problem of selecting an optimal set of bandwidth contracts for end-to-end connectivity that satisfies a budget constraint and a set of quality requirements
is shown to be a link-constrained multi-path-constrained path optimization problem. This includes the multi-path-constrained problem (MPC), whose general formulation is known to be NP-complete, but we show that polynomial-time algorithms are applicable for standardized contracts. Standard contracts thus reduce the computational complexity, facilitating the expansion of bandwidth markets and the development of new, efficient brokerage services for end-to-end connectivity with quality guarantees.

By: G. Cheliotis

Published in: RZ3294 in 2000

LIMITED DISTRIBUTION NOTICE:

This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.

rz3294.pdf

Questions about this service can be mailed to reports@us.ibm.com .