Login / Signup

Deterministic Finite Automaton for scalable traffic identification: The power of compressing by range.

Rafael AntonelloStenio F. L. FernandesDjamel SadokJudith KelnerGéza Szabó
Published in: NOMS (2012)
Keyphrases
  • deterministic finite automaton
  • power consumption
  • network traffic
  • lower bound
  • general purpose
  • model checking