Special Issue: Computer Networks and Distributed Computing

• Articles • Previous Articles     Next Articles

Detecting and Locating Failures in Communication Networks

Shi Weigeng;   

  1. Department of Electrical Engineering Worcester Polytechnic Institute; U.S.A.;
  • Online:1990-05-10 Published:1990-05-10

The connectivity of a strongly connected network may be destroyed after link damage.Since many net- works are connected by directed links,the reachability may be restored by altering the direction of one or more of the links and thus reconfigoring the network.The location of the failed link must first be determined.In this paper,we examine new methods to determine the location of failed links and nodes in networks.A routing test approach is proposed and the conditions under which communication networks may …

Key words: data streams; Naïve Bayes; random decision trees; mobile processes; л-calculus; bisimulation; decision procedure;



[1] J.H.Saltzer and K.T.Pograra, A starshaped ring network with high maintainability, Proc. Local Area Commtnication Network Symp., 179-190, Mitre Corp., May 1979.

[2] M.T.Liu, Distributed loop computer networks, Advances in Computers, 17 (1978),162-221.

[3] J.Wolf, M.T.Liu, B.Weide and D.Tsay, Design of a Distributed Fault-Tolerant Loop Networks, Proc. 9th Annu. Int Symp. Fault-Tolerant Computing, 17-24. Madison, WJ, June 1979.

[4] A.Grnarov, L.Kleinrock and M.Gerla. A Highly Reliable Distributed Loop Network Architecture, Proc. Int Symp. Fault-Tolerant Computing,319-324, Kyoto, Japan,Oct.1980.

[5] C.S.Raghavendra, M.Gerla and A.Avizienis, Reliable loop topologies for large local computer networks, IEEE Trunsactions on Computers, C-34:1 (1985), 46-55. ……….
[1] Li-Li Xu, Hui-Min Lin. Complete Proof Systems for Amortised Probabilistic Bisimulations [J]. , 2016, 31(2): 300-316.
[2] Yan-Fang Ma and Min Zhang. The Infinite Evolution Mechanism of ε-Bisimilarity [J]. , 2013, 28(6): 1097-1105.
[3] Xian Xu. Expressing First-Order pi-Calculus in Higher-Order Calculus of Communicating Systems [J]. , 2009, 24(1 ): 122-137 .
[4] Yu-Bao Liu, Jia-Rong Cai, Jian Yin, and Ada Wai-Chee Fu. Clustering Text Data Streams [J]. , 2008, 23(1): 112-128 .
[5] Xue-Gang Hu, Pei-Pei Li, Xin-Dong Wu, and Gong-Qing Wu. A semi-random multiple decision-tree algorithm for mining data streams [J]. , 2007, 22(5): 711-724 .
[6] Xiao-Ju Dong and Yu-Xi Fu. Barbed Congruence of Asymmetry and Mismatch [J]. , 2007, 22(4): 575-579 .
[7] Zhi-Hong Chong, Jeffrey Xu Yu, Zhen-Jie Zhang, Xue-Min Lin, Wei Wang, and Ao-Ying Zhou. Efficient Computation of k-Medians over Data Streams Under Memory Constraints [J]. , 2006, 21(2): 284-296 .
[8] Joong Hyuk Chang and Won Suk Lee. Effect of Count Estimation in Finding Frequent Itemsets over Online Transactional Data Streams [J]. , 2005, 20(1): 0-0.
[9] Yuan Feng and Ming-Sheng Ying. Process Algebra Approach to Reasoning About Concurrent Actions [J]. , 2004, 19(3): 0-0.
[10] Yong-Jian Li and Xin-Xin Liu. Towards a Theory of Bisimulation for the Higher-Order Process Calculi [J]. , 2004, 19(3): 0-0.
[11] LIN Huimin;. Computing Bisimulations for Finite-Controlπ-Calculus [J]. , 2000, 15(1): 1-9.
[12] Fu Yuxi;. Symmetric π-Calculus [J]. , 1998, 13(3): 202-208.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!

ISSN 1000-9000(Print)

         1860-4749(Online)
CN 11-2296/TP

Home
Editorial Board
Author Guidelines
Subscription
Journal of Computer Science and Technology
Institute of Computing Technology, Chinese Academy of Sciences
P.O. Box 2704, Beijing 100190 P.R. China
Tel.:86-10-62610746
E-mail: jcst@ict.ac.cn
 
  Copyright ©2015 JCST, All Rights Reserved