Change search
ReferencesLink to record
Permanent link

Direct link
A new cutting algorithm for the packet classification problem - UpperCuts
2008 (English)Independent thesis Advanced level (professional degree), 20 credits / 30 HE creditsStudent thesis
Abstract [en]

Data sent or received over a public network such as the Internet are categorized into flows, where each flow is an ordered sequence of packets. A packet consists of a header and the data that should be transported. In the packet header, different information is stored in a number of fields. The packet classification problem is to determine to which flow each packet belongs by inspecting the header fields of the packet and comparing them to a list of rules that identify each flow. This report describes an algorithm called UpperCuts that solves the packet classification problem based on an idea called cutting.

Place, publisher, year, edition, pages
Keyword [en]
Keyword [sv]
URN: urn:nbn:se:ltu:diva-54382ISRN: LTU-EX--08/115--SELocal ID: b56a6fd0-6ed6-4341-b1d3-0bceb9083e72OAI: diva2:1027763
Subject / course
Student thesis, at least 30 credits
Educational program
Computer Science and Engineering, master's level
Validerat; 20101217 (root)Available from: 2016-10-04 Created: 2016-10-04Bibliographically approved

Open Access in DiVA

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

Search outside of DiVA

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

ReferencesLink to record
Permanent link

Direct link