581 search results - page 33 / 117 » Approximation algorithms for constructing wavelength routing... |
111
click to vote
IPCO
1993
15 years 2 months ago
1993
The survivable network design problem (SNDP) is to construct a minimum-cost subgraph satisfying certain given edge-connectivity requirements. The first polynomial-time approximati...
118
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
Multicast is the ability of a communication network to accept a single message from an application and to deliver copies of the message to multiple recipients at different locatio...
124
click to vote
MOBIHOC
2007
ACM
16 years 1 months ago
2007
ACM
The non-existence of an end-to-end path poses a challenge in adapting the traditional routing algorithms to delay tolerant networks (DTNs). Previous works include centralized rout...
131
click to vote
PDP
2006
IEEE
15 years 7 months ago
2006
IEEE
Peer-to-Peer computing is mainly based on the virtual overlay network constructed in the application layer. Often, there is topology mismatching between the overlay network and th...
108
click to vote
STOC
2001
ACM
16 years 1 months ago
2001
ACM
Consider a setting in which a group of nodes, situated in a large underlying network, wishes to reserve bandwidth on which to support communication. Virtual private networks (VPNs...