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
Fast compression state lookup of Internet packet headers
Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Distance- Spanning Technology.
Luleå University of Technology, Department of Computer Science, Electrical and Space Engineering, Computer Science.
1997 (English)Report (Other academic)
Abstract [en]

The focus of this paper is on the engineering of a work efficient IPv6 header compressor. We introduce a new adaptive data structure, the move-to-root Patricia tree, with favorable properties for this particular application. Considerable effort has been devoted to an efficient implementation in the C programming language, and the incorporation of the data structure with an existing IPv6 header compression implementation for the NetBSD operating system. Experiments performed on a 200 MHz Pentium Pro machine running NetBSD 1.2 show that the data structure gives extremely fast compression state lookup. Our results indicate that we can perform lookup on approximately 100,000 headers per second. Assuming an average packet size of 125 bytes, this translates into a link capacity of 100 Mbits per second. 1. Introduction In today's Internet, a widely used method for increasing the bandwidth utilization is header compression. The header compression algorithm groups packets into flows where the ...

Place, publisher, year, edition, pages
1997. , 10 p.
National Category
Computer Sciences
Research subject
Dependable Communication and Computation Systems
Identifiers
URN: urn:nbn:se:ltu:diva-23289Local ID: 65fe1370-1b4b-11dd-8c59-000ea68e967bOAI: oai:DiVA.org:ltu-23289DiVA: diva2:996338
Note

Godkänd; 1997; Bibliografisk uppgift: Presented at Workshop on Algorithm Engineering, Venice, 11-13 September 1997; 20080506 (ysko)

Available from: 2016-09-29 Created: 2016-09-29 Last updated: 2017-12-15Bibliographically approved

Open Access in DiVA

fulltext(451 kB)7 downloads
File information
File name FULLTEXT01.pdfFile size 451 kBChecksum SHA-512
6be062a43a182bd06093b7e6e56c9d5656322f2302ba2e8ebfa709fa862fcba6396d307e9923eddc9007da7697e5ed1f80727c2f4e84ae8a60db59d645a4c374
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Sundström, Mikael
By organisation
Distance- Spanning TechnologyComputer Science
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar
Total: 7 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

urn-nbn

Altmetric score

urn-nbn
Total: 32 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