•  English
    • Persian
    • English
  •   Login
  • Ferdowsi University of Mashhad
  • |
  • Information Center and Central Library
    • Persian
    • English
  • Home
  • Source Types
    • Journal Paper
    • Ebook
    • Conference Paper
    • Standard
    • Protocol
    • Thesis
  • Use Help
View Item 
  •   FUM Digital Library
  • Fum
  • Articles
  • Latin Articles
  • View Item
  •   FUM Digital Library
  • Fum
  • Articles
  • Latin Articles
  • View Item
  • All Fields
  • Title
  • Author
  • Year
  • Publisher
  • Subject
  • Publication Title
  • ISSN
  • DOI
  • ISBN
Advanced Search
JavaScript is disabled for your browser. Some features of this site may not work without it.

Statistical Optimal Hash-Based Longest Prefix Match

Author:
Yi Wang
,
Zhuyun Qi
,
Huichen Dai
,
Hao Wu
,
Kai Lei
,
Bin Liu
Year
: 2017
DOI: 10.1109/ANCS.2017.29
URI: https://libsearch.um.ac.ir:443/fum/handle/fum/2050723
Collections :
  • Latin Articles
  • Download: (532.1Kb)
  • Show Full MetaData Hide Full MetaData
  • Statistics

    Statistical Optimal Hash-Based Longest Prefix Match

Show full item record

contributor authorYi Wang
contributor authorZhuyun Qi
contributor authorHuichen Dai
contributor authorHao Wu
contributor authorKai Lei
contributor authorBin Liu
date accessioned2020-03-15T20:15:12Z
date available2020-03-15T20:15:12Z
date issued2017
identifier othermTAaNbIpXsUq7gnj1eH0rcRI23Z0NlXjJuPxrJKqUYY3lxvhsn.pdf
identifier urihttps://libsearch.um.ac.ir:443/fum/handle/fum/2050723?locale-attribute=en
formatgeneral
languageEnglish
titleStatistical Optimal Hash-Based Longest Prefix Match
typeJournal Paper
contenttypeFulltext
contenttypeFulltext
identifier padid14125984
identifier doi10.1109/ANCS.2017.29
journal title2017 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS)
coverageAcademic
filesize544704
citations1
  • About Us
نرم افزار کتابخانه دیجیتال "دی اسپیس" فارسی شده توسط یابش برای کتابخانه های ایرانی | تماس با یابش
DSpace software copyright © 2019-2022  DuraSpace