[P4-dev] search in p4 tables

Nate Foster jnfoster at cs.cornell.edu
Mon Jul 17 15:40:47 EDT 2017


Use the source, Luke :-)

https://github.com/p4lang/behavioral-model/blob/master/src/bm_sim/lookup_structures.cpp

It's hard to say why without knowing more about the setup used to drive
your experiments, but it may well be that table lookup time is negligible
compared to all the other overheads inherent in processing packets using a
(largely unoptimized) software switch.

-N

On Mon, Jul 17, 2017 at 12:18 PM, Wallas Fróes <wallasync at gmail.com> wrote:

> Hi
>
> Someone know to informe me what is the search algorith used for the
> simple_switch?
> I am realizy some tests and when I use few rules the rtt time is equal
> when I use the table full.
> Someone know the why of that it?
>
> --
> Att,
>
> Wallas Fróes
> Student of master degree in the PGCOMP (UFBA)
> Information Security in Computer Networks
> Computer Engineer
> Cel: (77) 98841-0762
>
> _______________________________________________
> P4-dev mailing list
> P4-dev at lists.p4.org
> http://lists.p4.org/mailman/listinfo/p4-dev_lists.p4.org
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.p4.org/pipermail/p4-dev_lists.p4.org/attachments/20170717/60452f80/attachment-0002.html>


More information about the P4-dev mailing list