581 search results - page 22 / 117 » Approximation algorithms for constructing wavelength routing... |
126
click to vote
INFOCOM
2000
IEEE
15 years 5 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...
IPL
2002
15 years 1 months ago
2002
Constructing maximum bandwidth paths has been a basic operation in the study of network routing, in particular in the recent study of network QoS routing. In the literature, it ha...
139
click to vote
FPGA
2000
ACM
15 years 5 months ago
2000
ACM
A method for evaluating and constructing sparse crossbars which are both area efficient and highly routable is presented. The evaluation method uses a network flow algorithm to ac...
141
click to vote
MOBIHOC
2002
ACM
16 years 29 days ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
124
click to vote
LCN
2008
IEEE
15 years 7 months ago
2008
IEEE
— Although many multicast routing algorithms have been proposed in order to reduce the total cost in WDM optical networks, the link stress and delay are two parameters which are ...