Ordered lookup with bypass matching for scalable per-flow classification in layer 4 routers

Ying-Dar Lin; Huan Y. Wei; Kuo J. Wu

doi:10.1016/S0140-3664(00)00305-4

Ordered lookup with bypass matching for scalable per-flow classification in layer 4 routers

Ying-Dar Lin^*, Huan Y. Wei, Kuo J. Wu

^*Corresponding author for this work

Department of Computer Science

Research output: Contribution to journal › Article › peer-review

3 Scopus citations

Abstract

In order to provide different service treatments to individual or aggregated flows, layer 4 routers in Integrated Services networks need to classify packets into different queues. The classification module of layer 4 routers must be fast enough to support gigabit links at a rate of millions of packets per second. In this work, we present a new software method OLBM to lookup multiple fields of a packet, in a dynamically pre-defined order, against the classification database. This algorithm also uses a technique called bypass matching and can classify packets at a rate of well over one million packets per second while scaling to support more than 300k flows. Complexity analysis and experiment measurements are also presented in this study.

Original language	English
Pages (from-to)	667-676
Number of pages	10
Journal	Computer Communications
Volume	24
Issue number	7-8
DOIs	https://doi.org/10.1016/S0140-3664(00)00305-4
State	Published - 1 Apr 2001

Keywords

Classification
Layer 4 router
Lookup
Match
Packet filtering
Scalability

Access to Document

10.1016/S0140-3664(00)00305-4

Fingerprint Dive into the research topics of 'Ordered lookup with bypass matching for scalable per-flow classification in layer 4 routers'. Together they form a unique fingerprint.

Cite this

@article{48e6fe567d474a9c89ef0b65629201c8,

title = "Ordered lookup with bypass matching for scalable per-flow classification in layer 4 routers",

abstract = "In order to provide different service treatments to individual or aggregated flows, layer 4 routers in Integrated Services networks need to classify packets into different queues. The classification module of layer 4 routers must be fast enough to support gigabit links at a rate of millions of packets per second. In this work, we present a new software method OLBM to lookup multiple fields of a packet, in a dynamically pre-defined order, against the classification database. This algorithm also uses a technique called bypass matching and can classify packets at a rate of well over one million packets per second while scaling to support more than 300k flows. Complexity analysis and experiment measurements are also presented in this study.",

keywords = "Classification, Layer 4 router, Lookup, Match, Packet filtering, Scalability",

author = "Ying-Dar Lin and Wei, {Huan Y.} and Wu, {Kuo J.}",

year = "2001",

month = apr,

day = "1",

doi = "10.1016/S0140-3664(00)00305-4",

language = "English",

volume = "24",

pages = "667--676",

journal = "Computer Communications",

issn = "0140-3664",

publisher = "Elsevier",

number = "7-8",

}

TY - JOUR

T1 - Ordered lookup with bypass matching for scalable per-flow classification in layer 4 routers

AU - Lin, Ying-Dar

AU - Wei, Huan Y.

AU - Wu, Kuo J.

PY - 2001/4/1

Y1 - 2001/4/1

N2 - In order to provide different service treatments to individual or aggregated flows, layer 4 routers in Integrated Services networks need to classify packets into different queues. The classification module of layer 4 routers must be fast enough to support gigabit links at a rate of millions of packets per second. In this work, we present a new software method OLBM to lookup multiple fields of a packet, in a dynamically pre-defined order, against the classification database. This algorithm also uses a technique called bypass matching and can classify packets at a rate of well over one million packets per second while scaling to support more than 300k flows. Complexity analysis and experiment measurements are also presented in this study.

AB - In order to provide different service treatments to individual or aggregated flows, layer 4 routers in Integrated Services networks need to classify packets into different queues. The classification module of layer 4 routers must be fast enough to support gigabit links at a rate of millions of packets per second. In this work, we present a new software method OLBM to lookup multiple fields of a packet, in a dynamically pre-defined order, against the classification database. This algorithm also uses a technique called bypass matching and can classify packets at a rate of well over one million packets per second while scaling to support more than 300k flows. Complexity analysis and experiment measurements are also presented in this study.

KW - Classification

KW - Layer 4 router

KW - Lookup

KW - Match

KW - Packet filtering

KW - Scalability

UR - http://www.scopus.com/inward/record.url?scp=0035312772&partnerID=8YFLogxK

U2 - 10.1016/S0140-3664(00)00305-4

DO - 10.1016/S0140-3664(00)00305-4

M3 - Article

AN - SCOPUS:0035312772

VL - 24

SP - 667

EP - 676

JO - Computer Communications

JF - Computer Communications

SN - 0140-3664

IS - 7-8

ER -

Ordered lookup with bypass matching for scalable per-flow classification in layer 4 routers

Abstract

Keywords

Access to Document

Other files and links

Cite this