Loading…

Flow Digest: A State Replication Scheme for Stateful High Availability Cluster

Stateful tracking is a popular technique in firewall filtering and state replication is used to provide reliable connectivity. This paper proposes a new approach for improving existing state replication protocols which ensure state consistency amongst the nodes of a stateful HA cluster. Our goal is...

Full description

Saved in:

Bibliographic Details
Main Authors:	Yi-Hsuan Feng, Nen-Fu Huang, Rong-Tai Liu, Meng-Huan Wu
Format:	Conference Proceeding
Language:	English
Subjects:	Availability Bandwidth Communications Society Information filtering Information filters Information security Protocols Redundancy Scalability Telecommunication traffic
Online Access:	Request full text
Tags:	Add Tag No Tags, Be the first to tag this record!

cited_by
cites
container_end_page	1303
container_issue
container_start_page	1298
container_title
container_volume
creator	Yi-Hsuan Feng Nen-Fu Huang Rong-Tai Liu Meng-Huan Wu
description	Stateful tracking is a popular technique in firewall filtering and state replication is used to provide reliable connectivity. This paper proposes a new approach for improving existing state replication protocols which ensure state consistency amongst the nodes of a stateful HA cluster. Our goal is to develop a new scheme which reduces the update overhead in the face of both low and high connection loads in order to maximize the capacity and scalability of a high availability cluster. A new representation called flow digest is proposed. Also the ways to use flow digest structures to update state changes, recover the connections after a failover, and solve the state inconsistency are presented. The main advantage of the proposed method is to reduce the bandwidth consumption on state replication. The simulation results show that the proposed scheme reduces the number of update messages and, more importantly, eliminates typically at least 86% of bandwidth consumption compared to current solutions.
doi_str_mv	10.1109/ICC.2007.219
format	conference_proceeding
fullrecord	<record><control><sourceid>ieee_CHZPO</sourceid><recordid>TN_cdi_ieee_primary_4288890</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4288890</ieee_id><sourcerecordid>4288890</sourcerecordid><originalsourceid>FETCH-LOGICAL-i241t-de161b38812912e2cda0384d5be21c7971d11145b20afe23060af9bc29b8b7413</originalsourceid><addsrcrecordid>eNotzM1OAjEUQOHGn0REdu7c9AUG773tMK07MoKQEE1E16SduQM1RchM0fD2kuDqLL7kCHGPMEQE-zgvyyEBFENCeyF6aJXJ0Bh1KQa2MKhJa1C5gquT5TlkagTFjbjtui-AnKzCnnidxt2vfA5r7tKTHMtlconlO-9jqFwKu2-5rDa8Zdns2jM2hyhnYb2R4x8XovMhhnSUZTx0ids7cd242PHgv33xOZ18lLNs8fYyL8eLLJDGlNWMI_TKGCSLxFTVDpTRde6ZsCpsgTUi6twTuIZJwehU6yuy3vhCo-qLh_M3MPNq34ata48rTcYYC-oPs55N8w</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Flow Digest: A State Replication Scheme for Stateful High Availability Cluster</title><source>IEEE Xplore All Conference Series</source><creator>Yi-Hsuan Feng ; Nen-Fu Huang ; Rong-Tai Liu ; Meng-Huan Wu</creator><creatorcontrib>Yi-Hsuan Feng ; Nen-Fu Huang ; Rong-Tai Liu ; Meng-Huan Wu</creatorcontrib><description>Stateful tracking is a popular technique in firewall filtering and state replication is used to provide reliable connectivity. This paper proposes a new approach for improving existing state replication protocols which ensure state consistency amongst the nodes of a stateful HA cluster. Our goal is to develop a new scheme which reduces the update overhead in the face of both low and high connection loads in order to maximize the capacity and scalability of a high availability cluster. A new representation called flow digest is proposed. Also the ways to use flow digest structures to update state changes, recover the connections after a failover, and solve the state inconsistency are presented. The main advantage of the proposed method is to reduce the bandwidth consumption on state replication. The simulation results show that the proposed scheme reduces the number of update messages and, more importantly, eliminates typically at least 86% of bandwidth consumption compared to current solutions.</description><identifier>ISSN: 1550-3607</identifier><identifier>ISBN: 9781424403530</identifier><identifier>ISBN: 1424403537</identifier><identifier>EISSN: 1938-1883</identifier><identifier>DOI: 10.1109/ICC.2007.219</identifier><language>eng</language><publisher>IEEE</publisher><subject>Availability ; Bandwidth ; Communications Society ; Information filtering ; Information filters ; Information security ; Protocols ; Redundancy ; Scalability ; Telecommunication traffic</subject><ispartof>2007 IEEE International Conference on Communications, 2007, p.1298-1303</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/4288890$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2051,27904,54533,54898,54910</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/4288890$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Yi-Hsuan Feng</creatorcontrib><creatorcontrib>Nen-Fu Huang</creatorcontrib><creatorcontrib>Rong-Tai Liu</creatorcontrib><creatorcontrib>Meng-Huan Wu</creatorcontrib><title>Flow Digest: A State Replication Scheme for Stateful High Availability Cluster</title><title>2007 IEEE International Conference on Communications</title><addtitle>ICC</addtitle><description>Stateful tracking is a popular technique in firewall filtering and state replication is used to provide reliable connectivity. This paper proposes a new approach for improving existing state replication protocols which ensure state consistency amongst the nodes of a stateful HA cluster. Our goal is to develop a new scheme which reduces the update overhead in the face of both low and high connection loads in order to maximize the capacity and scalability of a high availability cluster. A new representation called flow digest is proposed. Also the ways to use flow digest structures to update state changes, recover the connections after a failover, and solve the state inconsistency are presented. The main advantage of the proposed method is to reduce the bandwidth consumption on state replication. The simulation results show that the proposed scheme reduces the number of update messages and, more importantly, eliminates typically at least 86% of bandwidth consumption compared to current solutions.</description><subject>Availability</subject><subject>Bandwidth</subject><subject>Communications Society</subject><subject>Information filtering</subject><subject>Information filters</subject><subject>Information security</subject><subject>Protocols</subject><subject>Redundancy</subject><subject>Scalability</subject><subject>Telecommunication traffic</subject><issn>1550-3607</issn><issn>1938-1883</issn><isbn>9781424403530</isbn><isbn>1424403537</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2007</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNotzM1OAjEUQOHGn0REdu7c9AUG773tMK07MoKQEE1E16SduQM1RchM0fD2kuDqLL7kCHGPMEQE-zgvyyEBFENCeyF6aJXJ0Bh1KQa2MKhJa1C5gquT5TlkagTFjbjtui-AnKzCnnidxt2vfA5r7tKTHMtlconlO-9jqFwKu2-5rDa8Zdns2jM2hyhnYb2R4x8XovMhhnSUZTx0ids7cd242PHgv33xOZ18lLNs8fYyL8eLLJDGlNWMI_TKGCSLxFTVDpTRde6ZsCpsgTUi6twTuIZJwehU6yuy3vhCo-qLh_M3MPNq34ata48rTcYYC-oPs55N8w</recordid><startdate>200706</startdate><enddate>200706</enddate><creator>Yi-Hsuan Feng</creator><creator>Nen-Fu Huang</creator><creator>Rong-Tai Liu</creator><creator>Meng-Huan Wu</creator><general>IEEE</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope></search><sort><creationdate>200706</creationdate><title>Flow Digest: A State Replication Scheme for Stateful High Availability Cluster</title><author>Yi-Hsuan Feng ; Nen-Fu Huang ; Rong-Tai Liu ; Meng-Huan Wu</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i241t-de161b38812912e2cda0384d5be21c7971d11145b20afe23060af9bc29b8b7413</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2007</creationdate><topic>Availability</topic><topic>Bandwidth</topic><topic>Communications Society</topic><topic>Information filtering</topic><topic>Information filters</topic><topic>Information security</topic><topic>Protocols</topic><topic>Redundancy</topic><topic>Scalability</topic><topic>Telecommunication traffic</topic><toplevel>online_resources</toplevel><creatorcontrib>Yi-Hsuan Feng</creatorcontrib><creatorcontrib>Nen-Fu Huang</creatorcontrib><creatorcontrib>Rong-Tai Liu</creatorcontrib><creatorcontrib>Meng-Huan Wu</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 Explore</collection><collection>IEEE Proceedings Order Plans (POP) 1998-present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Yi-Hsuan Feng</au><au>Nen-Fu Huang</au><au>Rong-Tai Liu</au><au>Meng-Huan Wu</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Flow Digest: A State Replication Scheme for Stateful High Availability Cluster</atitle><btitle>2007 IEEE International Conference on Communications</btitle><stitle>ICC</stitle><date>2007-06</date><risdate>2007</risdate><spage>1298</spage><epage>1303</epage><pages>1298-1303</pages><issn>1550-3607</issn><eissn>1938-1883</eissn><isbn>9781424403530</isbn><isbn>1424403537</isbn><abstract>Stateful tracking is a popular technique in firewall filtering and state replication is used to provide reliable connectivity. This paper proposes a new approach for improving existing state replication protocols which ensure state consistency amongst the nodes of a stateful HA cluster. Our goal is to develop a new scheme which reduces the update overhead in the face of both low and high connection loads in order to maximize the capacity and scalability of a high availability cluster. A new representation called flow digest is proposed. Also the ways to use flow digest structures to update state changes, recover the connections after a failover, and solve the state inconsistency are presented. The main advantage of the proposed method is to reduce the bandwidth consumption on state replication. The simulation results show that the proposed scheme reduces the number of update messages and, more importantly, eliminates typically at least 86% of bandwidth consumption compared to current solutions.</abstract><pub>IEEE</pub><doi>10.1109/ICC.2007.219</doi><tpages>6</tpages></addata></record>
fulltext	fulltext_linktorsrc
identifier	ISSN: 1550-3607
ispartof	2007 IEEE International Conference on Communications, 2007, p.1298-1303
issn	1550-3607 1938-1883
language	eng
recordid	cdi_ieee_primary_4288890
source	IEEE Xplore All Conference Series
subjects	Availability Bandwidth Communications Society Information filtering Information filters Information security Protocols Redundancy Scalability Telecommunication traffic
title	Flow Digest: A State Replication Scheme for Stateful High Availability Cluster
url	http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-26T08%3A44%3A56IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_CHZPO&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Flow%20Digest:%20A%20State%20Replication%20Scheme%20for%20Stateful%20High%20Availability%20Cluster&rft.btitle=2007%20IEEE%20International%20Conference%20on%20Communications&rft.au=Yi-Hsuan%20Feng&rft.date=2007-06&rft.spage=1298&rft.epage=1303&rft.pages=1298-1303&rft.issn=1550-3607&rft.eissn=1938-1883&rft.isbn=9781424403530&rft.isbn_list=1424403537&rft_id=info:doi/10.1109/ICC.2007.219&rft_dat=%3Cieee_CHZPO%3E4288890%3C/ieee_CHZPO%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-i241t-de161b38812912e2cda0384d5be21c7971d11145b20afe23060af9bc29b8b7413%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=4288890&rfr_iscdi=true