425 search results - page 27 / 85 » A Fully Dynamic Algorithm for Distributed Shortest Paths |
TON
2008
13 years 8 months ago
2008
Given a set of demands between pairs of nodes, we examine the traffic engineering problem of flow routing and fair bandwidth allocation where flows can be split to multiple paths ...
VLSID
2002
IEEE
14 years 1 months ago
2002
IEEE
à This paper addresses the problem of static and dynamic variable voltage scheduling of multi-rate periodic task graphs (i.e., tasks with precedence relationships) and aperiodic t...
WISE
2002
Springer
14 years 1 months ago
2002
Springer
Navigating through a large Web site can be a frustrating exercise. Many sites employ Site Maps to help visitors understand the overall structure of the site. However, by their ver...
SIGCOMM
2004
ACM
14 years 2 months ago
2004
ACM
Overlay network monitoring enables distributed Internet applications to detect and recover from path outages and periods of degraded performance within seconds. For an overlay net...
INFOCOM
2000
IEEE
14 years 1 months ago
2000
IEEE
— This paper presents new algorithms for dynamic routing of restorable bandwidth guaranteed paths. Dynamic routing implies routing of requests that arrive one-by-one with no a pr...