Test generation for interaction detection in feature-rich communication systems

Lecture Notes in Computer Science

Volumn 3502, Issue , 2005, Pages 242-257

  Chi, Caixia ^a   Hao, Ruibing ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; FINITE AUTOMATA; INTERNET; NETWORK PROTOCOLS; SPECIFICATIONS; INTERNET PROTOCOLS; INTERNET TELEPHONY; LOGIC CIRCUITS; SOFTWARE TESTING;

FEATURE-RICH COMMUNICATION SYSTEMS; FINITE-STATE MACHINES; INTERACTION DETECTION; TEST GENERATION; CHINESE POSTMAN TOUR; LINK MANAGEMENT PROTOCOL; MINIMUM COST; TEST GENERATIONS; TEST SEQUENCE; TRANSITION GRAPHS;

TELECOMMUNICATION NETWORKS; FEATURE EXTRACTION;

EID: 24944502203     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11430230_17     Document Type: Conference Paper

References (16)

1. Xiaotao Wu, Henning Schulzrinne, "Feature Interactions in Internet Telephony End Systems", Technical Report, Department of Computer Science, Columbia University, January 2004.
2. Caixia Chi, Dong Wang, Ruibing Hao, "A Framework on Feature Interactions in Optical Network Protocols", Feature Interaction Workshop'2003, June 2003.
3. Alfred V.Aho, Anton T.Dahbura, David Lee, and M.Ümit Uyar, "An Optimization Technique for Protocol Conformance Test Generation Based on UIO Sequences and Rural Chinese Postman Tours", IEEE Tran. on Communications, Vol.39,NO.11, Nov.1991, 1604-1615.
4. David Lee, Mihalis Yannakakis, "Principles and Methods of Testing Finite State Machines - A Survey", Proceedings of the IEEE, Vol.84,No.8,August 1996.
5. T.S.Chow,"Testing software design modeled by finite-state machines ",IEEE Trans. Software Eng. Vol.SE-4,No.3,pp.l78-187,1978.
6. K.K.Sabnani and A.T.Dahbura,"A protocol test generation procedure", Computer Networks and ISDN Syst.Vol. 15,No.4,pp285-297,1988.
7. S.Naito and M.Tsunoyama, "Fault detection for sequential machines by transitions tours", in Proc.IEEE Fault Tolerant Comput. Symp.,IEEE Computer Soc.Press,pp.238-243,1981.
8. T. H. Cormen, C. E. Leiserson and R. L. Rivest, Introduction to Algorithms. The MIT Press, 1997.
9. J.A.Bondy and U.S.R.Murty, Graph Theory With Applications. New York: Elsevier North Holland,1976.
10. Gross O. The bottleneck assignment problem: an algorithm. In: Procedings, and Symposium on Mathematical Programming(Wolfe Ped), Rand Publication, 1960,87-88.
11. A.Gibbons, Algorithmic Graph Theory. Cambridge, MA:Cambridge University Press,1985.
12. John de Keijzer, Douglas Tait, and Rob Goedman, "JAIN: a new approach to services in communication networks". IEEE Communications Magazine, 38(1), January 2000.
13. Jonathan Lennox and Henning Schulzrinne, "Feature interaction in Internet telephony", In Feature Interaction in Telecommunications and Software Systems VI, Glasgow, United Kingdom, May 2000.
14. J. Rosenberg, J. Lennox, and Henning Schulzrinne. "Programming Internet telephony services". IEEE Network, 13(3):42C49, May/June 1999.
15. Jonathan P. Lang, "Link Management Protocol (LMP)", Internet draft, draft-ietf-ccamp-lmp-10.txt, October 2003, work in progress.
16. K. Imai, S. Sumino and H. Imai, "Minimax Geometric Fitting of Two Corresponding Sets of Points and Dynamic Furthest Voronoi Diagrams", IEICE Transactions on Information and Systems, Vol.E81-D, No.11 (November 1998), pp.1162-1171.