Lines Matching refs:numref
53 In this scheme (:numref:`figure_efd1`), the front end server/distributor/load balancer
66 computation-based schemes is ``consistent hashing``, shown in :numref:`figure_efd2`.
98 As shown in :numref:`figure_efd3`, when doing a lookup, the flow-table
127 input key to the correct value is found, as shown in :numref:`figure_efd4`.
143 impossible, as a result EFD, as shown in :numref:`figure_efd5`,
168 :numref:`figure_efd6` shows an example of using EFD as a flow-level load
182 As shown in :numref:`figure_efd6`, the front end server will have an EFD table that
321 :numref:`figure_efd7` depicts the group assignment for 7 flow keys as an example.
332 Focusing on one group that has four keys, :numref:`figure_efd8` depicts the search
346 as shown in :numref:`figure_efd9`.
360 as shown in :numref:`figure_efd10`, since their target value bit are not the same.
379 :numref:`figure_efd11` depicts the lookup operation for EFD. Given an input key,
408 :numref:`figure_efd12` depicts the high level idea of group rebalancing, given an
412 bin id is computed, for example in :numref:`figure_efd12` bin_id=2,