Reconfigurable state-machine oriented flow-based router design

Traditional Internet protocol (IP) address lookup is one of the major performance bottlenecks in high-end routers. Prior art has investigated into architectures for flow-based IP address lookup engines based on programmable finite state machines (FSMs), which when implemented in a regular structured...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Hauptverfasser:	Dipnarayan Guha, Seng Kyoun Jo, Doan Huy Cuong, Yang Ok Sik, Jun Kyun Choi, Mitin Kumar, Saurabh Lal
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Automata Chemical technology Context Design optimization Hardware Routing Scheduling Search engines
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

container_end_page	1234 Vol. 2
container_issue
container_start_page	1231
container_title
container_volume
creator	Dipnarayan Guha Seng Kyoun Jo Doan Huy Cuong Yang Ok Sik Jun Kyun Choi Mitin Kumar Saurabh Lal
description	Traditional Internet protocol (IP) address lookup is one of the major performance bottlenecks in high-end routers. Prior art has investigated into architectures for flow-based IP address lookup engines based on programmable finite state machines (FSMs), which when implemented in a regular structured hardware engine, has led to the classical update problem in improving the reprogramming time of each machine and effective scheduling of the individual machines in the context of router database update. This paper describes a distributed co-evolving architecture that looks into the issue of an optimal hardware-software partition for flow-based routing from the viewpoint of memory and resource optimizations
doi_str_mv	10.1109/MWSCAS.2005.1594330
format	Conference Proceeding
fullrecord	<record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_1594330</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1594330</ieee_id><sourcerecordid>1594330</sourcerecordid><originalsourceid>FETCH-LOGICAL-i90t-cbae9eb25e56244d2f186e1185ff2d497f0a878328c25f3c0589a9c6e7c9935d3</originalsourceid><addsrcrecordid>eNotj2tLwzAYhYMXcM79gn3pH0jNtcn7RRjFG0wEN_DjSNM3M9K1knSI_96KgwPPgQcOHEKWnJWcM7h9ed_Uq00pGNMl16CkZGdkxrW2VFqAc7IAY9kUCRwMu_hzanJGVVfkOudPxoQ0HGbk7g390Ie4PybXdFjk0Y1ID85_xB6LIUXsR2yL0A3ftHF5qmk4jpiKFnPc9zfkMrgu4-LEOdk-3G_rJ7p-fXyuV2sagY3UNw4BG6FRV0KpVgRuK-Tc6hBEq8AE5qyxUlgvdJCeaQsOfIXGA0jdyjlZ_s9GRNx9pXhw6Wd3ei5_ARewS4Y</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Reconfigurable state-machine oriented flow-based router design</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Dipnarayan Guha ; Seng Kyoun Jo ; Doan Huy Cuong ; Yang Ok Sik ; Jun Kyun Choi ; Mitin Kumar ; Saurabh Lal</creator><creatorcontrib>Dipnarayan Guha ; Seng Kyoun Jo ; Doan Huy Cuong ; Yang Ok Sik ; Jun Kyun Choi ; Mitin Kumar ; Saurabh Lal</creatorcontrib><description>Traditional Internet protocol (IP) address lookup is one of the major performance bottlenecks in high-end routers. Prior art has investigated into architectures for flow-based IP address lookup engines based on programmable finite state machines (FSMs), which when implemented in a regular structured hardware engine, has led to the classical update problem in improving the reprogramming time of each machine and effective scheduling of the individual machines in the context of router database update. This paper describes a distributed co-evolving architecture that looks into the issue of an optimal hardware-software partition for flow-based routing from the viewpoint of memory and resource optimizations</description><identifier>ISSN: 1548-3746</identifier><identifier>ISBN: 9780780391970</identifier><identifier>ISBN: 0780391977</identifier><identifier>EISSN: 1558-3899</identifier><identifier>DOI: 10.1109/MWSCAS.2005.1594330</identifier><language>eng</language><publisher>IEEE</publisher><subject>Automata ; Chemical technology ; Context ; Design optimization ; Hardware ; Routing ; Scheduling ; Search engines</subject><ispartof>48th Midwest Symposium on Circuits and Systems, 2005, 2005, p.1231-1234 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/1594330$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,4050,4051,27925,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1594330$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Dipnarayan Guha</creatorcontrib><creatorcontrib>Seng Kyoun Jo</creatorcontrib><creatorcontrib>Doan Huy Cuong</creatorcontrib><creatorcontrib>Yang Ok Sik</creatorcontrib><creatorcontrib>Jun Kyun Choi</creatorcontrib><creatorcontrib>Mitin Kumar</creatorcontrib><creatorcontrib>Saurabh Lal</creatorcontrib><title>Reconfigurable state-machine oriented flow-based router design</title><title>48th Midwest Symposium on Circuits and Systems, 2005</title><addtitle>MWSCAS</addtitle><description>Traditional Internet protocol (IP) address lookup is one of the major performance bottlenecks in high-end routers. Prior art has investigated into architectures for flow-based IP address lookup engines based on programmable finite state machines (FSMs), which when implemented in a regular structured hardware engine, has led to the classical update problem in improving the reprogramming time of each machine and effective scheduling of the individual machines in the context of router database update. This paper describes a distributed co-evolving architecture that looks into the issue of an optimal hardware-software partition for flow-based routing from the viewpoint of memory and resource optimizations</description><subject>Automata</subject><subject>Chemical technology</subject><subject>Context</subject><subject>Design optimization</subject><subject>Hardware</subject><subject>Routing</subject><subject>Scheduling</subject><subject>Search engines</subject><issn>1548-3746</issn><issn>1558-3899</issn><isbn>9780780391970</isbn><isbn>0780391977</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2005</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotj2tLwzAYhYMXcM79gn3pH0jNtcn7RRjFG0wEN_DjSNM3M9K1knSI_96KgwPPgQcOHEKWnJWcM7h9ed_Uq00pGNMl16CkZGdkxrW2VFqAc7IAY9kUCRwMu_hzanJGVVfkOudPxoQ0HGbk7g390Ie4PybXdFjk0Y1ID85_xB6LIUXsR2yL0A3ftHF5qmk4jpiKFnPc9zfkMrgu4-LEOdk-3G_rJ7p-fXyuV2sagY3UNw4BG6FRV0KpVgRuK-Tc6hBEq8AE5qyxUlgvdJCeaQsOfIXGA0jdyjlZ_s9GRNx9pXhw6Wd3ei5_ARewS4Y</recordid><startdate>2005</startdate><enddate>2005</enddate><creator>Dipnarayan Guha</creator><creator>Seng Kyoun Jo</creator><creator>Doan Huy Cuong</creator><creator>Yang Ok Sik</creator><creator>Jun Kyun Choi</creator><creator>Mitin Kumar</creator><creator>Saurabh Lal</creator><general>IEEE</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope></search><sort><creationdate>2005</creationdate><title>Reconfigurable state-machine oriented flow-based router design</title><author>Dipnarayan Guha ; Seng Kyoun Jo ; Doan Huy Cuong ; Yang Ok Sik ; Jun Kyun Choi ; Mitin Kumar ; Saurabh Lal</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i90t-cbae9eb25e56244d2f186e1185ff2d497f0a878328c25f3c0589a9c6e7c9935d3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2005</creationdate><topic>Automata</topic><topic>Chemical technology</topic><topic>Context</topic><topic>Design optimization</topic><topic>Hardware</topic><topic>Routing</topic><topic>Scheduling</topic><topic>Search engines</topic><toplevel>online_resources</toplevel><creatorcontrib>Dipnarayan Guha</creatorcontrib><creatorcontrib>Seng Kyoun Jo</creatorcontrib><creatorcontrib>Doan Huy Cuong</creatorcontrib><creatorcontrib>Yang Ok Sik</creatorcontrib><creatorcontrib>Jun Kyun Choi</creatorcontrib><creatorcontrib>Mitin Kumar</creatorcontrib><creatorcontrib>Saurabh Lal</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan (POP) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP) 1998-present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Dipnarayan Guha</au><au>Seng Kyoun Jo</au><au>Doan Huy Cuong</au><au>Yang Ok Sik</au><au>Jun Kyun Choi</au><au>Mitin Kumar</au><au>Saurabh Lal</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Reconfigurable state-machine oriented flow-based router design</atitle><btitle>48th Midwest Symposium on Circuits and Systems, 2005</btitle><stitle>MWSCAS</stitle><date>2005</date><risdate>2005</risdate><spage>1231</spage><epage>1234 Vol. 2</epage><pages>1231-1234 Vol. 2</pages><issn>1548-3746</issn><eissn>1558-3899</eissn><isbn>9780780391970</isbn><isbn>0780391977</isbn><abstract>Traditional Internet protocol (IP) address lookup is one of the major performance bottlenecks in high-end routers. Prior art has investigated into architectures for flow-based IP address lookup engines based on programmable finite state machines (FSMs), which when implemented in a regular structured hardware engine, has led to the classical update problem in improving the reprogramming time of each machine and effective scheduling of the individual machines in the context of router database update. This paper describes a distributed co-evolving architecture that looks into the issue of an optimal hardware-software partition for flow-based routing from the viewpoint of memory and resource optimizations</abstract><pub>IEEE</pub><doi>10.1109/MWSCAS.2005.1594330</doi></addata></record>
fulltext	fulltext_linktorsrc
identifier	ISSN: 1548-3746
ispartof	48th Midwest Symposium on Circuits and Systems, 2005, 2005, p.1231-1234 Vol. 2
issn	1548-3746 1558-3899
language	eng
recordid	cdi_ieee_primary_1594330
source	IEEE Electronic Library (IEL) Conference Proceedings
subjects	Automata Chemical technology Context Design optimization Hardware Routing Scheduling Search engines
title	Reconfigurable state-machine oriented flow-based router design
url	https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-29T00%3A56%3A15IST&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=Reconfigurable%20state-machine%20oriented%20flow-based%20router%20design&rft.btitle=48th%20Midwest%20Symposium%20on%20Circuits%20and%20Systems,%202005&rft.au=Dipnarayan%20Guha&rft.date=2005&rft.spage=1231&rft.epage=1234%20Vol.%202&rft.pages=1231-1234%20Vol.%202&rft.issn=1548-3746&rft.eissn=1558-3899&rft.isbn=9780780391970&rft.isbn_list=0780391977&rft_id=info:doi/10.1109/MWSCAS.2005.1594330&rft_dat=%3Cieee_6IE%3E1594330%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=1594330&rfr_iscdi=true