From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: from mail-la0-x231.google.com (mail-la0-x231.google.com [IPv6:2a00:1450:4010:c03::231]) by dpdk.org (Postfix) with ESMTP id 443241F3 for ; Tue, 1 Oct 2013 10:56:31 +0200 (CEST) Received: by mail-la0-f49.google.com with SMTP id ev20so5490362lab.22 for ; Tue, 01 Oct 2013 01:57:13 -0700 (PDT) DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=20120113; h=mime-version:date:message-id:subject:from:to:content-type; bh=SB8GWo0n3Drh8usrL35cHrqaNbTQpI2SaSQEKh27oMc=; b=tmQvvM1fdmR0x1wQkY1OwZEaxtNZ8W1E9s8Wp1a5agqXAwVwMjuqzvSog649B/uq7r ntNO9vwfnxPrTTVn6aWMirD5RryFuRLrUcaDvlwMvGmNXcZTwzC3pcrPbpLxCeoretcT GnePsNUsI9UIBasbjjKLx1qDKCeVPUGuFFvYpHUsluyHYrmlerhvqY3R17E67VvfIYJu /ZbYS3fCu3KzW09PnTi51rxgugkkxXfYy6sDxrgxp8FW5G72NZL2YbXpD8sVmChHb6Ps pZZcDkKhaXWDB0y5YSB5QqIDzc+pbyYYrvFdZ8C2tjQJ/UCaeFPunYGZFthd87cg9non Y/xA== MIME-Version: 1.0 X-Received: by 10.152.28.7 with SMTP id x7mr24014943lag.26.1380617833021; Tue, 01 Oct 2013 01:57:13 -0700 (PDT) Received: by 10.114.176.228 with HTTP; Tue, 1 Oct 2013 01:57:12 -0700 (PDT) Date: Tue, 1 Oct 2013 12:57:12 +0400 Message-ID: From: Vladimir Medvedkin To: dev@dpdk.org Content-Type: text/plain; charset=ISO-8859-1 Content-Transfer-Encoding: quoted-printable X-Content-Filtered-By: Mailman/MimeDel 2.1.15 Subject: [dpdk-dev] L3FWD LPM IP lookup performance question X-BeenThere: dev@dpdk.org X-Mailman-Version: 2.1.15 Precedence: list List-Id: patches and discussions about DPDK List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Tue, 01 Oct 2013 08:56:31 -0000 Hi, Base concepts of algorithm used by LPM (DIR-24-8) described here http://citeseerx.ist.psu.edu/viewdoc/download?doi=3D10.1.1.21.9617&rep=3Dre= p1&type=3Dpdf Best regards, Vladimir On 24/09/2013 15:53, Jun Han wrote: >* Hello,*>**>* We are trying to benchmark L3FWD application and have a que= stion regarding*>* the IP lookup algorithm as we expect the bottleneck to b= e at the lookup.*>* Could someone let us know how efficient the lookup algo= rithm that L3FWD is*>* using (e.g, LPM)? We are asking because we want to o= btain highest L3*>* forwarding performance number, and we might need to cha= nge the lookup*>* method if the current LPM method is not as efficient.*>**= >* Thank you very much,*>**>* Jun*>