An active routing prefix caching algorithm for IP address lookup
A lot of IP address lookup algorithms have been widely studied. Among them we have thorough investigated the caching based algorithms. It is based on the locality assumption of Intenet traffic which is questionable especially in high speed backbone. There is enough locality if routing prefixes are c...
Uložené v:
| Vydané v: | 2009 Fourth International Conference on Communications and Networking in China s. 1 - 6 |
|---|---|
| Hlavní autori: | , , |
| Médium: | Konferenčný príspevok.. |
| Jazyk: | English |
| Vydavateľské údaje: |
IEEE
01.08.2009
|
| Predmet: | |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | A lot of IP address lookup algorithms have been widely studied. Among them we have thorough investigated the caching based algorithms. It is based on the locality assumption of Intenet traffic which is questionable especially in high speed backbone. There is enough locality if routing prefixes are cached instead of individual IP addresses. However the previous prefix caching scheme need to do complete or partial prefix expansion to cache corresponding prefix which will lead to prefix table explosion and make incremental updates difficult. A new active prefix caching algorithm based on prefixes covering relationship is proposed in this paper. Incremental updates are supported without prefix expansion. Performance evaluation shows our proposed scheme has higher cache hit rate, less memory space than previous schemes. |
|---|---|
| AbstractList | A lot of IP address lookup algorithms have been widely studied. Among them we have thorough investigated the caching based algorithms. It is based on the locality assumption of Intenet traffic which is questionable especially in high speed backbone. There is enough locality if routing prefixes are cached instead of individual IP addresses. However the previous prefix caching scheme need to do complete or partial prefix expansion to cache corresponding prefix which will lead to prefix table explosion and make incremental updates difficult. A new active prefix caching algorithm based on prefixes covering relationship is proposed in this paper. Incremental updates are supported without prefix expansion. Performance evaluation shows our proposed scheme has higher cache hit rate, less memory space than previous schemes. |
| Author | Shao-hua Yu Jin-you Dai Guo-sheng Zhu |
| Author_xml | – sequence: 1 surname: Guo-sheng Zhu fullname: Guo-sheng Zhu organization: Sch. of Comput. Sci. & Technol., Huazhong Univ. of Sci. & Technol., Wuhan, China – sequence: 2 surname: Shao-hua Yu fullname: Shao-hua Yu organization: Sch. of Comput. Sci. & Technol., Huazhong Univ. of Sci. & Technol., Wuhan, China – sequence: 3 surname: Jin-you Dai fullname: Jin-you Dai organization: Sch. of Comput. Sci. & Technol., Huazhong Univ. of Sci. & Technol., Wuhan, China |
| BookMark | eNotj9FKwzAYhSO4Czf3BCLkBVr_JP-S5s5S1BWm82L3I02TLdg1JetE394Nd3U4fHD4zpTc9rF3hDwyyBkD_VQt64-yWr_nHEDnCyF0IdkNmWtVMOSIKISSEzK9YA0cQd2R57Knxo7h29EUT2Pod3RIzocfao3dX6rpdjGFcX-gPiZaf1LTtskdj7SL8es03JOJN93Rza85I5vXl021zFbrt7oqV1nQMGYLCZ5bbcA4LsxZRmDTAneoGq1A-cYWjAtfAIpWykYhQ-klKrSCe4sgZuThfzY457ZDCgeTfrfXj-IPr49ImQ |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IL CBEJK RIE RIL |
| DOI | 10.1109/CHINACOM.2009.5339861 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Xplore POP ALL IEEE Xplore All Conference Proceedings IEEE Electronic Library (IEL) IEEE Proceedings Order Plans (POP All) 1998-Present |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISBN | 9781424443376 1424443377 |
| EndPage | 6 |
| ExternalDocumentID | 5339861 |
| Genre | orig-research |
| GroupedDBID | 6IE 6IL CBEJK RIE RIL |
| ID | FETCH-LOGICAL-i90t-560f2c9a0ae23a42434bd02e47b9707fbc8123f8043d66b74146f6474c32fc403 |
| IEDL.DBID | RIE |
| IngestDate | Thu Jun 29 18:17:52 EDT 2023 |
| IsPeerReviewed | false |
| IsScholarly | false |
| LCCN | 2009902407 |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-i90t-560f2c9a0ae23a42434bd02e47b9707fbc8123f8043d66b74146f6474c32fc403 |
| PageCount | 6 |
| ParticipantIDs | ieee_primary_5339861 |
| PublicationCentury | 2000 |
| PublicationDate | 2009-Aug. |
| PublicationDateYYYYMMDD | 2009-08-01 |
| PublicationDate_xml | – month: 08 year: 2009 text: 2009-Aug. |
| PublicationDecade | 2000 |
| PublicationTitle | 2009 Fourth International Conference on Communications and Networking in China |
| PublicationTitleAbbrev | CHINACOM |
| PublicationYear | 2009 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| Score | 1.425711 |
| Snippet | A lot of IP address lookup algorithms have been widely studied. Among them we have thorough investigated the caching based algorithms. It is based on the... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 1 |
| SubjectTerms | Clocks Computer science Costs Explosions Internet IP address lookup Logic Optical fiber communication prefix caching prefix covering Routing Spine Wavelength division multiplexing |
| Title | An active routing prefix caching algorithm for IP address lookup |
| URI | https://ieeexplore.ieee.org/document/5339861 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07T8MwELYKYmAq0CLe8sBIqGOfYnujqqjagdKhQ7cqdmyoVJKqNIifzzkJRUgsbJZl2dJZvu8734uQW2e0Be6zCBBr0UDJIFImFhHESqbeSSQFrGo2IScTNZ_raYvc7XJhnHNV8Jm7D8PKl58VtgxfZT2kJloFW2dPyqTO1WqScmKme4PReNIfPD_VRSibtb-aplSYMWz_77Qj0v1JvqPTHawck5bLT0j7u_sCbR5jhzz0c5pW2opuijJEL9M1wt3yk9o6QJKmq5cCbf_XN4rMlI6nFLVMsK7pCpl1ue6S2fBxNhhFTT-EaKnZNkJu4rnVKUsdFylwEGAyxh1IoyWT3lgEa-EVA5EliUGqAIlPQIIV3Ftg4pTs50XuzghlVkEmvIxxK_CCKwTx2CNzig2TVrNz0gnyWKzriheLRhQXf09fksPaxxLC4q7I_nZTumtyYD-2y_fNTXVNX5eAk-A |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PS8MwFA5jCnqauom_zcGjdWnzaJqbYygbbnWHHXYbTZroYLZjruKf70tbJ4IXbyGEBF7I-76XvJePkBujpIbAph4g1mKAkoIXKZ974EcisUYgKWCl2ISI42g2k5MGud3WwhhjyuQzc-ea5Vt-muvCXZV1kZrIyMU6O045q67WqstyfCa7_cEw7vWfx9U3lPXoX7IpJWo8tv633gHp_JTf0ckWWA5Jw2RHpPWtv0Dr49gm972MJqW_ouu8cPnLdIWAt_ikukqRpMnyJcfo__WNIjelwwlFP-Pia7pEbl2sOmT6-DDtD7xaEcFbSLbxkJ3YQMuEJSbgCQTAQaUsMCCUFExYpRGuuY0Y8DQMFZIFCG0IAjQPrAbGj0kzyzNzQijTEaTcCh-nAsuDCGHct8idfMWEluyUtJ095qvqz4t5bYqzv7uvyd5gOh7NR8P46ZzsVy8uLknugjQ368Jckl39sVm8r6_KLfsCfL6XKQ |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2009+Fourth+International+Conference+on+Communications+and+Networking+in+China&rft.atitle=An+active+routing+prefix+caching+algorithm+for+IP+address+lookup&rft.au=Guo-sheng+Zhu&rft.au=Shao-hua+Yu&rft.au=Jin-you+Dai&rft.date=2009-08-01&rft.pub=IEEE&rft.spage=1&rft.epage=6&rft_id=info:doi/10.1109%2FCHINACOM.2009.5339861&rft.externalDocID=5339861 |