Sciweavers

334 search results - page 41 / 67
» Inapproximability of Survivable Networks
Sort
View
DSN
2004
IEEE
14 years 10 days ago
HOURS: Achieving DoS Resilience in an Open Service Hierarchy
Hierarchical systems have been widely used to provide scalable distributed services in the Internet. Unfortunately, such a service hierarchy is vulnerable to DoS attacks. This pap...
Hao Yang, Haiyun Luo, Yi Yang, Songwu Lu, Lixia Zh...
CORR
2010
Springer
162views Education» more  CORR 2010»
13 years 8 months ago
A distributed file system for a wide-area high performance computing infrastructure
We describe our work in implementing a wide-area distributed file system for the NSF TeraGrid. The system, called XUFS, allows private distributed name spaces to be created for tr...
Edward Walker
CORR
2010
Springer
124views Education» more  CORR 2010»
13 years 8 months ago
Component Evolution in General Random Intersection Graphs
Abstract. Random intersection graphs (RIGs) are an important random structure with algorithmic applications in social networks, epidemic networks, blog readership, and wireless sen...
Milan Bradonjic, Aric A. Hagberg, Nicolas W. Henga...
AINA
2005
IEEE
14 years 2 months ago
Optimal Energy-Efficient Routing for Wireless Sensor Networks
The network lifetime for wireless sensor network plays an important role to survivability. Thus, we indicate the importance of routing protocol to network lifetime, and model the ...
Chih-Wei Shiou, Frank Yeong-Sung Lin, Hsu-Chen Che...
ACSC
2004
IEEE
14 years 11 days ago
Establishing Trust In Pure Ad-hoc Networks
An ad-hoc network of wireless nodes is a temporarily formed network, created, operated and managed by the nodes themselves. It is also often termed an infrastructure-less, self-or...
Asad Amir Pirzada, Chris McDonald