15 search results - page 2 / 3 » Bound analysis of closed queueing networks with workload bur... |
INFOCOM
1993
IEEE
13 years 8 months ago
1993
IEEE
This paper addresses the problem of finding the worst case end-to-end delay and buffer occupancy bounds in ATM networks with rate-controlled, non-work conserving servers. A theore...
INFOCOM
1998
IEEE
13 years 8 months ago
1998
IEEE
The objective of recent research in fair queueing schemes has been to efficiently emulate a fluid-flow generalized (weighted) processor sharing (GPS) system, as closely as possibl...
INFOCOM
1996
IEEE
13 years 8 months ago
1996
IEEE
In this paper, we develop a general model, called Latency-Rate servers (LR servers), for the analysis of traffic scheduling algorithms in broadband packet networks. The behavior of...
INFOCOM
2009
IEEE
13 years 11 months ago
2009
IEEE
Abstract—We analyze the delay performance of a multihop wireless network with a fixed route between each sourcedestination pair. There are arbitrary interference constraints on ...
MASCOTS
2004
13 years 6 months ago
2004
It is known that the resources that limit the overall performance of the system are the congested ones, referred to as bottlenecks. From the knowledge of the bottleneck stations w...