Sciweavers

1986 search results - page 349 / 398
» Path Separability of Graphs
Sort
View
CONEXT
2007
ACM
13 years 11 months ago
Internet routing resilience to failures: analysis and implications
Internet interdomain routing is policy-driven, and thus physical connectivity does not imply reachability. On average, routing on today's Internet works quite well, ensuring ...
Jian Wu, Ying Zhang, Zhuoqing Morley Mao, Kang G. ...
BROADNETS
2004
IEEE
13 years 11 months ago
Diverse Routing for Shared Risk Resource Groups (SRRG) Failures in WDM Optical Networks
Failure resilience is one of the desired features of the Internet. Most of the traditional restoration architectures are based on single-failure assumption which is unrealistic. M...
Pallab Datta, Arun K. Somani
ER
2000
Springer
122views Database» more  ER 2000»
13 years 11 months ago
Managing RDF Metadata for Community Webs
The need for descriptive information, i.e., metadata, about Web resources has been recognized in several application contexts (e.g., digital libraries, portals). The Resource Descr...
Sofia Alexaki, Vassilis Christophides, Gregory Kar...
FOCS
2000
IEEE
13 years 11 months ago
Approximating the single source unsplittable min-cost flow problem
Abstract. In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given ...
Martin Skutella
DCOSS
2010
Springer
13 years 11 months ago
Wormholes No More? Localized Wormhole Detection and Prevention in Wireless Networks
A number of protocols have been proposed to date to defend against wormhole attacks in wireless networks by adopting synchronized clocks, positioning devices, or directional antenn...
Tassos Dimitriou, Thanassis Giannetsos