Skip to main content

Learning Automata Representation of Network Protocol by Grammar Induction

  • Conference paper
Web Information Systems and Mining (WISM 2010)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 6318))

Included in the following conference series:

  • 2995 Accesses

Abstract

In this work, the grammatical inference was applied to model network protocol specification as FSM from the network stream data. The original RPNI algorithm merges pairs of states of the prefix tree acceptor of the positive samples in a fixed order assuring consistency of the resulting automaton, which would get a over-generalization automaton. The proposals presented consist in the modification of RPNI algorithm by means of introducing heuristics about network feature that label merging states from the prefix tree acceptor to prevent state from merging excessively. Preliminary experiments done seem to show that the improvement over the original RPNI algorithm is more helpful for deriving the more general network protocol automaton.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Hingston, P.: A genetic algorithm for regular inference. In: Proc. Genetic and Evolutionary Computation Conf., San Francisco, USA, pp. 1299–1306 (2001)

    Google Scholar 

  2. Chomsky, N., Miller, G.A.: Pattern conception. Rapport technique. AFCRC-TN-5757 (ASTIA Document AD 110076) (1957)

    Google Scholar 

  3. Chodorowski, J., Miclet, L.: Applying grammatical inference in learning a language model for oral dialogue. In: Honavar, V.G., Slutzki, G. (eds.) ICGI 1998. LNCS (LNAI), vol. 1433, p. 102. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  4. Oncina, J., Garcia, P.: Inferring regular languages in polynomial update time. Pattern recognition and image analysis: selected papers from the IVth Spanish Symposium, Granada, Spain, 49–61 (1990)

    Google Scholar 

  5. Parekh, R., Honavar, V.: Learning DFA from simple examples. In: Proc. Algorithmic Learning Theory, 8th International Workshop, Sendai, Japan, pp. 116–131 (1997)

    Google Scholar 

  6. Yin, H., Song, D., Manuel, E., Kruegel, C., Kirda, E.: Panorama: Capturing System-Wide Information Flow for Malware Detection and Analysis. In: ACM Conference on Computer and Communications Security, Alexandria, VA (October 2007)

    Google Scholar 

  7. Caballero, J., Song, D.: Polyglot: Automatic Extraction of Protocol Format using Dynamic Binary Analysis. In: ICCS 2007, pp. 317–329 (October 2007)

    Google Scholar 

  8. Comparetti, P.M., Wondracek, G., Kruegel, C., Kirda, E.: Prospex: Protocol Specification Extraction. In: IEEE Symposium on Security and Privacy, IEEE Computer Society Press, USA (May 2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Xiao, MM., Yu, SZ. (2010). Learning Automata Representation of Network Protocol by Grammar Induction. In: Wang, F.L., Gong, Z., Luo, X., Lei, J. (eds) Web Information Systems and Mining. WISM 2010. Lecture Notes in Computer Science, vol 6318. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16515-3_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-16515-3_28

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-16514-6

  • Online ISBN: 978-3-642-16515-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics