Change search
ReferencesLink to record
Permanent link

Direct link
Complexity in header compression
2001 (English)Independent thesis Advanced level (professional degree), 20 credits / 30 HE creditsStudent thesis
Abstract [en]

Future mobile telephony systems will most likely transfer speech data using the Internet Protocol. Due to limited bandwidth in wireless links there is a need for compressing the protocol headers in order to reduce the header overhead. Since a router in the core network will handle many connections and mobile phones have limited hardware the compression algorithm must not be overly complex. In this thesis methods for measuring complexity in header compression algorithms are investigated. These methods are then used to evaluate a few selected header compression algorithms. A new method to calculate the three bit CRC checksum used by the ROCCO and ROHC header compression schemes is presented and is evaluated together with other methods.

Place, publisher, year, edition, pages
2001.
Keyword [en]
Technology, computer communication, header compression, complexity, ROHC, ROCCO, CRTP, ROGER, rdpmc, rdtsc
Keyword [sv]
Teknik
Identifiers
URN: urn:nbn:se:ltu:diva-42529ISRN: LTU-EX--01/162--SELocal ID: 0879117d-4edc-45cc-bf72-6c78232bd233OAI: oai:DiVA.org:ltu-42529DiVA: diva2:1015752
Subject / course
Student thesis, at least 30 credits
Educational program
Computer Science and Engineering, master's level
Examiners
Note
Validerat; 20101217 (root)Available from: 2016-10-04 Created: 2016-10-04Bibliographically approved

Open Access in DiVA

No full text

Search outside of DiVA

GoogleGoogle Scholar

Total: 1 hits
ReferencesLink to record
Permanent link

Direct link