Optimization problems from feature testing of communication protocols

Author

Lee, David ; Yannakakis, Mihalis

Author_Institution

Bell Labs., Murray Hill, NJ, USA

fYear

1996

fDate

29 Oct-1 Nov 1996

Firstpage

66

Lastpage

75

Abstract

In feature testing of communication protocols, we want to construct a minimal number of tests with a desirable fault coverage. We model the protocols by extended finite state machines and reduce the test generation process to optimization problems on graphs. We study efficient algorithms and their complexity. We report experimental results on real systems, including Personal HandyPhone System, a 5ESS based ISDN wireless system, and 5ESS Intelligent Network Application Protocol

Keywords

ISDN; electronic switching systems; fault diagnosis; finite state machines; graph theory; intelligent networks; land mobile radio; optimisation; protocols; 5ESS Intelligent Network Application Protocol; 5ESS based ISDN wireless system; Personal HandyPhone System; algorithm complexity; communication protocols; efficient algorithms; experimental results; extended finite state machines; fault coverage; feature testing; graphs; optimization problems; test generation process; Automata; Communication systems; Digital audio players; ISDN; Intelligent networks; Performance evaluation; Power system modeling; Protocols; System testing; Telecommunication network reliability;

fLanguage

English

Publisher

ieee

Conference_Titel

Network Protocols, 1996. Proceedings., 1996 International Conference on

Conference_Location

Columbus, OH

Print_ISBN

0-8186-7453-9

Type

conf

DOI

10.1109/ICNP.1996.564905

Filename

564905