Provisioning for bandwidth sharing and exchange

Robert C. Hampshire, William A. Massey, Debasis Mitra, Qiong Wang

Research output: Contribution to journalArticlepeer-review

18 Scopus citations


Customers of bandwidth services can be divided into two distinct groups: those customers requesting bandwidth for the future and those desiring bandwidth immediately. We develop a dynamic network provisioning methodology that minimally satisfies the QoS (blocking probability) requirements for the 'on-demand' customers. Our method is sufficiently general and captures time varying trends in the demand for services as well as different bandwidth requests for the multiple classes of customers. This allows a network provider to be efficient in reserving excess bandwidth for forward contracts. Asymptotic results and bounds for the Erlang loss system are invoked to obtain simple approximate solutions to this bandwidth provisioning problem.

Original languageEnglish (US)
Pages (from-to)207-225
Number of pages19
JournalOperations Research/ Computer Science Interfaces Series
StatePublished - 2003

All Science Journal Classification (ASJC) codes

  • General Computer Science
  • Management Science and Operations Research


  • Bandwidth exchanges
  • Erlang B formula
  • Heavy traffic limits
  • Loss systems
  • Network economics
  • Network provisioning


Dive into the research topics of 'Provisioning for bandwidth sharing and exchange'. Together they form a unique fingerprint.

Cite this