Abstract
This paper proposes a technique to generate test sequences to check the conformance of an implementation of a feature-rich communication system to its specification, as well as to detect the interactions between the features of the system. A concept called color span is introduced to measure the extent of the interactions between different features. A modified Chinese postman tour algorithm is proposed to produce an approximate minimum-cost and minimum color span tour of the transition graph of a finite-state machine. Test generation using the proposed algorithm for the SIP-based Internet telephony end system and for the Link Management Protocol are reported.
Chapter PDF
Similar content being viewed by others
References
Wu, X., Schulzrinne, H.: Feature Interactions in Internet Telephony End Systems, Technical Report, Department of Computer Science, Columbia University (January 2004)
Chi, C., Wang, D., Hao, R.: A Framework on Feature Interactions in Optical Network Protocols. In: Feature Interaction Workshop 2003 (June 2003)
Aho, A.V., Dahbura, A.T., Lee, D., Uyar, M.Ü.: An Optimization Technique for Protocol Conformance Test Generation Based on UIO Sequences and Rural Chinese Postman Tours. IEEE Tran. on Communications 39(11), 1604–1615 (1991)
Lee, D., Yannakakis, M.: Principles and Methods of Testing Finite State Machines - A Survey. Proceedings of the IEEE, August 1996, vol. 84(8) (1996)
Chow, T.S.: Testing software design modeled by finite-state machines. IEEE Trans. Software Eng. SE-4(3), 178–187 (1978)
Sabnani, K.K., Dahbura, A.T.: A protocol test generation procedure. Computer Networks and ISDN Syst. 15(4), 285–297 (1988)
Naito, S., Tsunoyama, M.: Fault detection for sequential machines by transitions tours. In: Proc.IEEE Fault Tolerant Comput. Symp., pp. 238–243. IEEE Computer Soc.Press, Los Alamitos (1981)
Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. The MIT Press, Cambridge (1997)
Bondy, J.A., Murty, U.S.R.: Graph Theory With Applications. Elsevier North Holland, New York (1976)
Gross, O.: The bottleneck assignment problem: an algorithm. In: Procedings, and Symposium on Mathematical Programming(Wolfe Ped), pp. 87–88. Rand Publication (1960)
Gibbons, A.: Algorithmic Graph Theory. Cambridge University Press, Cambridge (1985)
de Keijzer, J., Tait, D., Goedman, R.: JAIN: a new approach to services in communication networks. IEEE Communications Magazine 38(1) (January 2000)
Lennox, J., Schulzrinne, H.: Feature interaction in Internet telephony. In: Feature Interaction in Telecommunications and Software Systems VI, Glasgow, United Kingdom (May 2000)
Rosenberg, J., Lennox, J., Schulzrinne, H.: Programming Internet telephony services. IEEE Network 13(3), 42–49 (1999)
Lang, J.P.: Link Management Protocol (LMP). Internet draft, draft-ietf-ccamp-lmp-10.txt, work in progress (October 2003)
Imai, K., Sumino, S., Imai, H.: Minimax Geometric Fitting of Two Corresponding Sets of Points and Dynamic Furthest Voronoi Diagrams. IEICE Transactions on Information and Systems E81-D (11), 1162–1171 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 IFIP International Federation for Information Processing
About this paper
Cite this paper
Chi, C., Hao, R. (2005). Test Generation for Interaction Detection in Feature-Rich Communication Systems. In: Khendek, F., Dssouli, R. (eds) Testing of Communicating Systems. TestCom 2005. Lecture Notes in Computer Science, vol 3502. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11430230_17
Download citation
DOI: https://doi.org/10.1007/11430230_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26054-7
Online ISBN: 978-3-540-32076-0
eBook Packages: Computer ScienceComputer Science (R0)