1414 search results - page 56 / 283 » Performance Bounds in Communication Networks with Variable-R... |
GLOBECOM
2006
IEEE
14 years 1 months ago
2006
IEEE
— We consider wireless multihop data networks with random multi-access mechanisms at the MAC layer. Our aim is to study the performance as perceived by users in a dynamic setting...
PODC
2005
ACM
14 years 1 months ago
2005
ACM
One of the fundamental problems in distributed computing is how to efficiently perform routing in a faulty network in which each link fails with some probability. This paper inves...
PARELEC
2002
IEEE
14 years 18 days ago
2002
IEEE
In this paper, we investigate the worst case performance of Earliest Due Date algorithm when applied to packet scheduling in distributed systems. We assume that the processing ele...
IWCMC
2010
ACM
14 years 23 days ago
2010
ACM
The assumption of routing symmetry is often embedded into traffic analysis and classification tools. This paper uses passively captured network data to estimate the amount of tra...
IPPS
1998
IEEE
13 years 12 months ago
1998
IEEE
This work deals with the scheduling problem of a directed acyclic graph with interprocessor communication delays. The objective is to minimize the makespan, taking into account the...