10988 search results - page 1666 / 2198 » Algorithmic Folding Complexity |
182
Voted
INFOCOM
2006
IEEE
16 years 1 months ago
2006
IEEE
— As wavelength-division multiplexing (WDM) evolves towards practical applications in optical transport networks, waveband switching (WBS) has been introduced to cut down the ope...
191
click to vote
INFOCOM
2006
IEEE
16 years 1 months ago
2006
IEEE
— Traditional network routing uses the single (shortest) path paradigm. This paradigm leaves the session vulnerable to a variety of security threats, such as eavesdropping. We pr...
234
click to vote
PODC
2006
ACM
16 years 1 months ago
2006
ACM
We consider the problem of name-independent routing in doubling metrics. A doubling metric is a metric space whose doubling dimension is a constant, where the doubling dimension o...
226
click to vote
IAT
2005
IEEE
16 years 1 months ago
2005
IEEE
In this paper, we consider the problem of dynamic lightpath protection in survivable WDM networks with single link failure model. Our work concerns in how to dynamically determine...
199
click to vote
IPPS
2005
IEEE
16 years 1 months ago
2005
IEEE
Secret sharing algorithms have been used for intrusion tolerance, which ensure the confidentiality, integrity and availability of critical information. However, dynamically changi...