Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • 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
Efficient multi-field packet classification for QoS purposes
Telia Research AB.
Telia Research AB.
Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
1999 (English)In: 1999 Seventh International Workshop on Quality of Service: IWQoS '99, London, England, May 31 - June 4, 1999, Piscataway, NJ: IEEE Communications Society, 1999, 109-118 p.Conference paper, Published paper (Refereed)
Abstract [en]

Mechanisms for service differentiation in datagram networks, such as the Internet, rely on packet classification in routers to provide appropriate service. Classification involves matching multiple packet header fields against a possibly large set of filters identifying the different service classes. In this paper, we describe a packet classifier based on tries and binomial trees and we investigate its scaling properties in three QoS scenarios that are likely to occur in the Internet. One scenario is based on integrated services and RSVP and the other two are based on differentiated services. By performing a series of tests, we characterize the processing and memory requirements for a software implementation of our classifier. Evaluation is done using real data sets taken from two existing high-speed networks. Results from the IntServ/RSVP tests on a Pentium 200 MHz show that it takes about 10.5 μs per packet and requires 2000 KBytes of memory to classify among 11000 entries. Classification for a virtual leased line service based on DiffServ with the same number of entries takes about 9 μs per packet and uses less than 250 KBytes of memory. With an average packet size of 2000 bits, our classifier can manage data rates of about 200 Mbit/s on a 200 MHz Pentium. We conclude that multi-field classification is feasible in software and that high-performance classifiers can run on low-cost hardware

Place, publisher, year, edition, pages
Piscataway, NJ: IEEE Communications Society, 1999. 109-118 p.
National Category
Computer Sciences
Research subject
Dependable Communication and Computation Systems
Identifiers
URN: urn:nbn:se:ltu:diva-28166DOI: 10.1109/IWQOS.1999.766484Local ID: 1ddd1850-fca3-11dc-a946-000ea68e967bISBN: 0-7803-5671-3 (print)OAI: oai:DiVA.org:ltu-28166DiVA: diva2:1001361
Conference
International IWQoS conference : 01/06/1999 - 04/06/1999
Note
Godkänd; 1999; 20080328 (ysko)Available from: 2016-09-30 Created: 2016-09-30 Last updated: 2017-11-25Bibliographically approved

Open Access in DiVA

fulltext(1028 kB)16 downloads
File information
File name FULLTEXT01.pdfFile size 1028 kBChecksum SHA-512
a8908c66f59fa65c9551e56dc570345d79150575ed0d0ad6f586928f56b95463da7dc0c55b2edafe931c3d68b49c1dfe91a4edd830b8fbcb97f8732490ef1575
Type fulltextMimetype application/pdf

Other links

Publisher's full text

Search in DiVA

By author/editor
Schelén, Olov
By organisation
Computer Science
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar
Total: 16 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
isbn
urn-nbn

Altmetric score

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

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • 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