Sciweavers

5934 search results - page 424 / 1187
» Detecting a Network Failure
Sort
View
FMCO
2007
Springer
129views Formal Methods» more  FMCO 2007»
16 years 1 months ago
Self Management for Large-Scale Distributed Systems: An Overview of the SELFMAN Project
As Internet applications become larger and more complex, the task of managing them becomes overwhelming. “Abnormal” events such as software updates, failures, attacks, and hots...
Peter Van Roy, Seif Haridi, Alexander Reinefeld, J...
ISPAN
2005
IEEE
16 years 1 months ago
Minimum Cost Paths Subject to Minimum Vulnerability for Reliable Communications
Abstract—In real networks, disjoint paths are needed for providing protection against single link/node failure. When disjoint paths cannot be found, an alternative solution is to...
Bing Yang, Mei Yang, Jianping Wang, S. Q. Zheng
IPTPS
2005
Springer
16 years 1 months ago
Practical Locality-Awareness for Large Scale Information Sharing
Tulip is an overlay for routing, searching and publish-lookup information sharing. It offers a unique combination of the advantages of both structured and unstructured overlays, t...
Ittai Abraham, Ankur Badola, Danny Bickson, Dahlia...
IDEAL
2004
Springer
16 years 1 months ago
Exploiting Safety Constraints in Fuzzy Self-organising Maps for Safety Critical Applications
This paper defines a constrained Artificial Neural Network (ANN) that can be employed for highly-dependable roles in safety critical applications. The derived model is based upon t...
Zeshan Kurd, Tim P. Kelly, Jim Austin
HICSS
2003
IEEE
94views Biometrics» more  HICSS 2003»
16 years 29 days ago
A Hop Constrained Min-Sum Arborescence with Outage Costs
The hop constrained min-sum arborescence with outage costs problem consists of selecting links in a network so as to connect a set of terminal nodes N={2,3,……n} to a central n...
Rakesh Kawatra