Cover Image

An efficient parallel IP lookup technique for IPv6 routers using multiple hashing with ternary marker storage with cellular automata and control prefix expansion

Internet address lookup is a challenging problem because of the increasing routing table sizes, increased traffic, higher speed links, and the migration to 128 bit IPv6 addresses.Routing lookup involves computation of best matching prefix for which existing solutions scale poorly when increases traf...

Full description

Saved in:
Bibliographic Details
Main Authors: P., Kiran Sree, I., Ramesh Babu, N.S.S.S.N, Usha Devi
Format: Conference or Workshop Item
Language:English
Published: 2008
Subjects:
QA75 Electronic computers. Computer science
Online Access:http://repo.uum.edu.my/11264/1/9-14-CR23.pdf
http://repo.uum.edu.my/11264/
http://www.kmice.uum.edu.my
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.uum.repo.11264
record_format eprints
spelling my.uum.repo.112642014-06-05T01:54:16Z http://repo.uum.edu.my/11264/ An efficient parallel IP lookup technique for IPv6 routers using multiple hashing with ternary marker storage with cellular automata and control prefix expansion P., Kiran Sree I., Ramesh Babu N.S.S.S.N, Usha Devi QA75 Electronic computers. Computer science Internet address lookup is a challenging problem because of the increasing routing table sizes, increased traffic, higher speed links, and the migration to 128 bit IPv6 addresses.Routing lookup involves computation of best matching prefix for which existing solutions scale poorly when increases traffic in the router or when employed for IPV6 address lookup.Our paper describes a novel approach which employs multiple hashing on reduced number of hash tables on which ternary search on levels is applied in parallel.The Cellular automata capability of storing information is used for effective caching.This scheme handles large number of prefixes generated by controlled prefix expansion by reducing collision and distributing load fairly in the hash buckets thus providing faster worst case and average case lookups.The approach we describe is fast, simple, scalable, parallelizable, and flexible. 2008-06-10 Conference or Workshop Item PeerReviewed application/pdf en http://repo.uum.edu.my/11264/1/9-14-CR23.pdf P., Kiran Sree and I., Ramesh Babu and N.S.S.S.N, Usha Devi (2008) An efficient parallel IP lookup technique for IPv6 routers using multiple hashing with ternary marker storage with cellular automata and control prefix expansion. In: Knowledge Management International Conference 2008 (KMICe2008), 10-12 June 2008, Langkawi, Malaysia. http://www.kmice.uum.edu.my
institution Universiti Utara Malaysia
building UUM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Utara Malaysia
content_source UUM Institutionali Repository
url_provider http://repo.uum.edu.my/
language English
topic QA75 Electronic computers. Computer science
spellingShingle QA75 Electronic computers. Computer science
P., Kiran Sree
I., Ramesh Babu
N.S.S.S.N, Usha Devi
An efficient parallel IP lookup technique for IPv6 routers using multiple hashing with ternary marker storage with cellular automata and control prefix expansion
description Internet address lookup is a challenging problem because of the increasing routing table sizes, increased traffic, higher speed links, and the migration to 128 bit IPv6 addresses.Routing lookup involves computation of best matching prefix for which existing solutions scale poorly when increases traffic in the router or when employed for IPV6 address lookup.Our paper describes a novel approach which employs multiple hashing on reduced number of hash tables on which ternary search on levels is applied in parallel.The Cellular automata capability of storing information is used for effective caching.This scheme handles large number of prefixes generated by controlled prefix expansion by reducing collision and distributing load fairly in the hash buckets thus providing faster worst case and average case lookups.The approach we describe is fast, simple, scalable, parallelizable, and flexible.
format Conference or Workshop Item
author P., Kiran Sree
I., Ramesh Babu
N.S.S.S.N, Usha Devi
author_facet P., Kiran Sree
I., Ramesh Babu
N.S.S.S.N, Usha Devi
author_sort P., Kiran Sree
title An efficient parallel IP lookup technique for IPv6 routers using multiple hashing with ternary marker storage with cellular automata and control prefix expansion
title_short An efficient parallel IP lookup technique for IPv6 routers using multiple hashing with ternary marker storage with cellular automata and control prefix expansion
title_full An efficient parallel IP lookup technique for IPv6 routers using multiple hashing with ternary marker storage with cellular automata and control prefix expansion
title_fullStr An efficient parallel IP lookup technique for IPv6 routers using multiple hashing with ternary marker storage with cellular automata and control prefix expansion
title_full_unstemmed An efficient parallel IP lookup technique for IPv6 routers using multiple hashing with ternary marker storage with cellular automata and control prefix expansion
title_sort efficient parallel ip lookup technique for ipv6 routers using multiple hashing with ternary marker storage with cellular automata and control prefix expansion
publishDate 2008
url http://repo.uum.edu.my/11264/1/9-14-CR23.pdf
http://repo.uum.edu.my/11264/
http://www.kmice.uum.edu.my
_version_ 1644280594967822336
score 13.211869

Similar Items