Abstract
The network is comprised of a set of ″local″ exchanges receiving calls from a set of ″source″ exchanges. The switching configuration is such that calls originating at a given source exchange are routed randomly to one of the various local exchanges rather than being transferred directly to their destinations. It is shown that, contrary to the common practice of partitioning the trunks leaving each source exchange proportionately to the distribution of offered load to the various local exchanges, the optimal allocation, which minimizes total flow in the system, is that one which for each source exchange directs all outgoing trunks to a single local exchange. This latter exchange is the one to which the offered load from the given source exchange is maximal, but distinct source exchanges may have different ″maximal″ local exchanges. The technique of analysis used here is to transform a typical queueing problem into a linear programming problem which then yields a simple and easily employed solution.
| Original language | English |
|---|---|
| Pages (from-to) | 261-264 |
| Number of pages | 4 |
| Journal | Isr J Technol |
| Volume | 14 |
| Issue number | 6 |
| State | Published - 1976 |
Fingerprint
Dive into the research topics of 'ON OPTIMAL ALLOCATION OF TRUNKS IN A LOCAL NETWORK OF PUBLIC TELEPHONE EXCHANGES.'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver