295 search results - page 5 / 59 » A New Node Centroid Algorithm for Bandwidth Minimization |
APPROX
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. In this paper we introduce a new technique for approximation schemes for geometrical optimization problems. As an example problem, we consider the following variant of th...
MWCN
2004
Springer
15 years 3 months ago
2004
Springer
We consider the problem of assigning transmission powers to the nodes of a wireless network in such a way that all the nodes of the network are connected by bidirectional links and...
106
click to vote
ICNP
2002
IEEE
15 years 3 months ago
2002
IEEE
This paper presents a new algorithm for dynamic routing of bandwidth guaranteed multicast tunnels with failure backup. The multicast routing problem arises in many contexts such a...
ESORICS
2000
Springer
15 years 1 months ago
2000
Springer
The ATM technology has been specified to provide users with the ability to request quality of service (QoS) for their applicatio ns and to enable high speed communications. Howeve...
INFOCOM
2000
IEEE
15 years 2 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...