From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: from mx03.uni-tuebingen.de (mx03.uni-tuebingen.de [IPv6:2001:7c0:300c:3105::8602:5d5]) (using TLSv1.2 with cipher ECDHE-RSA-AES256-GCM-SHA384 (256/256 bits)) (No client certificate requested) by lists.bufferbloat.net (Postfix) with ESMTPS id 8A7D53B29E; Tue, 1 Aug 2023 03:32:16 -0400 (EDT) Received: from [192.168.178.25] (ip-095-208-117-140.um33.pools.vodafone-ip.de [95.208.117.140]) by mx03.uni-tuebingen.de (Postfix) with ESMTPSA id B186D20C8B37; Tue, 1 Aug 2023 09:32:12 +0200 (CEST) DKIM-Filter: OpenDKIM Filter v2.11.0 mx03.uni-tuebingen.de B186D20C8B37 DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=uni-tuebingen.de; s=20211202prod; t=1690875132; bh=/wtuWlimXMcU7rYBxIuIgPEJgIf0wKSlyLpIFdZzFas=; h=Date:Subject:To:References:From:In-Reply-To:From; b=ZunM8xMQ/Yz62dVFsUy7vEOTKoO7BUj8H6X3DBmIAfv5OHw7BmL5Jr1lWuz3QCixE FAPchDa75AzqaVk+42DwZGo3kcLCmP/OZm7EqU4l/hpSMUf9VIjWIXSarfsJAbvQcj R5HQR1qCCDjWh1oJcqy46cWs4eK3sNrO2hqS4ag1kegTND5ZW1UjTYAiqM1s4zhJlf RhVCYv7xKHUe2IDGIas8Vv1PyUThIebUsj+L5E1Oy1jCQfAP1iIE9uVal1zkK3LojP jJG9UbmwwCAthtRHKuYez4iLQ2ARqqk939zM9G1PXVB2ZaLQWM6boxXlhKDN/BkEDO NadyGaFLZYrMA== Message-ID: <507f856e-486c-87ff-79a3-50eb47683557@uni-tuebingen.de> Date: Tue, 1 Aug 2023 09:32:11 +0200 MIME-Version: 1.0 User-Agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:102.0) Gecko/20100101 Thunderbird/102.13.0 To: Dave Taht , bloat , codel@lists.bufferbloat.net References: From: Michael Menth In-Reply-To: Content-Type: text/plain; charset=UTF-8; format=flowed Content-Transfer-Encoding: 7bit Subject: [Bloat] Another passive bandwidth estimation method X-BeenThere: bloat@lists.bufferbloat.net X-Mailman-Version: 2.1.20 Precedence: list List-Id: General list for discussing Bufferbloat List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Tue, 01 Aug 2023 07:32:21 -0000 Hi all, we've recently developed a passive method for finding a link's capacity (in a different context). You find the algorithm in III.B.5 in https://ieeexplore.ieee.org/document/9954450 The approach ist tested in V.B for 1, 10, and 100 Gb/s links on a Linux server and provides sufficiently accurate results for bandwidth utilizations of 25%. The method is likely to work also for lower utilizations, but this was not an issue in this work. The method is applicable only by a link's head-end node. It does not work for end systems to find the bottleneck bandwidth on some unknown intermediate node. However, it can deliver useful information for scheduling algorithms in forwarding nodes, which is the use case in this paper, and which may be of interest to some readers on this list. Kind regards Michael Am 01.08.2023 um 00:36 schrieb Dave Taht via Bloat: > Promising approach: > > https://ieeexplore.ieee.org/document/10188775 -- Prof. Dr. habil. Michael Menth University of Tuebingen Faculty of Science Department of Computer Science Chair of Communication Networks Sand 13, 72076 Tuebingen, Germany phone: (+49)-7071/29-70505 fax: (+49)-7071/29-5220 mailto:menth@uni-tuebingen.de http://kn.inf.uni-tuebingen.de