Abstract
The link bandwidth allocation problem in an integrated services network, where the types of calls are differentiated by the rates at which the requests for service are generated, the mean holding time, and the number of trunks requested, is considered. The decision to accept or reject a call for service may be based on the number of different calls in service to maximize (or minimize) a certain performance measure. This can be the throughput, the maximum blocking probability of any call type, or the revenue when different types have different call charging rates. An efficient and accurate approximation for an integrated services system where a dynamic trunk reservation policy is used is presented. The advantage of the dynamic trunk reservation over the steady trunk reservation is shown by numerical results.
| Original language | English |
|---|---|
| Pages (from-to) | 977-981 |
| Number of pages | 5 |
| Journal | IEEE International Conference on Communications |
| Volume | 2 |
| Publication status | Published - 1989 |
| Externally published | Yes |
| Event | IEEE International Conference on Communications - ICC'89 - Boston, MA, USA Duration: 11 Jun 1989 → 14 Jun 1989 |
ASJC Scopus subject areas
- Computer Networks and Communications
- Electrical and Electronic Engineering
Fingerprint
Dive into the research topics of 'Dynamic link bandwidth allocation in an integrated services network'. These topics are generated from the title and abstract of the publication. Together, they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver