## Abstract Queueing networks with finite buffers, multiple servers, arbitrary acyclic, seriesβparallel topologies, and general service time distributions are considered in this paper. An approach to optimally allocate servers to series, merge, and split topologies and their combinations is demonst
Optimal adaptive server allocation in a network
β Scribed by Pantelis Tsoucas; Jean Walrand
- Publisher
- Elsevier Science
- Year
- 1986
- Tongue
- English
- Weight
- 284 KB
- Volume
- 7
- Category
- Article
- ISSN
- 0167-6911
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Resource/equipment allocation applications are becoming increasingly difficult to manage because of the routing/control complexity and contention conflicts, i.e. the amount of equipment operating simultaneously. The technical diversity of this equipment is also growing. Architectures that once inclu
Fast computation through parallel processing and large distributed memory are two important qualities of new multiprocessor computing machines. Various processors of these machines are interconnected through a suitable network. However, a fault in a single processor may drastically reduce the perfor
Intelligent network (IN) architectures are investigated globally as potential candidates for the rapid introduction of advanced multimedia services. The IN concept is based on the introduction of intelligent servers in the network, able to handle complex service requests by cooperating with the sign