Loading…
Caching Locator/ID mappings: An experimental scalability analysis and its implications
Victim of its own success, the current Internet is facing scalability issues that lead the research community to explore alternative architectures. In particular, the Locator/ID Split paradigm, based on the idea of separating the identity from the location of end-systems, is gaining momentum and see...
Saved in:
Published in: | Computer networks (Amsterdam, Netherlands : 1999) Netherlands : 1999), 2013-03, Vol.57 (4), p.897-909 |
---|---|
Main Authors: | , , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
cited_by | cdi_FETCH-LOGICAL-c364t-d8647328988edd8cdb02e6d379b767f498a1773c3f67f3514d53b515491078093 |
---|---|
cites | cdi_FETCH-LOGICAL-c364t-d8647328988edd8cdb02e6d379b767f498a1773c3f67f3514d53b515491078093 |
container_end_page | 909 |
container_issue | 4 |
container_start_page | 897 |
container_title | Computer networks (Amsterdam, Netherlands : 1999) |
container_volume | 57 |
creator | Kim, Juhoon Iannone, Luigi Feldmann, Anja |
description | Victim of its own success, the current Internet is facing scalability issues that lead the research community to explore alternative architectures. In particular, the Locator/ID Split paradigm, based on the idea of separating the identity from the location of end-systems, is gaining momentum and seems to be the most promising candidate for the future Internet architecture. A critical component of any Locator/ID Split approach, from a performance and resources consumption perspective, as well as from a security point of view, is the cache. The cache is meant to temporarily store mappings, i.e., the bindings between identifiers and locations, in order to provide routers with the knowledge of where to forward packets.
Taking as reference protocol LISP (Locator/ID Separation Protocol), the most successful proposal currently under discussion at the IETF, this paper presents a thorough analysis of such a component, including the implications of policies to increase the level of security, based on real packet-level traces. Our results prove that even a timeout as short as 60s provides a high hit ratio and that the impact of using security policies is small. Furthermore, a thorough analysis of the scalability of such a component is provided along with the analysis of which class of applications contributes the major fraction of cache-misses. |
doi_str_mv | 10.1016/j.comnet.2012.11.007 |
format | article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_1321729640</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S1389128612003817</els_id><sourcerecordid>2931600651</sourcerecordid><originalsourceid>FETCH-LOGICAL-c364t-d8647328988edd8cdb02e6d379b767f498a1773c3f67f3514d53b515491078093</originalsourceid><addsrcrecordid>eNp9UMtOwzAQjBBIlMIfcIiEOCb12m5sc0CqyqtSJS7A1XJtBxzlhZ0i-vc4CuLIaWdXs7M7kySXgHJAUCyqXHdNa4ccI8A5QI4QO0pmwBnOGCrEccSEiwwwL06TsxAqhBClmM-St7XSH659T7edVkPnF5u7tFF9H0fhJl21qf3urXeNbQdVp0GrWu1c7YZDqlpVH4ILEZjUDSF1TV-7KOK6NpwnJ6Wqg734rfPk9eH-Zf2UbZ8fN-vVNtOkoENmeEEZwVxwbo3h2uwQtoUhTOxYwUoquALGiCZl7MgSqFmS3RKWVABiHAkyT64m3d53n3sbBll1ex8_CxIIBoZFQVFk0YmlfReCt6XsoyXlDxKQHBOUlZwSlGOCEkDGBOPa9a-4Go2XXrXahb9dzDBjVIxP3E48G51-Oetl0M622hrnrR6k6dz_h34AyK6Hlg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1321729640</pqid></control><display><type>article</type><title>Caching Locator/ID mappings: An experimental scalability analysis and its implications</title><source>Library & Information Science Abstracts (LISA)</source><source>ScienceDirect Journals</source><creator>Kim, Juhoon ; Iannone, Luigi ; Feldmann, Anja</creator><creatorcontrib>Kim, Juhoon ; Iannone, Luigi ; Feldmann, Anja</creatorcontrib><description>Victim of its own success, the current Internet is facing scalability issues that lead the research community to explore alternative architectures. In particular, the Locator/ID Split paradigm, based on the idea of separating the identity from the location of end-systems, is gaining momentum and seems to be the most promising candidate for the future Internet architecture. A critical component of any Locator/ID Split approach, from a performance and resources consumption perspective, as well as from a security point of view, is the cache. The cache is meant to temporarily store mappings, i.e., the bindings between identifiers and locations, in order to provide routers with the knowledge of where to forward packets.
Taking as reference protocol LISP (Locator/ID Separation Protocol), the most successful proposal currently under discussion at the IETF, this paper presents a thorough analysis of such a component, including the implications of policies to increase the level of security, based on real packet-level traces. Our results prove that even a timeout as short as 60s provides a high hit ratio and that the impact of using security policies is small. Furthermore, a thorough analysis of the scalability of such a component is provided along with the analysis of which class of applications contributes the major fraction of cache-misses.</description><identifier>ISSN: 1389-1286</identifier><identifier>EISSN: 1872-7069</identifier><identifier>DOI: 10.1016/j.comnet.2012.11.007</identifier><language>eng</language><publisher>Kidlington: Elsevier B.V</publisher><subject>Addressing and routing architectures ; Applied sciences ; Cache ; Computer architecture ; Computer science; control theory; systems ; Computer systems and distributed systems. User interface ; Exact sciences and technology ; Future Internet architecture ; Internet Protocol ; Locator/ID separation ; Measurements ; Memory and file management (including protection and security) ; Memory organisation. Data processing ; Network security ; Scalability ; Software ; Studies</subject><ispartof>Computer networks (Amsterdam, Netherlands : 1999), 2013-03, Vol.57 (4), p.897-909</ispartof><rights>2012</rights><rights>2014 INIST-CNRS</rights><rights>Copyright Elsevier Sequoia S.A. Mar 13, 2013</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c364t-d8647328988edd8cdb02e6d379b767f498a1773c3f67f3514d53b515491078093</citedby><cites>FETCH-LOGICAL-c364t-d8647328988edd8cdb02e6d379b767f498a1773c3f67f3514d53b515491078093</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27924,27925,34135</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=27277499$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Kim, Juhoon</creatorcontrib><creatorcontrib>Iannone, Luigi</creatorcontrib><creatorcontrib>Feldmann, Anja</creatorcontrib><title>Caching Locator/ID mappings: An experimental scalability analysis and its implications</title><title>Computer networks (Amsterdam, Netherlands : 1999)</title><description>Victim of its own success, the current Internet is facing scalability issues that lead the research community to explore alternative architectures. In particular, the Locator/ID Split paradigm, based on the idea of separating the identity from the location of end-systems, is gaining momentum and seems to be the most promising candidate for the future Internet architecture. A critical component of any Locator/ID Split approach, from a performance and resources consumption perspective, as well as from a security point of view, is the cache. The cache is meant to temporarily store mappings, i.e., the bindings between identifiers and locations, in order to provide routers with the knowledge of where to forward packets.
Taking as reference protocol LISP (Locator/ID Separation Protocol), the most successful proposal currently under discussion at the IETF, this paper presents a thorough analysis of such a component, including the implications of policies to increase the level of security, based on real packet-level traces. Our results prove that even a timeout as short as 60s provides a high hit ratio and that the impact of using security policies is small. Furthermore, a thorough analysis of the scalability of such a component is provided along with the analysis of which class of applications contributes the major fraction of cache-misses.</description><subject>Addressing and routing architectures</subject><subject>Applied sciences</subject><subject>Cache</subject><subject>Computer architecture</subject><subject>Computer science; control theory; systems</subject><subject>Computer systems and distributed systems. User interface</subject><subject>Exact sciences and technology</subject><subject>Future Internet architecture</subject><subject>Internet Protocol</subject><subject>Locator/ID separation</subject><subject>Measurements</subject><subject>Memory and file management (including protection and security)</subject><subject>Memory organisation. Data processing</subject><subject>Network security</subject><subject>Scalability</subject><subject>Software</subject><subject>Studies</subject><issn>1389-1286</issn><issn>1872-7069</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2013</creationdate><recordtype>article</recordtype><sourceid>F2A</sourceid><recordid>eNp9UMtOwzAQjBBIlMIfcIiEOCb12m5sc0CqyqtSJS7A1XJtBxzlhZ0i-vc4CuLIaWdXs7M7kySXgHJAUCyqXHdNa4ccI8A5QI4QO0pmwBnOGCrEccSEiwwwL06TsxAqhBClmM-St7XSH659T7edVkPnF5u7tFF9H0fhJl21qf3urXeNbQdVp0GrWu1c7YZDqlpVH4ILEZjUDSF1TV-7KOK6NpwnJ6Wqg734rfPk9eH-Zf2UbZ8fN-vVNtOkoENmeEEZwVxwbo3h2uwQtoUhTOxYwUoquALGiCZl7MgSqFmS3RKWVABiHAkyT64m3d53n3sbBll1ex8_CxIIBoZFQVFk0YmlfReCt6XsoyXlDxKQHBOUlZwSlGOCEkDGBOPa9a-4Go2XXrXahb9dzDBjVIxP3E48G51-Oetl0M622hrnrR6k6dz_h34AyK6Hlg</recordid><startdate>20130313</startdate><enddate>20130313</enddate><creator>Kim, Juhoon</creator><creator>Iannone, Luigi</creator><creator>Feldmann, Anja</creator><general>Elsevier B.V</general><general>Elsevier</general><general>Elsevier Sequoia S.A</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>E3H</scope><scope>F2A</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20130313</creationdate><title>Caching Locator/ID mappings: An experimental scalability analysis and its implications</title><author>Kim, Juhoon ; Iannone, Luigi ; Feldmann, Anja</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c364t-d8647328988edd8cdb02e6d379b767f498a1773c3f67f3514d53b515491078093</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2013</creationdate><topic>Addressing and routing architectures</topic><topic>Applied sciences</topic><topic>Cache</topic><topic>Computer architecture</topic><topic>Computer science; control theory; systems</topic><topic>Computer systems and distributed systems. User interface</topic><topic>Exact sciences and technology</topic><topic>Future Internet architecture</topic><topic>Internet Protocol</topic><topic>Locator/ID separation</topic><topic>Measurements</topic><topic>Memory and file management (including protection and security)</topic><topic>Memory organisation. Data processing</topic><topic>Network security</topic><topic>Scalability</topic><topic>Software</topic><topic>Studies</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Kim, Juhoon</creatorcontrib><creatorcontrib>Iannone, Luigi</creatorcontrib><creatorcontrib>Feldmann, Anja</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>Library & Information Sciences Abstracts (LISA)</collection><collection>Library & Information Science Abstracts (LISA)</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>Computer networks (Amsterdam, Netherlands : 1999)</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Kim, Juhoon</au><au>Iannone, Luigi</au><au>Feldmann, Anja</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Caching Locator/ID mappings: An experimental scalability analysis and its implications</atitle><jtitle>Computer networks (Amsterdam, Netherlands : 1999)</jtitle><date>2013-03-13</date><risdate>2013</risdate><volume>57</volume><issue>4</issue><spage>897</spage><epage>909</epage><pages>897-909</pages><issn>1389-1286</issn><eissn>1872-7069</eissn><abstract>Victim of its own success, the current Internet is facing scalability issues that lead the research community to explore alternative architectures. In particular, the Locator/ID Split paradigm, based on the idea of separating the identity from the location of end-systems, is gaining momentum and seems to be the most promising candidate for the future Internet architecture. A critical component of any Locator/ID Split approach, from a performance and resources consumption perspective, as well as from a security point of view, is the cache. The cache is meant to temporarily store mappings, i.e., the bindings between identifiers and locations, in order to provide routers with the knowledge of where to forward packets.
Taking as reference protocol LISP (Locator/ID Separation Protocol), the most successful proposal currently under discussion at the IETF, this paper presents a thorough analysis of such a component, including the implications of policies to increase the level of security, based on real packet-level traces. Our results prove that even a timeout as short as 60s provides a high hit ratio and that the impact of using security policies is small. Furthermore, a thorough analysis of the scalability of such a component is provided along with the analysis of which class of applications contributes the major fraction of cache-misses.</abstract><cop>Kidlington</cop><pub>Elsevier B.V</pub><doi>10.1016/j.comnet.2012.11.007</doi><tpages>13</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 1389-1286 |
ispartof | Computer networks (Amsterdam, Netherlands : 1999), 2013-03, Vol.57 (4), p.897-909 |
issn | 1389-1286 1872-7069 |
language | eng |
recordid | cdi_proquest_journals_1321729640 |
source | Library & Information Science Abstracts (LISA); ScienceDirect Journals |
subjects | Addressing and routing architectures Applied sciences Cache Computer architecture Computer science control theory systems Computer systems and distributed systems. User interface Exact sciences and technology Future Internet architecture Internet Protocol Locator/ID separation Measurements Memory and file management (including protection and security) Memory organisation. Data processing Network security Scalability Software Studies |
title | Caching Locator/ID mappings: An experimental scalability analysis and its implications |
url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-04T23%3A52%3A37IST&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=Caching%20Locator/ID%20mappings:%20An%20experimental%20scalability%20analysis%20and%20its%20implications&rft.jtitle=Computer%20networks%20(Amsterdam,%20Netherlands%20:%201999)&rft.au=Kim,%20Juhoon&rft.date=2013-03-13&rft.volume=57&rft.issue=4&rft.spage=897&rft.epage=909&rft.pages=897-909&rft.issn=1389-1286&rft.eissn=1872-7069&rft_id=info:doi/10.1016/j.comnet.2012.11.007&rft_dat=%3Cproquest_cross%3E2931600651%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c364t-d8647328988edd8cdb02e6d379b767f498a1773c3f67f3514d53b515491078093%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=1321729640&rft_id=info:pmid/&rfr_iscdi=true |