Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Hamid Alaei"'
Publikováno v:
IEICE Transactions on Information and Systems. :2932-2943
Recently, we have proposed a new prefix lookup algorithm which would use the prefixes as scalar numbers. This algorithm could be applied to different tree structures such as Binary Search Tree and some other balanced trees like RB-tree, AVL-tree and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::45a542ca8225713739d31a5adb6308b5
https://doi.org/10.1587/transinf.e93.d.2932
https://doi.org/10.1587/transinf.e93.d.2932
Publikováno v:
2011 International Symposium on Computer Networks and Distributed Systems (CNDS).
Currently, the large size of IP routing tables, the increasing rate of communication links and the unavoidable need for moving from IPv4 to IPv6, have caused researchers to introduce fast and memory efficient route lookup methods which are less depen
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9338d60b4c7cbc6eb3d1e9dfcbae4286
https://doi.org/10.1109/cnds.2011.5764592
https://doi.org/10.1109/cnds.2011.5764592
Publikováno v:
INFOCOM
Currently, the increasing rate of routing lookups in Internet routers, the large number of prefixes and also the transition from IPV4 to IPV6, have caused Internet designers to propose new lookup algorithms and try to reduce the memory cost and the p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fa212b7da1514af35b4e3b288666a1bb
https://doi.org/10.1109/infcom.2009.5062179
https://doi.org/10.1109/infcom.2009.5062179
Publikováno v:
2014 22nd Iranian Conference on Electrical Engineering (ICEE); 2014, p1103-1107, 5p
Publikováno v:
2012 3rd IEEE International Conference on Network Infrastructure & Digital Content; 1/ 1/2012, p656-659, 4p