Timer implementation for L2 address table - Programmers Heaven

Howdy, Stranger!

It looks like you're new here. If you want to get involved, click one of these buttons!

Categories

Welcome to the new platform of Programmer's Heaven! We apologize for the inconvenience caused, if you visited us from a broken link of the previous version. The main reason to move to a new platform is to provide more effective and collaborative experience to you all. Please feel free to experience the new platform and use its exciting features. Contact us for any issue that you need to get clarified. We are more than happy to help you.

Timer implementation for L2 address table

onebrotheronebrother Posts: 2Member
Hi All,

I have a L2 address table (MAC to port mapping) which contains 20,000 entries. Address table is implemented using hash table. Now I need aging timer(s) for finding stale entries to make room for newly learned MAC addresses. I used to have a single timer which will periodically check 10,000 entries at each timeout event (entries 1-10,000 in one pass & next 10,000 in another pass).

Now the L2 address table size is extended to 150,000. With this increased size, I do see my current timer implementation is not efficient & at the same time I donot want to have too many timers for handling these stale entries...

Is there any better timer design approach which will help me to get an efficient search (of aged entries)?

thanks,
onebrother
Sign In or Register to comment.