Hello all, I am looking for implementation details of the Tuple Space Search algorithm in the MegaFlow Cache. More specifically, I am interested in how ranges are handled by the tuple space search lookup algorithm. Is each range converted into (a) prefix(es) ? Are ranges converted into Nesting IDs/Nesting Levels, as described in the paper "Packet classification using tuple space searchâ ? If so, which data structure are you using to find the nesting Id / nesting level associated with a packet header field ?
Can you point me to any documentation that could answer this question ? Thank you for your help, Best Regards, Thibaut _______________________________________________ discuss mailing list discuss@openvswitch.org http://openvswitch.org/mailman/listinfo/discuss
