Analytical model for Binding Refresh Request to reduce storage and communication overhead in MIPv6 network

SUMMARY Home agent is a key component of MIPv6 functionality that comprises binding cache to hold the mobile nodes current point of attachment to the Internet. This paper is concerned with binding cache support for home agents within MIPv6 network. Existing binding cache of home agent supports weak...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International journal of network management 2014-09, Vol.24 (5), p.402-414
Hauptverfasser: A, Avelin Diana, K, Sundarakantham, S, Mercy Shalinie, L, Rajendran
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 414
container_issue 5
container_start_page 402
container_title International journal of network management
container_volume 24
creator A, Avelin Diana
K, Sundarakantham
S, Mercy Shalinie
L, Rajendran
description SUMMARY Home agent is a key component of MIPv6 functionality that comprises binding cache to hold the mobile nodes current point of attachment to the Internet. This paper is concerned with binding cache support for home agents within MIPv6 network. Existing binding cache of home agent supports weak cache consistency by using fixed contract length for Binding Refresh Request, which functions reasonably well in normal situations. However, maintaining a strong binding cache consistency in home agent as a crucial exceptional handling mechanism has become more demanding for the following objectives: (i) to adapt increasingly frequent change of care‐of address due to mobile nodes movement detection update; (ii) to provide fine‐grain controls to balance the binding cache load distributions for better delivery services; and (iii) to reduce the overhead allowances around the binding cache. In this paper, we have first verified the effectiveness of Binding Refresh Request contract length, and on the basis of that, two dynamic contract algorithms are suggested to reduce the storage and communication overhead allowances in binding cache. We have also compared our technique with the existing fixed Binding Refresh Request contract length, and our simulation results reveals that the proposed approach provides an effective performance to reduce overhead within the network. Copyright © 2014 John Wiley & Sons, Ltd. Binding Refresh Request (BRR) is important to maintain binding association between mobile node (MN) and home agent (HA). Time interval between two BRR from HA to MN for a binding determines the contract length. In the proposed approach, dynamic BRR contract length is established for each and every MN record of binding cache to reduce storage and communication overhead in MIPv6 network.
doi_str_mv 10.1002/nem.1871
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1677919297</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1677919297</sourcerecordid><originalsourceid>FETCH-LOGICAL-c3951-11b5a44bb281b4a286c496023b8c3936ca9c3206c4b63f6024c878a1085e590a3</originalsourceid><addsrcrecordid>eNp10F1LwzAUBuAiCuoU_AkBb7ypJv1KcjmHXzCnzImXIU1PZ7Y20aRV9-_NVBQFr07IeXg5vFF0QPAxwTg5MdAeE0bJRrRDMOcxIRxvrt95HlOSse1o1_sFDpRwuhMthkY2q04r2aDWVtCg2jp0qk2lzRxNoXbgH8N87sF3qLPIQdUrQL6zTs4BSVMhZdu2NyGi09Yg-wLuEWSFtEHXV7cvBTLQvVq33Iu2atl42P-ag-j-_Gw2uozHNxdXo-E4VinPSTi4zGWWlWXCSJnJhBUq4wVO0pIFkBZKcpUmOPyWRVqHRaYYZZJglkPOsUwH0dFn7pOzH2eLVnsFTSMN2N4LUlDKCU84DfTwD13Y3oVG1irnDFOO8U-gctZ7B7V4crqVbiUIFuvSRShdrEsPNP6kr7qB1b9OTM6uf3vtO3j79tItRUFTmouHyYWYFrMpndyNBEnfAQH7kNI</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1659807900</pqid></control><display><type>article</type><title>Analytical model for Binding Refresh Request to reduce storage and communication overhead in MIPv6 network</title><source>Wiley Online Library All Journals</source><creator>A, Avelin Diana ; K, Sundarakantham ; S, Mercy Shalinie ; L, Rajendran</creator><creatorcontrib>A, Avelin Diana ; K, Sundarakantham ; S, Mercy Shalinie ; L, Rajendran</creatorcontrib><description>SUMMARY Home agent is a key component of MIPv6 functionality that comprises binding cache to hold the mobile nodes current point of attachment to the Internet. This paper is concerned with binding cache support for home agents within MIPv6 network. Existing binding cache of home agent supports weak cache consistency by using fixed contract length for Binding Refresh Request, which functions reasonably well in normal situations. However, maintaining a strong binding cache consistency in home agent as a crucial exceptional handling mechanism has become more demanding for the following objectives: (i) to adapt increasingly frequent change of care‐of address due to mobile nodes movement detection update; (ii) to provide fine‐grain controls to balance the binding cache load distributions for better delivery services; and (iii) to reduce the overhead allowances around the binding cache. In this paper, we have first verified the effectiveness of Binding Refresh Request contract length, and on the basis of that, two dynamic contract algorithms are suggested to reduce the storage and communication overhead allowances in binding cache. We have also compared our technique with the existing fixed Binding Refresh Request contract length, and our simulation results reveals that the proposed approach provides an effective performance to reduce overhead within the network. Copyright © 2014 John Wiley &amp; Sons, Ltd. Binding Refresh Request (BRR) is important to maintain binding association between mobile node (MN) and home agent (HA). Time interval between two BRR from HA to MN for a binding determines the contract length. In the proposed approach, dynamic BRR contract length is established for each and every MN record of binding cache to reduce storage and communication overhead in MIPv6 network.</description><identifier>ISSN: 1055-7148</identifier><identifier>EISSN: 1099-1190</identifier><identifier>DOI: 10.1002/nem.1871</identifier><language>eng</language><publisher>Chichester: Blackwell Publishing Ltd</publisher><subject>Algorithms ; Allowances ; Binding ; Consistency ; Contracts ; Delivery services ; Dynamics ; Hydroxyapatite ; Networks</subject><ispartof>International journal of network management, 2014-09, Vol.24 (5), p.402-414</ispartof><rights>Copyright © 2014 John Wiley &amp; Sons, Ltd.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c3951-11b5a44bb281b4a286c496023b8c3936ca9c3206c4b63f6024c878a1085e590a3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://onlinelibrary.wiley.com/doi/pdf/10.1002%2Fnem.1871$$EPDF$$P50$$Gwiley$$H</linktopdf><linktohtml>$$Uhttps://onlinelibrary.wiley.com/doi/full/10.1002%2Fnem.1871$$EHTML$$P50$$Gwiley$$H</linktohtml><link.rule.ids>314,776,780,1411,27901,27902,45550,45551</link.rule.ids></links><search><creatorcontrib>A, Avelin Diana</creatorcontrib><creatorcontrib>K, Sundarakantham</creatorcontrib><creatorcontrib>S, Mercy Shalinie</creatorcontrib><creatorcontrib>L, Rajendran</creatorcontrib><title>Analytical model for Binding Refresh Request to reduce storage and communication overhead in MIPv6 network</title><title>International journal of network management</title><addtitle>Int. J. Network Mgmt</addtitle><description>SUMMARY Home agent is a key component of MIPv6 functionality that comprises binding cache to hold the mobile nodes current point of attachment to the Internet. This paper is concerned with binding cache support for home agents within MIPv6 network. Existing binding cache of home agent supports weak cache consistency by using fixed contract length for Binding Refresh Request, which functions reasonably well in normal situations. However, maintaining a strong binding cache consistency in home agent as a crucial exceptional handling mechanism has become more demanding for the following objectives: (i) to adapt increasingly frequent change of care‐of address due to mobile nodes movement detection update; (ii) to provide fine‐grain controls to balance the binding cache load distributions for better delivery services; and (iii) to reduce the overhead allowances around the binding cache. In this paper, we have first verified the effectiveness of Binding Refresh Request contract length, and on the basis of that, two dynamic contract algorithms are suggested to reduce the storage and communication overhead allowances in binding cache. We have also compared our technique with the existing fixed Binding Refresh Request contract length, and our simulation results reveals that the proposed approach provides an effective performance to reduce overhead within the network. Copyright © 2014 John Wiley &amp; Sons, Ltd. Binding Refresh Request (BRR) is important to maintain binding association between mobile node (MN) and home agent (HA). Time interval between two BRR from HA to MN for a binding determines the contract length. In the proposed approach, dynamic BRR contract length is established for each and every MN record of binding cache to reduce storage and communication overhead in MIPv6 network.</description><subject>Algorithms</subject><subject>Allowances</subject><subject>Binding</subject><subject>Consistency</subject><subject>Contracts</subject><subject>Delivery services</subject><subject>Dynamics</subject><subject>Hydroxyapatite</subject><subject>Networks</subject><issn>1055-7148</issn><issn>1099-1190</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2014</creationdate><recordtype>article</recordtype><recordid>eNp10F1LwzAUBuAiCuoU_AkBb7ypJv1KcjmHXzCnzImXIU1PZ7Y20aRV9-_NVBQFr07IeXg5vFF0QPAxwTg5MdAeE0bJRrRDMOcxIRxvrt95HlOSse1o1_sFDpRwuhMthkY2q04r2aDWVtCg2jp0qk2lzRxNoXbgH8N87sF3qLPIQdUrQL6zTs4BSVMhZdu2NyGi09Yg-wLuEWSFtEHXV7cvBTLQvVq33Iu2atl42P-ag-j-_Gw2uozHNxdXo-E4VinPSTi4zGWWlWXCSJnJhBUq4wVO0pIFkBZKcpUmOPyWRVqHRaYYZZJglkPOsUwH0dFn7pOzH2eLVnsFTSMN2N4LUlDKCU84DfTwD13Y3oVG1irnDFOO8U-gctZ7B7V4crqVbiUIFuvSRShdrEsPNP6kr7qB1b9OTM6uf3vtO3j79tItRUFTmouHyYWYFrMpndyNBEnfAQH7kNI</recordid><startdate>201409</startdate><enddate>201409</enddate><creator>A, Avelin Diana</creator><creator>K, Sundarakantham</creator><creator>S, Mercy Shalinie</creator><creator>L, Rajendran</creator><general>Blackwell Publishing Ltd</general><general>Wiley Subscription Services, Inc</general><scope>BSCLL</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>201409</creationdate><title>Analytical model for Binding Refresh Request to reduce storage and communication overhead in MIPv6 network</title><author>A, Avelin Diana ; K, Sundarakantham ; S, Mercy Shalinie ; L, Rajendran</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c3951-11b5a44bb281b4a286c496023b8c3936ca9c3206c4b63f6024c878a1085e590a3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2014</creationdate><topic>Algorithms</topic><topic>Allowances</topic><topic>Binding</topic><topic>Consistency</topic><topic>Contracts</topic><topic>Delivery services</topic><topic>Dynamics</topic><topic>Hydroxyapatite</topic><topic>Networks</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>A, Avelin Diana</creatorcontrib><creatorcontrib>K, Sundarakantham</creatorcontrib><creatorcontrib>S, Mercy Shalinie</creatorcontrib><creatorcontrib>L, Rajendran</creatorcontrib><collection>Istex</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics &amp; Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>International journal of network management</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>A, Avelin Diana</au><au>K, Sundarakantham</au><au>S, Mercy Shalinie</au><au>L, Rajendran</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Analytical model for Binding Refresh Request to reduce storage and communication overhead in MIPv6 network</atitle><jtitle>International journal of network management</jtitle><addtitle>Int. J. Network Mgmt</addtitle><date>2014-09</date><risdate>2014</risdate><volume>24</volume><issue>5</issue><spage>402</spage><epage>414</epage><pages>402-414</pages><issn>1055-7148</issn><eissn>1099-1190</eissn><abstract>SUMMARY Home agent is a key component of MIPv6 functionality that comprises binding cache to hold the mobile nodes current point of attachment to the Internet. This paper is concerned with binding cache support for home agents within MIPv6 network. Existing binding cache of home agent supports weak cache consistency by using fixed contract length for Binding Refresh Request, which functions reasonably well in normal situations. However, maintaining a strong binding cache consistency in home agent as a crucial exceptional handling mechanism has become more demanding for the following objectives: (i) to adapt increasingly frequent change of care‐of address due to mobile nodes movement detection update; (ii) to provide fine‐grain controls to balance the binding cache load distributions for better delivery services; and (iii) to reduce the overhead allowances around the binding cache. In this paper, we have first verified the effectiveness of Binding Refresh Request contract length, and on the basis of that, two dynamic contract algorithms are suggested to reduce the storage and communication overhead allowances in binding cache. We have also compared our technique with the existing fixed Binding Refresh Request contract length, and our simulation results reveals that the proposed approach provides an effective performance to reduce overhead within the network. Copyright © 2014 John Wiley &amp; Sons, Ltd. Binding Refresh Request (BRR) is important to maintain binding association between mobile node (MN) and home agent (HA). Time interval between two BRR from HA to MN for a binding determines the contract length. In the proposed approach, dynamic BRR contract length is established for each and every MN record of binding cache to reduce storage and communication overhead in MIPv6 network.</abstract><cop>Chichester</cop><pub>Blackwell Publishing Ltd</pub><doi>10.1002/nem.1871</doi><tpages>13</tpages></addata></record>
fulltext fulltext
identifier ISSN: 1055-7148
ispartof International journal of network management, 2014-09, Vol.24 (5), p.402-414
issn 1055-7148
1099-1190
language eng
recordid cdi_proquest_miscellaneous_1677919297
source Wiley Online Library All Journals
subjects Algorithms
Allowances
Binding
Consistency
Contracts
Delivery services
Dynamics
Hydroxyapatite
Networks
title Analytical model for Binding Refresh Request to reduce storage and communication overhead in MIPv6 network
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-04T07%3A35%3A55IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Analytical%20model%20for%20Binding%20Refresh%20Request%20to%20reduce%20storage%20and%20communication%20overhead%20in%20MIPv6%20network&rft.jtitle=International%20journal%20of%20network%20management&rft.au=A,%20Avelin%20Diana&rft.date=2014-09&rft.volume=24&rft.issue=5&rft.spage=402&rft.epage=414&rft.pages=402-414&rft.issn=1055-7148&rft.eissn=1099-1190&rft_id=info:doi/10.1002/nem.1871&rft_dat=%3Cproquest_cross%3E1677919297%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1659807900&rft_id=info:pmid/&rfr_iscdi=true