liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Fast and Scalable Classification of Structured Data in the Network
Dept. of Computer Science and Eng. University of Texas at Arlington Arlington, USA.
Dept. of Computer Science and Eng. University of Texas at Arlington Arlington, USA.
Sun Microsystems, Inc. Santa Clara, USA.
Dept. of Computer Science and Eng. University of Texas at Arlington Arlington, USA.
2007 (English)In: NETWORKING 2007. Ad Hoc and Sensor Networks, Wireless Networks, Next Generation Internet: 6th International IFIP-TC6 Networking Conference, Atlanta, GA, USA, May 14-18, 2007. Proceedings / [ed] I.F. Akyildiz et al., Springer Berlin/Heidelberg, 2007, 1026-1036 p.Conference paper, Published paper (Refereed)
Abstract [en]

For many network services, such as firewalling, load balancing, or cryptographic acceleration, data packets need to be classified (or filtered) before network appliances can apply any action processing on them. Typical actions are header manipulations, discarding packets, or tagging packets with additional information required for later processing. Structured data, such as XML, is independent from any particular presentation format and is an ideal information exchange format for a variety of heterogeneous sources. In this paper, we propose a new algorithm for fast and efficient classification of structured data in the network. In our approach, packet processing and classification is performed on structured payload data rather than only packet header information. Using a combination of hash functions, Bloom filter, and set intersection theory our algorithm builds a hierarchical and layered data element tree over the input grammar that requires logarithmic time and tractable space complexity.

Place, publisher, year, edition, pages
Springer Berlin/Heidelberg, 2007. 1026-1036 p.
Series
Lecture Notes in Computer Science, ISSN 0302-9743 (print), 1611-3349 (online) ; 4479
National Category
Computer Science
Identifiers
URN: urn:nbn:se:liu:diva-38182DOI: 10.1007/978-3-540-72606-7_88Local ID: 42325OAI: oai:DiVA.org:liu-38182DiVA: diva2:259031
Conference
6th International IFIP-TC6 Networking Conference, Atlanta, GA, USA, May 14-18, 2007
Available from: 2009-10-10 Created: 2009-10-10 Last updated: 2014-01-31Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full text

Authority records BETA

Schuba, Christoph

Search in DiVA

By author/editor
Schuba, Christoph
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 29 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf