An Improvement of IP Address Lookup based on Rule Filter Analysis

Keissy Guerra Perez; Xin Yang; Sakir Sezer

doi:10.1109/ICCW.2014.6881279

An Improvement of IP Address Lookup based on Rule Filter Analysis

Keissy Guerra Perez, Xin Yang, Sakir Sezer

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

1 Citation (Scopus)

432 Downloads (Pure)

Abstract

Multi-bit trie is a popular approach performing the longest prefix matching for packet classification. However, it requires a long lookup time and inefficiently consumes memory space. This paper presents an in-depth study of different variations of multi-bit trie for IP address lookup. Our main aim is to study a method of data structure which reduces memory space. The proposed approach has been implemented using the label method in two approaches. Both methods present better results regarding lookup speed, update time and memory bit consumptions.

Original language	English
Title of host publication	2014 IEEE International Conference on Communications Workshops (ICC)
Publisher	IEEE Computer Society
Pages	688-693
Number of pages	6
DOIs	https://doi.org/10.1109/ICCW.2014.6881279
Publication status	Published - Jun 2014
Event	2014 IEEE International Conference on Communications (ICC) - Sydney, Australia Duration: 10 Jun 2014 → 14 Jun 2014

Conference

Conference	2014 IEEE International Conference on Communications (ICC)
Country/Territory	Australia
City	Sydney
Period	10/06/2014 → 14/06/2014

Access to Document

10.1109/ICCW.2014.6881279

An improvement of IP address lookup based on rule filter analysis
© 2014 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
Accepted author manuscript, 473 KB

1 Finished

R1118ECI: Centre for Secure Information Technologies (CSIT)
McCanny, J. V., Cowan, C., Crookes, D., Fusco, V., Linton, D., Liu, W., Miller, P., O'Neill, M., Scanlon, W. & Sezer, S.
01/08/2009 → 30/06/2014
Project: Research

Cite this

@inproceedings{37d3b5aa5d624ffd908e8a64fd793e67,

title = "An Improvement of IP Address Lookup based on Rule Filter Analysis",

abstract = "Multi-bit trie is a popular approach performing the longest prefix matching for packet classification. However, it requires a long lookup time and inefficiently consumes memory space. This paper presents an in-depth study of different variations of multi-bit trie for IP address lookup. Our main aim is to study a method of data structure which reduces memory space. The proposed approach has been implemented using the label method in two approaches. Both methods present better results regarding lookup speed, update time and memory bit consumptions.",

author = "{Guerra Perez}, Keissy and Xin Yang and Sakir Sezer",

year = "2014",

month = jun,

doi = "10.1109/ICCW.2014.6881279",

language = "English",

pages = "688--693",

booktitle = "2014 IEEE International Conference on Communications Workshops (ICC)",

publisher = "IEEE Computer Society",

note = "2014 IEEE International Conference on Communications (ICC) ; Conference date: 10-06-2014 Through 14-06-2014",

}

TY - GEN

T1 - An Improvement of IP Address Lookup based on Rule Filter Analysis

AU - Guerra Perez, Keissy

AU - Yang, Xin

AU - Sezer, Sakir

PY - 2014/6

Y1 - 2014/6

N2 - Multi-bit trie is a popular approach performing the longest prefix matching for packet classification. However, it requires a long lookup time and inefficiently consumes memory space. This paper presents an in-depth study of different variations of multi-bit trie for IP address lookup. Our main aim is to study a method of data structure which reduces memory space. The proposed approach has been implemented using the label method in two approaches. Both methods present better results regarding lookup speed, update time and memory bit consumptions.

AB - Multi-bit trie is a popular approach performing the longest prefix matching for packet classification. However, it requires a long lookup time and inefficiently consumes memory space. This paper presents an in-depth study of different variations of multi-bit trie for IP address lookup. Our main aim is to study a method of data structure which reduces memory space. The proposed approach has been implemented using the label method in two approaches. Both methods present better results regarding lookup speed, update time and memory bit consumptions.

U2 - 10.1109/ICCW.2014.6881279

DO - 10.1109/ICCW.2014.6881279

M3 - Conference contribution

SP - 688

EP - 693

BT - 2014 IEEE International Conference on Communications Workshops (ICC)

PB - IEEE Computer Society

T2 - 2014 IEEE International Conference on Communications (ICC)

Y2 - 10 June 2014 through 14 June 2014

ER -

An Improvement of IP Address Lookup based on Rule Filter Analysis

Abstract

Conference

Access to Document

Fingerprint

Projects

R1118ECI: Centre for Secure Information Technologies (CSIT)

Cite this