Provisioning for bandwidth sharing and exchange

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

doi:10.1007/978-1-4757-3762-2

Provisioning for bandwidth sharing and exchange

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

Research output: Contribution to journal › Article › peer-review

16 Scopus citations

Abstract

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 language	English (US)
Pages (from-to)	207-225
Number of pages	19
Journal	Operations Research/ Computer Science Interfaces Series
Volume	23
DOIs	https://doi.org/10.1007/978-1-4757-3762-2
State	Published - 2003

All Science Journal Classification (ASJC) codes

Computer Science(all)
Management Science and Operations Research

Keywords

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

Access to Document

10.1007/978-1-4757-3762-2

Cite this

@article{899a4a27d2c54a7196692e023f839355,

title = "Provisioning for bandwidth sharing and exchange",

abstract = "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.",

keywords = "Bandwidth exchanges, Erlang B formula, Heavy traffic limits, Loss systems, Network economics, Network provisioning",

author = "Hampshire, {Robert C.} and Massey, {William A.} and Debasis Mitra and Qiong Wang",

year = "2003",

doi = "10.1007/978-1-4757-3762-2",

language = "English (US)",

volume = "23",

pages = "207--225",

journal = "Operations Research/ Computer Science Interfaces Series",

issn = "1387-666X",

publisher = "Springer Science + Business Media",

}

TY - JOUR

T1 - Provisioning for bandwidth sharing and exchange

AU - Hampshire, Robert C.

AU - Massey, William A.

AU - Mitra, Debasis

AU - Wang, Qiong

PY - 2003

Y1 - 2003

N2 - 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.

AB - 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.

KW - Bandwidth exchanges

KW - Erlang B formula

KW - Heavy traffic limits

KW - Loss systems

KW - Network economics

KW - Network provisioning

UR - http://www.scopus.com/inward/record.url?scp=51149086981&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=51149086981&partnerID=8YFLogxK

U2 - 10.1007/978-1-4757-3762-2

DO - 10.1007/978-1-4757-3762-2

M3 - Article

AN - SCOPUS:51149086981

SN - 1387-666X

VL - 23

SP - 207

EP - 225

JO - Operations Research/ Computer Science Interfaces Series

JF - Operations Research/ Computer Science Interfaces Series

ER -

Provisioning for bandwidth sharing and exchange

Abstract

All Science Journal Classification (ASJC) codes

Keywords

Access to Document

Other files and links

Fingerprint

Cite this