Control of multiple service, multiple resource communication networks
- 1 January 1991
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 648-657 vol.2
- https://doi.org/10.1109/infcom.1991.147567
Abstract
The authors focus upon communication networks that integrate multiple services using multiple resources. In particular, the authors address the decision of whether to accept or deny service requests in such a system. A conjecture for the optimal policy for a related system introduced by G.J. Foschini and B. Gopinath (1983) is proved, and the optimal coordinate convex policy for a multiple service, multiple resource system is characterized.Keywords
This publication has 21 references indexed in Scilit:
- Throughput in multiple service, multiple resource communication networksIEEE Transactions on Communications, 1991
- Routing in circuit-switched networks: optimization, shadow prices and decentralizationAdvances in Applied Probability, 1988
- Designing a new architecture for packet switching communication networksIEEE Communications Magazine, 1987
- A threaded/flow approach to reconfigurable distributed systems and service primitives architecturesACM SIGCOMM Computer Communication Review, 1987
- Asymptotic analysis and computational methods for a class of simple, circuit-switched networks with blockingAdvances in Applied Probability, 1987
- Blocking probabilities in large circuit-switched networksAdvances in Applied Probability, 1986
- Blocking When Service Is Required From Several Facilities SimultaneouslyAT&T Technical Journal, 1985
- Insensitivity of blocking probabilities in a circuit-switching networkJournal of Applied Probability, 1984
- Sharing Memory OptimallyIEEE Transactions on Communications, 1983
- Queuing Networks with Population Size ConstraintsIBM Journal of Research and Development, 1977