SIMPLE FINITE-STATE FAULT DETECTORS FOR COMMUNICATION-NETWORKS

被引：21

作者：

BOULOUTAS, A

HART, GW

SCHWARTZ, M

机构：

[1] COLUMBIA UNIV,CTR TELECOMMUN RES,NEW YORK,NY 10027

[2] COLUMBIA UNIV,DEPT ELECT ENGN,NEW YORK,NY 10027

来源：

IEEE TRANSACTIONS ON COMMUNICATIONS | 1992年 / 40卷 / 03期

基金：

美国国家科学基金会;

关键词：

Finite-State Fault Detectors - Logical Link Control - Minimum Alphabet Detector;

D O I：

10.1109/26.135715

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

This paper provides a framework for approaching the problem of fault detection in communication processes. Communication processes are modeled as finite state machines, and our model consists of two FSM's, one observing part of the behavior of the other. We prove that specific classes of faults are detectable, and give a procedure for constructing detectors, but the design of the minimum alphabet detector is NP-Complete. An example applicable to the 802.2 protocol is provided.

引用

页码：477 / 479

页数：3