Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
single node failure
Description:
A network resilience condition in which the failure of one network node can disrupt connectivity or service.
Related topics:
Advanced Optical Network Technologies (19%),
Advanced Data Storage Technologies (13%),
Network Traffic and Congestion Control (12%),
Distributed systems and fault tolerance (10%)
OpenAlex ID:
keywords/single-node-failure
Predicting the number of fatal soft errors in Los Alamos national laboratory's ASC Q supercomputer
2005
·
S.E. Michalak
, K.W. Harris
, et al.
·
IEEE Transactions on Device and Materials Reliability
·
187
The Reliable Router: A reliable and high-performance communication substrate for parallel computers
1994
·
William J. Dally
, Larry R. Dennison
, et al.
·
Lecture notes in computer science
·
124
Virtual Network Function placement for resilient Service Chain provisioning
2016
·
Ali Hmaity
, Marco Savi
, et al.
·
International Workshop on Resilient Networks Design and Modeling (RNDM)
·
115
An upper bound on the size of locally recoverable codes
2013
·
Viveck Cadambe
, Arya Mazumdar
·
International Symposium on Network Coding (NetCod)
·
106
PDF
Permutation code: Optimal exact-repair of a single failed node in MDS code based distributed storage systems
2011
·
Viveck R. Cadambe
, Cheng Huang
, et al.
·
IEEE International Symposium on Information Theory (ISIT)
·
103
Quality-of-service and quality-of-protection issues in preplanned recovery schemes using redundant trees
2003
·
Guoliang Xue
, Li Chen
, et al.
·
IEEE Journal on Selected Areas in Communications
·
98
An Internet traffic analysis method with MapReduce
2010
·
Youngseok Lee
, Wonchul Kang
, et al.
·
IEEE/IFIP Network Operations and Management Symposium (NOMS)
·
91
Repair optimal erasure codes through hadamard designs
2011
·
Dimitris S. Papailiopoulos
, Alexandros G. Dimakis
, et al.
·
Allerton Conference on Communication, Control, and Computing
·
81
PDF
An Upper Bound On the Size of Locally Recoverable Codes
·
Viveck Cadambe
, Arya Mazumdar
·
81
Comparisons of purely topological model, betweenness based model and direct current power flow model to analyze power grid vulnerability
2013
·
Min Ouyang
·
Chaos An Interdisciplinary Journal of Nonlinear Science
·
79
IP fast rerouting for single-link/node failure recovery
2007
·
Kang Xi
, H. Jonathan Chao
·
International Conference on Broadband Communications, Networks and Systems (BROADNETS)
·
70
Discrete Cost Multicommodity Network Optimization Problems and Exact Solution Methods
2001
·
Michel Minoux
·
Annals of Operations Research
·
67
The vulnerability of industrial symbiosis: A case study of Qijiang Industrial Park, China
2017
·
Bo Li
, Pengcheng Xiang
, et al.
·
Journal of Cleaner Production
·
64
Efficient Distributed Bandwidth Management for MPLS Fast Reroute
2008
·
Dongmei Wang
, Guangzhi Li
·
IEEE/ACM Transactions on Networking
·
63
A scalable approach for survivable virtual topology routing in optical WDM networks
2007
·
Ajay Todimala
, Byrav Ramamurthy
·
IEEE Journal on Selected Areas in Communications
·
60
Protection strategies for virtual network functions placement and service chains provisioning
2017
·
Ali Hmaity
, Marco Savi
, et al.
·
Networks
·
50
PDF
On optimal monitor placement for localizing node failures via network tomography
2015
·
Liang Ma
, Ting He
, et al.
·
Performance Evaluation
·
49
Complexity of column generation in network design with path‐based survivability mechanisms
2011
·
Sebastian Orlowski
, Michał Pióro
·
Networks
·
49
Scalable Fault-Tolerant Distributed Shared Memory
2000
·
Florin Sultan
, Liviu Iftode
, et al.
·
Conference on High Performance Computing (Supercomputing)
·
45
Lightweight logging for lazy release consistent distributed shared memory
1996
·
Manuel Costa
, Paulo Guedes
, et al.
·
Operating Systems Design and Implementation
·
45
Architecture and implementation of the reliable router
2005
·
W.J. Dally
, L.R. Dennison
, et al.
·
IEEE Symposium on High-Performance Interconnects (HOTI)
·
44
Provisioning fault-tolerant scheduled lightpath demands in WDM mesh networks
2004
·
C.V. Saradhi
, Lian Kian Wei
, et al.
·
International Conference on Broadband Communications, Networks and Systems (BROADNETS)
·
37
Reliable protocols for distributed termination detection
1989
·
S. Venkatesan
·
IEEE Transactions on Reliability
·
37
Fault-tolerant routing in distributed loop networks
1995
·
K. Mukhopadhyaya
, B.P. Sinha
·
IEEE Transactions on Computers
·
36
Wavelength Routing and Assignment in a Survivable WDM Mesh Network
2003
·
Jeffery Kennington
, Eli Olinick
, et al.
·
Operations Research
·
34
Show more works
View as search
Works count:
266
Citation count:
3,236
Year
Topic
Type