Diagonal tuple space search: A multidimensional packet classification scheme

Mikko Alutoin, Pertti Raatikainen

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingsScientificpeer-review

1 Citation (Scopus)


The introduction of the quality of service (QoS), policy based routing and security to the Internet implies the need to classify IP packets based on multiple protocol fields. Theory has proved that any general multidimensional look-up algorithm is either time or storage hungry. However, it has been anticipated that more feasible algorithms could be obtained for conflict-free classifiers. This paper studies the implications of the conflict-free constraint for a well-known field in packet classification - the algorithms, which derive from the tuple space paradigm. Also a heuristic packet classification algorithm that makes use of the conflict-free constraint in multidimensional tuple space is introduced.
Original languageEnglish
Title of host publicationProceedings of IEEE Global Telecommunications Conference 2004, Globecom '04
PublisherIEEE Institute of Electrical and Electronic Engineers
ISBN (Print)0-7803-8794-5
Publication statusPublished - 2004
MoE publication typeA4 Article in a conference publication
EventIEEE Global Telecommunications Conference, Globecom 2004 - Dallas, United States
Duration: 29 Nov 20043 Dec 2004


ConferenceIEEE Global Telecommunications Conference, Globecom 2004
CountryUnited States


  • policy based routing
  • packet classification
  • classification algorithm

Fingerprint Dive into the research topics of 'Diagonal tuple space search: A multidimensional packet classification scheme'. Together they form a unique fingerprint.

Cite this