## 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 server scheduling in hybrid P2P networks
β Scribed by Bo Zhang; Sem C. Borst; Martin I. Reiman
- Publisher
- Elsevier Science
- Year
- 2010
- Tongue
- English
- Weight
- 391 KB
- Volume
- 67
- Category
- Article
- ISSN
- 0166-5316
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
In this paper, we consider a general class of optimal sensor scheduling problems in discrete time. There are N 1 sensors available for acquiring data so as to estimate the needed but unknown signal. Only N 2 out of the N 1 sensors can be turned on at any moment, while different weights can be assign
In wireless multihop networks, the objective of the broadcast scheduling problem is to find a conflict free transmission schedule for each node at different time slots in a fixed length time cycle, called TDMA cycle. The optimization criterion is to find an optimal TDMA schedule with minimal TDMA cy
In the last years, trust management has become a fundamental basis for facilitating the cooperation between different users in peer-to-peer (P2P) multimedia applications within autonomic networks. In these networks and applications, trust management should fulfill certain requirements (i.e. decentra