Global convergence in partially fully connected networks (PFCN) with limited relays

IECON Proceedings (Industrial Electronics Conference)

Volumn 1, Issue , 2001, Pages 2022-2025

  Azadmanesh, Azad H ^a   Bajwa, Harinder ^a  

^a UNIVERSITY OF NEBRASKA AT OMAHA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DISTRIBUTED COMPUTER SYSTEMS; FAULT TREE ANALYSIS; INFORMATION THEORY; NETWORK PROTOCOLS; OPTIMIZATION; PERFORMANCE; RELAY CONTROL SYSTEMS; RELIABILITY;

APPROXIMATE AGREEMENT; BYZANTINE FAILURE MODE; BYZANTINE FAULT; COMMUNICATION COST; CONVERGENCE RATE; NODES; PARTIALLY FULLY CONNECTED NETWORKS;

COMPUTER NETWORKS;

EID: 0035695360     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (7)

1. Network convergence in the presence of omission faults
2. Using omissive faults to obtain local convergence in partially connected networks
3. Egocentric voting algorithms
4. Reaching approximate agreement in the presence of faults
5. Reaching approximate agreement with mixed mode faults
6. Low cost approximate agreement in partially connected networks
7. Synchronizing clocks in the presence of faults