From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: from mx03.uni-tuebingen.de (mx03.uni-tuebingen.de [134.2.5.213]) (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 634523CB40; Tue, 1 Aug 2023 06:05:14 -0400 (EDT) Received: from [134.2.58.210] (unknown [134.2.58.210]) by mx03.uni-tuebingen.de (Postfix) with ESMTPSA id A523220C9ECD; Tue, 1 Aug 2023 12:05:12 +0200 (CEST) DKIM-Filter: OpenDKIM Filter v2.11.0 mx03.uni-tuebingen.de A523220C9ECD DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=uni-tuebingen.de; s=20211202prod; t=1690884312; bh=zpL4WMSl245AhnQ4F8Td7BKTID+NBmfI26jJ5zE5ebE=; h=Date:Subject:To:Cc:References:From:In-Reply-To:From; b=TicX6OsGo4tmG6/ayiNtCDIsCAigkeGP2TaRa+ff+SAta+UhZr9XiTGlSgsv6H092 fyYNX8UMeuB9kFny8GtQks8T2reNb13NiOxq474n+vLWxQatDEiEeYZMBTXeQKOJdf aYhlar9QGOL+ocL/2E0NWhKeLFlvV6m4CrCZGia64gqXNWI3zg6wMv8IY1KasPFN4G +Jw2UhpQePrdasn1u68YKJMKepjn+dxBe2wxvAsU2j3tGQkQ3TXH66csNmGBbirrda B2Ym5vaGWTzzf/KN/uBBU0e6el7rU52o6q4vE8oM+Z1OWIZQjZVARP2V216puf6MiZ BQ1fFwP7sf2GQ== Message-ID: <0a4645ef-f39a-09af-ea14-298f8c32aedf@uni-tuebingen.de> Date: Tue, 1 Aug 2023 12:05: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 Cc: Sebastian Moeller , bloat , codel@lists.bufferbloat.net References: <507f856e-486c-87ff-79a3-50eb47683557@uni-tuebingen.de> <7FD3B872-7B3E-43E2-BC82-172E50C2C22C@gmx.de> <4a158f4f-4f96-44bf-8b08-6f84b0d660df@uni-tuebingen.de> From: Michael Menth In-Reply-To: Content-Type: text/plain; charset=UTF-8; format=flowed Content-Transfer-Encoding: 8bit Subject: Re: [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 10:05:14 -0000 Hi Dave, well, I don't see DSCD as a competitor with cake or fq-pie. DSCD is not primarily an aqm mechanism but its central objective is prioritizing ABE traffic without harming BE traffic. This idea is more than 20 years old, but scalable algorithms were not available, DSCD fills this gap. However, some implementation details of DSCD may be useful for other aqm mechanisms or scheduling mechanisms, e.g., when it comes to rate calculation etc. Kind regards Michael Am 01.08.2023 um 10:37 schrieb Dave Taht: > On Tue, Aug 1, 2023 at 1:24 AM Michael Menth wrote: >> Hi all, >> >> here is a private copy for personal use: >> >> http://atlas.cs.uni-tuebingen.de/menth/papers/Menth21-Sub-6-accepted.pdf > Very interesting, thank you. So great you have code on github! > > I appreciate the mention of cake, and I figure it would scale worse > than fq-pie in the 100Gbit scenario you present, but do not know. > However, it does come with a built in forground (respecting EF, and a > few other diffserv codepoints), and a background service class, > respecting both CS1 and LE, and it would be interesting to know how > that differs from DSCD? > >> Kind regards >> >> Michael >> >> >> Am 01.08.2023 um 09:51 schrieb Sebastian Moeller: >>> Hi Michael, >>> >>> that "teaser" you wrote is certainly interesting. Would you be able to distribute author copies to those of us that do not subscribe to IEEExplore, please? >>> >>> Regards >>> Sebastian >>> >>> >>>> On Aug 1, 2023, at 09:32, Michael Menth via Bloat wrote: >>>> >>>> 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 >>>> >>>> _______________________________________________ >>>> Bloat mailing list >>>> Bloat@lists.bufferbloat.net >>>> https://lists.bufferbloat.net/listinfo/bloat >> -- >> 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 >> > -- 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