Minimizing the number of detectors in distributed poll-based link failure detection and identification

IEEE International Conference on Communications

Volumn 2, Issue , 2005, Pages 875-880

  Lin, Hwa Chun ^a   Wang, Chien Hsing ^a   Tung, Lung Chin ^a  

^a NATIONAL TSING HUA UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; FAILURE ANALYSIS; HEURISTIC METHODS; OPTIMIZATION; PROBLEM SOLVING; ROUTERS; TELECOMMUNICATION NETWORKS;

CRITICAL NETWORK FAULTS; HEURISTIC ALGORITHM; POLL-BASED LINK FAILURE; SNMP TRAPS;

TELECOMMUNICATION LINKS;

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

References (9)

1. R. Barth, "A Davis-Putnam Based Enumeration Algorithm for Linear Pseudo-Boolean Optimization," Technical Report MPI-I-95- 2-003, Max-Planck-Institute far Informatik, January 1995.
2. V. Chv'atal, "A greedy heuristic for the set-covering problem," Mathematics of Operations Research, vol. 4, pp. 233-235, 1979.
3. Van Jacobson, Traceroute source code and documentation. Available from: ftp://ftp.ee.lbl.gov/traceroute.tar.gz
4. RFC 1058, "Routing Information Protocol," C. Hedrick.
5. RFC 1157, "A Simple Network Management Protocol (SNMP)," J. Case, M. Fedor, H. Schoffstall, and J. Davin.
6. RFC 1247, "OSPF Version 2," J. Moy.
7. RFC 1267, "A Border Gateway Protocol 3 (BGP-3)," K. Lougheed, Y. Rekhter.
8. E. W. Zegura, "GT-ITM: Georgia Tech internetwork topology models (software)," 1996, http://www.cc.gatech.edu/projects/gtitm/, http://www.cc.gatech.edu/fac/Ellen.Zegura/gt-itm/gt-itm.tar.gz
9. E. W. Zegura, K. Calvert and M. J. Donahoo, "A Quantitative Comparison of Graph-based Models for Internet Topology", IEEE/ACM Transactions on Networking, December 1997.