Locating faults in a systematic manner in a large heterogeneous network
暂无分享,去创建一个
[1] Richard M. Karp,et al. The Traveling-Salesman Problem and Minimum Spanning Trees , 1970, Oper. Res..
[2] John R. Current,et al. The Covering Salesman Problem , 1989, Transp. Sci..
[3] M. Schwartz,et al. On the Design of Observers for Fault Detection in Communication Networks , 1990 .
[4] Bernard Pagurek,et al. Network diagnosis by reasoning in uncertain nested evidence spaces , 1995, IEEE Trans. Commun..
[5] Mischa Schwartz,et al. Fault Diagnosis of Network Connectivity Problems by Probabilistic Reasoning , 1994 .
[6] Brenda S. Baker,et al. Approximation algorithms for NP-complete problems on planar graphs , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[7] Brian W. Kernighan,et al. An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..
[8] Isabelle Rouvellou,et al. Topology identification for traffic and configuration management in dynamic networks , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.