IPv6 packet classification based on flow label, source and destination addresses

Packet classification is important for supporting multi-field packet routing, quality of service (QoS), real-time data streaming applications and firewalls. Existing schemes in IPv4 uses the 5-tuple approach, giving much overhead in the dataplane processing. With the introduction of IPv6 flow label...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Poh, E.C.K., Ewe, H.T.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 664 vol.2
container_issue
container_start_page 659
container_title
container_volume 2
creator Poh, E.C.K.
Ewe, H.T.
description Packet classification is important for supporting multi-field packet routing, quality of service (QoS), real-time data streaming applications and firewalls. Existing schemes in IPv4 uses the 5-tuple approach, giving much overhead in the dataplane processing. With the introduction of IPv6 flow label field which facilitates labeling of packets belonging to the same flow; classification can now be done using the 3-tuple approach. In this paper, we propose 3-tuple packet classification algorithm using hierarchical-trie data structure that has low storage requirement and optimum search speed. Packet filters are evaluated based on hierarchical approach, starting from flow label followed by source and destination addresses. A hashing model with collision resolution for addresses that minimizes memory consumption is also being described. The time complexity of the lookup process is bounded by the length of header fields and is independent of the trie size.
doi_str_mv 10.1109/ICITA.2005.165
format Conference Proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_1489043</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1489043</ieee_id><sourcerecordid>1489043</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-dae726bbb704ec7d4afb6170f86578190f2926b0a8d81db700524f44d94aeae93</originalsourceid><addsrcrecordid>eNotjE1LxDAURQMiqONs3bjJD7A1L81HsxyKOoUBZzGuh5fmBaK1HZqq-O8tjHdzL5zDZewORAkg3GPbtIdNKYXQJRh9wW6ENU7LCgxcsXXO72JJ5TQ4ec327f7b8BN2HzTzrsecU0wdzmkcuMdMgS8j9uMP79FT_8Dz-DV1xHEIPFCe03B2MYSJcqZ8yy4j9pnW_71ib89Ph2Zb7F5f2mazKxJYPRcByUrjvbdCUWeDwugNWBFro20NTkTpFi6wDjWExRJaqqhUcAoJyVUrdn_-TUR0PE3pE6ffI6jaCVVVf5leTOY</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>IPv6 packet classification based on flow label, source and destination addresses</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Poh, E.C.K. ; Ewe, H.T.</creator><creatorcontrib>Poh, E.C.K. ; Ewe, H.T.</creatorcontrib><description>Packet classification is important for supporting multi-field packet routing, quality of service (QoS), real-time data streaming applications and firewalls. Existing schemes in IPv4 uses the 5-tuple approach, giving much overhead in the dataplane processing. With the introduction of IPv6 flow label field which facilitates labeling of packets belonging to the same flow; classification can now be done using the 3-tuple approach. In this paper, we propose 3-tuple packet classification algorithm using hierarchical-trie data structure that has low storage requirement and optimum search speed. Packet filters are evaluated based on hierarchical approach, starting from flow label followed by source and destination addresses. A hashing model with collision resolution for addresses that minimizes memory consumption is also being described. The time complexity of the lookup process is bounded by the length of header fields and is independent of the trie size.</description><identifier>ISBN: 0769523161</identifier><identifier>ISBN: 9780769523163</identifier><identifier>DOI: 10.1109/ICITA.2005.165</identifier><language>eng</language><publisher>IEEE</publisher><subject>Classification algorithms ; Data structures ; Information technology ; Labeling ; Matched filters ; Quality of service ; Routing ; Streaming media ; Traffic control ; Transport protocols</subject><ispartof>Third International Conference on Information Technology and Applications (ICITA'05), 2005, Vol.2, p.659-664 vol.2</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/1489043$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2052,4036,4037,27902,54895</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1489043$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Poh, E.C.K.</creatorcontrib><creatorcontrib>Ewe, H.T.</creatorcontrib><title>IPv6 packet classification based on flow label, source and destination addresses</title><title>Third International Conference on Information Technology and Applications (ICITA'05)</title><addtitle>ICITA</addtitle><description>Packet classification is important for supporting multi-field packet routing, quality of service (QoS), real-time data streaming applications and firewalls. Existing schemes in IPv4 uses the 5-tuple approach, giving much overhead in the dataplane processing. With the introduction of IPv6 flow label field which facilitates labeling of packets belonging to the same flow; classification can now be done using the 3-tuple approach. In this paper, we propose 3-tuple packet classification algorithm using hierarchical-trie data structure that has low storage requirement and optimum search speed. Packet filters are evaluated based on hierarchical approach, starting from flow label followed by source and destination addresses. A hashing model with collision resolution for addresses that minimizes memory consumption is also being described. The time complexity of the lookup process is bounded by the length of header fields and is independent of the trie size.</description><subject>Classification algorithms</subject><subject>Data structures</subject><subject>Information technology</subject><subject>Labeling</subject><subject>Matched filters</subject><subject>Quality of service</subject><subject>Routing</subject><subject>Streaming media</subject><subject>Traffic control</subject><subject>Transport protocols</subject><isbn>0769523161</isbn><isbn>9780769523163</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2005</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotjE1LxDAURQMiqONs3bjJD7A1L81HsxyKOoUBZzGuh5fmBaK1HZqq-O8tjHdzL5zDZewORAkg3GPbtIdNKYXQJRh9wW6ENU7LCgxcsXXO72JJ5TQ4ec327f7b8BN2HzTzrsecU0wdzmkcuMdMgS8j9uMP79FT_8Dz-DV1xHEIPFCe03B2MYSJcqZ8yy4j9pnW_71ib89Ph2Zb7F5f2mazKxJYPRcByUrjvbdCUWeDwugNWBFro20NTkTpFi6wDjWExRJaqqhUcAoJyVUrdn_-TUR0PE3pE6ffI6jaCVVVf5leTOY</recordid><startdate>2005</startdate><enddate>2005</enddate><creator>Poh, E.C.K.</creator><creator>Ewe, H.T.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>2005</creationdate><title>IPv6 packet classification based on flow label, source and destination addresses</title><author>Poh, E.C.K. ; Ewe, H.T.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-dae726bbb704ec7d4afb6170f86578190f2926b0a8d81db700524f44d94aeae93</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2005</creationdate><topic>Classification algorithms</topic><topic>Data structures</topic><topic>Information technology</topic><topic>Labeling</topic><topic>Matched filters</topic><topic>Quality of service</topic><topic>Routing</topic><topic>Streaming media</topic><topic>Traffic control</topic><topic>Transport protocols</topic><toplevel>online_resources</toplevel><creatorcontrib>Poh, E.C.K.</creatorcontrib><creatorcontrib>Ewe, H.T.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Poh, E.C.K.</au><au>Ewe, H.T.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>IPv6 packet classification based on flow label, source and destination addresses</atitle><btitle>Third International Conference on Information Technology and Applications (ICITA'05)</btitle><stitle>ICITA</stitle><date>2005</date><risdate>2005</risdate><volume>2</volume><spage>659</spage><epage>664 vol.2</epage><pages>659-664 vol.2</pages><isbn>0769523161</isbn><isbn>9780769523163</isbn><abstract>Packet classification is important for supporting multi-field packet routing, quality of service (QoS), real-time data streaming applications and firewalls. Existing schemes in IPv4 uses the 5-tuple approach, giving much overhead in the dataplane processing. With the introduction of IPv6 flow label field which facilitates labeling of packets belonging to the same flow; classification can now be done using the 3-tuple approach. In this paper, we propose 3-tuple packet classification algorithm using hierarchical-trie data structure that has low storage requirement and optimum search speed. Packet filters are evaluated based on hierarchical approach, starting from flow label followed by source and destination addresses. A hashing model with collision resolution for addresses that minimizes memory consumption is also being described. The time complexity of the lookup process is bounded by the length of header fields and is independent of the trie size.</abstract><pub>IEEE</pub><doi>10.1109/ICITA.2005.165</doi></addata></record>
fulltext fulltext_linktorsrc
identifier ISBN: 0769523161
ispartof Third International Conference on Information Technology and Applications (ICITA'05), 2005, Vol.2, p.659-664 vol.2
issn
language eng
recordid cdi_ieee_primary_1489043
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Classification algorithms
Data structures
Information technology
Labeling
Matched filters
Quality of service
Routing
Streaming media
Traffic control
Transport protocols
title IPv6 packet classification based on flow label, source and destination addresses
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-20T10%3A44%3A41IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=IPv6%20packet%20classification%20based%20on%20flow%20label,%20source%20and%20destination%20addresses&rft.btitle=Third%20International%20Conference%20on%20Information%20Technology%20and%20Applications%20(ICITA'05)&rft.au=Poh,%20E.C.K.&rft.date=2005&rft.volume=2&rft.spage=659&rft.epage=664%20vol.2&rft.pages=659-664%20vol.2&rft.isbn=0769523161&rft.isbn_list=9780769523163&rft_id=info:doi/10.1109/ICITA.2005.165&rft_dat=%3Cieee_6IE%3E1489043%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=1489043&rfr_iscdi=true