Next Hop Storage and Retrieval for Coded and Scalar IP Prefix Trees

عنوان به زبان ديگر

پديدآورندگان

Alaei Hamid نويسنده Department of Computer Engineering and Information Technology Amirkabir University of Technology Tehran , Behdadfar Mohammad نويسنده Broadcast Engineering Department IRIB University Tehran , Saidi Hossein نويسنده Department of Electrical and Computer Engineering Isfahan University of Technology

تعداد صفحه

6

كليدواژه

prefix , scalar , LMP , next hop , LPM , SPT

عنوان كنفرانس

The 2011 International Symposium on;computer network and dostributed systems

زبان مدرك

فارسی

چكيده فارسي

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 dependent on IP address length. In this paper, we will review our two novel data structures called “Coded Prefix Trees” and “Scalar Prefix Trees” with lookup and update node access complexities of O(log n) where n is the number of prefixes. After reviewing these structures, the focus of the paper will be on the schemes required for storing and retrieving the “next hop” related to the Longest Matching Prefix (LMP) of an input query address.

شماره مدرك كنفرانس

1758943

سال انتشار

2010

از صفحه

1

تا صفحه

6

سال انتشار

0