Sciweavers

3 search results - page 1 / 1
» Simple Product-Form Bounds for Queueing Networks with Finite...
Sort
View
ANOR
2002
67views more  ANOR 2002»
13 years 4 months ago
Simple Product-Form Bounds for Queueing Networks with Finite Clusters
Queueing networks are studied with finite capacities for clusters of stations, rather than for individual stations. First, an instructive tandem cluster example is studied to show...
Nico M. van Dijk, Erik van der Sluis
DAGSTUHL
2000
13 years 5 months ago
Product Form Queueing Networks
Queueing network models have been extensively applied to represent and analyze resource sharing systems such as communication and computer systems and they have proved to be a pow...
Simonetta Balsamo
RTSS
2006
IEEE
13 years 10 months ago
Modeling and Worst-Case Dimensioning of Cluster-Tree Wireless Sensor Networks
Time-sensitive Wireless Sensor Network (WSN) applications require finite delay bounds in critical situations. This paper provides a methodology for the modeling and the worst-case...
Anis Koubaa, Mário Alves, Eduardo Tovar