<div dir="ltr">One example question is, if it seems useful to control and queuing theory experts to feedback the non-parametric OWD distributions to the sending device's transport layer control loop? We find kolmogorov-smirnov distance matrices as useful for clustering non-parametric distributions and chose to use it because experimentally OWD distributions have been non-parametric where the application of the central limit theorem lost the affecting information. I'm wondering if the KS distances have any use in real word traffic beyond our post analysis techniques?<br><br>Bob</div><br><div class="gmail_quote"><div dir="ltr" class="gmail_attr">On Sat, Jul 10, 2021 at 12:51 PM Bob McMahon <<a href="mailto:bob.mcmahon@broadcom.com">bob.mcmahon@broadcom.com</a>> wrote:<br></div><blockquote class="gmail_quote" style="margin:0px 0px 0px 0.8ex;border-left:1px solid rgb(204,204,204);padding-left:1ex"><div dir="ltr">"Analyzing that is really difficult, and if we don’t measure and sense, we have no hope of understanding, controlling, or ameliorating such situations."<br><br>It is truly a high honor to observe the queueing theory and control theory discussions to the world class experts here. We simple test guys must measure things and we'd like those things to be generally useful to all who can help towards improvements. Hence back to my original question, what network, or other, telemetry do experts here see as useful towards measuring active traffic to help with this? <br><br>Just some background, and my apologies for the indulgence, but we'd like our automation rigs to be able to better emulate "real world scenarios" and use stochastic based regression type signals when something goes wrong which, for us, is typically a side effect to a driver or firmware code change and commit. (Humans need machine level support for this.) It's also very frustrating that modern data centers aren't generally providing GPS atomic time to servers. (I think part of the idea behind IP packets, etc. was to mitigate fault domains and the PSTN stratum clocks were a huge weak point.) I find, today, not having a common clock reference "accurate and precise enough" is hindering progress towards understanding the complexity and towards the ameliorating, at least from our attempts to map "bothersome to machine and/or humans and relevant real world phenomenon" into our automation environments allowing us to catch things early in the eng life cycle.<br><br>A few of us have pushed over the last five or more years to add one way delay (OWD) of the test traffic (which is not the same as 1/2 RTT nor an ICMP ping delay) into iperf 2. That code is available to anyone. The lack of adoption applied to OWD has been disheartening. One common response has been, "We don't need that because users can't get their devices sync'd to the atomic clock anyway." (Also 3 is a larger number than 2 so iperf3 must be better than iperf2 so let us keep using that as our measurement tool - though I digress ;) ;)<div><br>Bob<br><br>PS. One can get a stratum 1 clock with a raspberry pi working in a home for about $200. I've got one in my home (along with a $2500 OCXO from spectracom) and the Pi is reasonable. <a href="https://www.satsignal.eu/ntp/Raspberry-Pi-NTP.html" target="_blank">https://www.satsignal.eu/ntp/Raspberry-Pi-NTP.html</a> </div></div><br><div class="gmail_quote"><div dir="ltr" class="gmail_attr">On Fri, Jul 9, 2021 at 4:01 PM Leonard Kleinrock <<a href="mailto:lk@cs.ucla.edu" target="_blank">lk@cs.ucla.edu</a>> wrote:<br></div><blockquote class="gmail_quote" style="margin:0px 0px 0px 0.8ex;border-left:1px solid rgb(204,204,204);padding-left:1ex"><div>David,<div><br></div><div>No question that non-stationarity and instability are what we often see in networks. And, non-stationarity and instability are both topics that lead to very complex analytical problems in queueing theory. You can find some results on the transient analysis in the queueing theory literature (including the second volume of my Queueing Systems book), but they are limited and hard. Nevertheless, the literature does contain some works on transient analysis of queueing systems as applied to network congestion control - again limited. On the other hand, as you said, control theory addresses stability head on and does offer some tools as well, but again, it is hairy. </div><div><br></div><div>Averages are only averages, but they can provide valuable information. For sure, latency can and does confound behavior. But, as you point out, it is the proliferation of control protocols that are, in some cases, deployed willy-nilly in networks without proper evaluation of their behavior that can lead to the nasty cycle of large transient latency, frantic repeating of web requests, protocols sending multiple copies, lack of awareness of true capacity or queue size or throughput, etc, all of which you articulate so well, create the chaos and frustration in the network. Analyzing that is really difficult, and if we don’t measure and sense, we have no hope of understanding, controlling, or ameliorating such situations. </div><div><br></div><div>Len</div><div><div><br><blockquote type="cite"><div>On Jul 9, 2021, at 12:31 PM, David P. Reed <<a href="mailto:dpreed@deepplum.com" target="_blank">dpreed@deepplum.com</a>> wrote:</div><br><div><font face="arial" size="2"><div style="margin:0px;padding:0px;font-family:arial;font-size:10pt">Len - I admit I made a mistake in challenging Little's Law as being based on Poisson processes. It is more general. But it tells you an "average" in its base form, and latency averages are not useful for end user applications.</div><p style="margin:0px;padding:0px;font-family:arial;font-size:10pt"> </p><div style="margin:0px;padding:0px;font-family:arial;font-size:10pt">However, Little's Law does assume something that is not actually valid about the kind of distributions seen in the network, and in fact, it is NOT true that networks converge on Poisson arrival times.</div><p style="margin:0px;padding:0px;font-family:arial;font-size:10pt"> </p><div style="margin:0px;padding:0px;font-family:arial;font-size:10pt">The key issue is well-described in the sandard analysis of the M/M/1 queue (e.g. <a href="https://en.wikipedia.org/wiki/M/M/1_queue" target="_blank">https://en.wikipedia.org/wiki/M/M/1_queue</a>) , which is done only for Poisson processes, and is also limited to "stable" systems. But networks are never stable when fully loaded. They get unstable and those instabilities persist for a long time in the network. Instability is at core the underlying *requirement* of the Internet's usage.</div><p style="margin:0px;padding:0px;font-family:arial;font-size:10pt"> </p><div style="margin:0px;padding:0px;font-family:arial;font-size:10pt">So specifically: real networks, even large ones, and certainly the Internet today, are not asymptotic limits of sums of stationary stochastic arrival processes. Each esternal terminal of any real network has a real user there, running a real application, and the network is a complex graph. This makes it completely unlike a single queue. Even the links within a network carry a relatively small number of application flows. There's no ability to apply the Law of Large Numbers to the distributions, because any particular path contains only a small number of serialized flows with hightly variable rates.</div><p style="margin:0px;padding:0px;font-family:arial;font-size:10pt"> </p><div style="margin:0px;padding:0px;font-family:arial;font-size:10pt">Here's an example of what really happens in a real network (I've observed this in 5 different cities on ATT's cellular network, back when it was running Alcatel Lucent HSPA+ gear in those cities).</div><div style="margin:0px;padding:0px;font-family:arial;font-size:10pt">But you can see this on any network where transient overload occurs, creating instability.</div><p style="margin:0px;padding:0px;font-family:arial;font-size:10pt"> </p><p style="margin:0px;padding:0px;font-family:arial;font-size:10pt"> </p><div style="margin:0px;padding:0px;font-family:arial;font-size:10pt">At 7 AM, the data transmission of the network is roughty stable. That's because no links are overloaded within the network. Little's Law can tell you by observing the delay and throughput on any path that the average delay in the network is X.</div><p style="margin:0px;padding:0px;font-family:arial;font-size:10pt"> </p><div style="margin:0px;padding:0px;font-family:arial;font-size:10pt">Continue sampling delay in the network as the day wears on. At about 10 AM, ping delay starts to soar into the multiple second range. No packers are lost. The peak ping time is about 4000 milliseconds - 4 seconds in most of the networks. This is in downtown, no radio errors are reported, no link errors.</div><div style="margin:0px;padding:0px;font-family:arial;font-size:10pt">So it is all queueing delay. </div><p style="margin:0px;padding:0px;font-family:arial;font-size:10pt"> </p><div style="margin:0px;padding:0px;font-family:arial;font-size:10pt">Now what Little's law doesn't tell you much about average delay, because clearly *some* subpiece of the network is fully saturated. But what is interesting here is what is happening and where. You can't tell what is saturated, and in fact the entire network is quite unstable, because the peak is constantly varying and you don't know where the throughput is. All the packets are now arriving 4 seconds or so later.</div><p style="margin:0px;padding:0px;font-family:arial;font-size:10pt"> </p><div style="margin:0px;padding:0px;font-family:arial;font-size:10pt">Why is the situaton not worse than 4 seconds? Well, there are multiple things going on:</div><p style="margin:0px;padding:0px;font-family:arial;font-size:10pt"> </p><div style="margin:0px;padding:0px;font-family:arial;font-size:10pt">1) TCP may be doing a lot of retransmissions (non-Poisson at all, not random either. The arrival process is entirely deterministic in each source, based on the retransmission timeout) or it may not be.</div><p style="margin:0px;padding:0px;font-family:arial;font-size:10pt"> </p><div style="margin:0px;padding:0px;font-family:arial;font-size:10pt">2) Users are pissed off, because they clicked on a web page, and got nothing back. They retry on their screen, or they try another site. Meanwhile, the underlying TCP connection remains there, pumping the network full of more packets on that old path, which is still backed up with packets that haven't been delivered that are sitting in queues. The real arrival process is not Poisson at all, its a deterministic, repeated retrsnsmission plus a new attempt to connect to a new site.</div><p style="margin:0px;padding:0px;font-family:arial;font-size:10pt"> </p><div style="margin:0px;padding:0px;font-family:arial;font-size:10pt">3) When the users get a web page back eventually, it is filled with names of other pieces needed to display that web page, which causes some number (often as many as 100) new pages to be fetched, ALL at the same time. Certainly not a stochastic process that will just obey the law of large numbers.</div><p style="margin:0px;padding:0px;font-family:arial;font-size:10pt"> </p><div style="margin:0px;padding:0px;font-family:arial;font-size:10pt">All of these things are the result of initial instability, causing queues to build up.</div><p style="margin:0px;padding:0px;font-family:arial;font-size:10pt"> </p><div style="margin:0px;padding:0px;font-family:arial;font-size:10pt">So what is the state of the system? is it stable? is it stochastic? Is it the sum of enough stochastic stable flows to average out to Poisson?</div><p style="margin:0px;padding:0px;font-family:arial;font-size:10pt"> </p><div style="margin:0px;padding:0px;font-family:arial;font-size:10pt">The answer is clearly NO. Control theory (not queuing theory) suggests that this system is completely uncontrolled and unstable.</div><p style="margin:0px;padding:0px;font-family:arial;font-size:10pt"> </p><div style="margin:0px;padding:0px;font-family:arial;font-size:10pt">So if the system is in this state, what does Little's Lemma tell us? What is the meaning of that hightly variable 4 second delay on ping packets, in terms of average utilizaton of the network?</div><p style="margin:0px;padding:0px;font-family:arial;font-size:10pt"> </p><div style="margin:0px;padding:0px;font-family:arial;font-size:10pt">We don't even know what all the users really might need, if the system hadn't become unstable, because some users have given up, and others are trying even harder, and new users are arriving.</div><p style="margin:0px;padding:0px;font-family:arial;font-size:10pt"> </p><div style="margin:0px;padding:0px;font-family:arial;font-size:10pt">What we do know, because ATT (at my suggestion) reconfigured their system after blaming Apple Computer company for "bugs" in the original iPhone in public, is that simply *dropping* packets sitting in queues more than a couple milliseconds MADE THE USERS HAPPY. Apparently the required capacity was there all along! </div><p style="margin:0px;padding:0px;font-family:arial;font-size:10pt"> </p><div style="margin:0px;padding:0px;font-family:arial;font-size:10pt">So I conclude that the 4 second delay was the largest delay users could barely tolerate before deciding the network was DOWN and going away. And that the backup was the accumulation of useless packets sitting in queues because none of the end systems were receiving congestion signals (which for the Internet stack begins with packet dropping).</div><p style="margin:0px;padding:0px;font-family:arial;font-size:10pt"> </p><div style="margin:0px;padding:0px;font-family:arial;font-size:10pt">I should say that most operators, and especially ATT in this case, do not measure end-to-end latency. Instead they use Little's Lemma to query routers for their current throughput in bits per second, and calculate latency as if Little's Lemma applied. This results in reports to management that literally say:</div><p style="margin:0px;padding:0px;font-family:arial;font-size:10pt"> </p><div style="margin:0px;padding:0px;font-family:arial;font-size:10pt"> The network is not dropping packets, utilization is near 100% on many of our switches and routers.</div><p style="margin:0px;padding:0px;font-family:arial;font-size:10pt"> </p><div style="margin:0px;padding:0px;font-family:arial;font-size:10pt">And management responds, Hooray! Because utilization of 100% of their hardware is their investors' metric of maximizing profits. The hardware they are operating is fully utilized. No waste! And users are happy because no packets have been dropped!</div><p style="margin:0px;padding:0px;font-family:arial;font-size:10pt"> </p><div style="margin:0px;padding:0px;font-family:arial;font-size:10pt">Hmm... what's wrong with this picture? I can see why Donovan, CTO, would accuse Apple of lousy software that was ruining iPhone user experience! His network was operating without ANY problems.</div><div style="margin:0px;padding:0px;font-family:arial;font-size:10pt">So it must be Apple!</div><p style="margin:0px;padding:0px;font-family:arial;font-size:10pt"> </p><div style="margin:0px;padding:0px;font-family:arial;font-size:10pt">Well, no. The entire problem, as we saw when ATT just changed to shorten egress queues and drop packets when the egress queues overflowed, was that ATT's network was amplifying instability, not at the link level, but at the network level.</div><p style="margin:0px;padding:0px;font-family:arial;font-size:10pt"> </p><div style="margin:0px;padding:0px;font-family:arial;font-size:10pt">And queueing theory can help with that, but *intro queueing theory* cannot.</div><p style="margin:0px;padding:0px;font-family:arial;font-size:10pt"> </p><div style="margin:0px;padding:0px;font-family:arial;font-size:10pt">And a big part of that problem is the pervasive belief that, at the network boundary, *Poisson arrival* is a reasonable model for use in all cases.</div><p style="margin:0px;padding:0px;font-family:arial;font-size:10pt"> </p><p style="margin:0px;padding:0px;font-family:arial;font-size:10pt"> </p><p style="margin:0px;padding:0px;font-family:arial;font-size:10pt"> </p><p style="margin:0px;padding:0px;font-family:arial;font-size:10pt"> </p><p style="margin:0px;padding:0px;font-family:arial;font-size:10pt"> </p><p style="margin:0px;padding:0px;font-family:arial;font-size:10pt"> </p><p style="margin:0px;padding:0px;font-family:arial;font-size:10pt"> </p><p style="margin:0px;padding:0px;font-family:arial;font-size:10pt"> </p><p style="margin:0px;padding:0px;font-family:arial;font-size:10pt"> </p><p style="margin:0px;padding:0px;font-family:arial;font-size:10pt"> </p><div style="margin:0px;padding:0px;font-family:arial;font-size:10pt">On Friday, July 9, 2021 6:05am, "Luca Muscariello" <<a href="mailto:muscariello@ieee.org" target="_blank">muscariello@ieee.org</a>> said:<br><br></div>
<div id="gmail-m_-6396285309990615985gmail-m_-5774724729815547007SafeStyles1625856330">
<div dir="ltr">
<div dir="ltr">
<div dir="ltr">
<div dir="ltr">
<div class="gmail_default" style="font-family:monospace">For those who might be interested in Little's law</div>
<div class="gmail_default" style="font-family:monospace">there is a nice paper by John Little on the occasion </div>
<div class="gmail_default" style="font-family:monospace">of the 50th anniversary of the result.</div>
<div class="gmail_default" style="font-family:monospace"><a href="https://www.informs.org/Blogs/Operations-Research-Forum/Little-s-Law-as-Viewed-on-its-50th-Anniversary" target="_blank">https://www.informs.org/Blogs/Operations-Research-Forum/Little-s-Law-as-Viewed-on-its-50th-Anniversary</a></div>
<div class="gmail_default"><span style="font-family:monospace"><a href="https://www.informs.org/content/download/255808/2414681/file/little_paper.pdf" target="_blank">https://www.informs.org/content/download/255808/2414681/file/little_paper.pdf</a></span></div>
<div class="gmail_default"><span style="font-family:monospace"> </span></div>
<div class="gmail_default"><span style="font-family:monospace">Nice read. </span></div>
<div class="gmail_default"><span style="font-family:monospace">Luca </span></div>
<div class="gmail_default"><span style="font-family:monospace"> </span></div>
<div class="gmail_default"><span style="font-family:monospace">P.S. </span></div>
<div class="gmail_default"><span style="font-family:monospace">Who has not a copy of L. Kleinrock's books? I do have and am not ready to lend them!</span></div>
</div>
<div class="gmail_quote">
<div class="gmail_attr" dir="ltr">On Fri, Jul 9, 2021 at 11:01 AM Leonard Kleinrock <<a href="mailto:lk@cs.ucla.edu" target="_blank">lk@cs.ucla.edu</a>> wrote:</div>
<blockquote class="gmail_quote" style="margin:0px 0px 0px 0.8ex;border-left:1px solid rgb(204,204,204);padding-left:1ex">
<div>David,
<div>I totally appreciate your attention to when and when not analytical modeling works. Let me clarify a few things from your note.</div>
<div>First, Little's law (also known as Little’s lemma or, as I use in my book, Little’s result) does not assume Poisson arrivals - it is good for <strong>any</strong> arrival process and any service process and is an equality between time averages. It states that the time average of the number in a system (for a sample path <em>w)</em><span style="font-family:Symbol"> </span>is equal to the average arrival rate to the system multiplied by the time-averaged time in the system for that sample path. This is often written as <span style="font-size:11pt;font-family:CMMI10;vertical-align:-6pt">N</span><span style="font-size:8pt;font-family:CMMI8">TimeAvg </span><span style="font-size:11pt;font-family:CMR10;vertical-align:-6pt">=</span><span style="font-size:11pt;font-family:CMMI10;vertical-align:-6pt">λ</span><span style="font-size:11pt;font-family:CMSY10;vertical-align:-6pt">·</span><span style="font-size:11pt;font-family:CMMI10;vertical-align:-6pt">T</span><span style="font-size:8pt;font-family:CMMI8">TimeAvg . </span> Moreover, if the system is also ergodic, then the time average equals the ensemble average and we often write it as <span style="font-size:17pt;font-family:Fe">N</span><span style="font-size:17pt;font-family:Fg;vertical-align:4pt"> ̄ </span><span style="font-size:17pt;font-family:Fg">= </span><span style="font-size:17pt;font-family:Fe">λ T</span><span style="font-size:17pt;font-family:Fg;vertical-align:4pt"> ̄ .</span><span style="vertical-align:4pt"> In any case, this requires neither Poisson arrivals nor exponential service times. </span></div>
<div><span style="vertical-align:4pt"> </span></div>
<div>Queueing theorists often do study the case of Poisson arrivals. True, it makes the analysis easier, yet there is a better reason it is often used, and that is because the sum of a large number of independent stationary renewal processes approaches a Poisson process. So nature often gives us Poisson arrivals. </div>
<div>Best,</div>
<div>Len</div>
<div>
<div>
<blockquote>
<div>On Jul 8, 2021, at 12:38 PM, David P. Reed <<a href="mailto:dpreed@deepplum.com" target="_blank">dpreed@deepplum.com</a>> wrote:</div>
<br>
<div>
<div style="margin:0px;padding:0px;font-family:arial;font-size:10pt">I will tell you flat out that the arrival time distribution assumption made by Little's Lemma that allows "estimation of queue depth" is totally unreasonable on ANY Internet in practice.</div><p style="margin:0px;padding:0px;font-family:arial;font-size:10pt"> </p>
<div style="margin:0px;padding:0px;font-family:arial;font-size:10pt">The assumption is a Poisson Arrival Process. In reality, traffic arrivals in real internet applications are extremely far from Poisson, and, of course, using TCP windowing, become highly intercorrelated with crossing traffic that shares the same queue.</div><p style="margin:0px;padding:0px;font-family:arial;font-size:10pt"> </p>
<div style="margin:0px;padding:0px;font-family:arial;font-size:10pt">So, as I've tried to tell many, many net-heads (people who ignore applications layer behavior, like the people that think latency doesn't matter to end users, only throughput), end-to-end packet arrival times on a practical network are incredibly far from Poisson - and they are more like fractal probability distributions, very irregular at all scales of time.</div><p style="margin:0px;padding:0px;font-family:arial;font-size:10pt"> </p>
<div style="margin:0px;padding:0px;font-family:arial;font-size:10pt">So, the idea that iperf can estimate queue depth by Little's Lemma by just measuring saturation of capacity of a path is bogus.The less Poisson, the worse the estimate gets, by a huge factor.</div><p style="margin:0px;padding:0px;font-family:arial;font-size:10pt"> </p><p style="margin:0px;padding:0px;font-family:arial;font-size:10pt"> </p>
<div style="margin:0px;padding:0px;font-family:arial;font-size:10pt">Where does the Poisson assumption come from? Well, like many theorems, it is the simplest tractable closed form solution - it creates a simplified view, by being a "single-parameter" distribution (the parameter is called lambda for a Poisson distribution). And the analysis of a simple queue with poisson arrival distribution and a static, fixed service time is the first interesting Queueing Theory example in most textbooks. It is suggestive of an interesting phenomenon, but it does NOT characterize any real system.</div><p style="margin:0px;padding:0px;font-family:arial;font-size:10pt"> </p>
<div style="margin:0px;padding:0px;font-family:arial;font-size:10pt">It's the queueing theory equivalent of "First, we assume a spherical cow...". in doing an example in a freshman physics class.</div><p style="margin:0px;padding:0px;font-family:arial;font-size:10pt"> </p>
<div style="margin:0px;padding:0px;font-family:arial;font-size:10pt">Unfortunately, most networking engineers understand neither queuing theory nor application networking usage in interactive applications. Which makes them arrogant. They assume all distributions are poisson!</div><p style="margin:0px;padding:0px;font-family:arial;font-size:10pt"> </p><p style="margin:0px;padding:0px;font-family:arial;font-size:10pt"> </p>
<div style="margin:0px;padding:0px;font-family:arial;font-size:10pt">On Tuesday, July 6, 2021 9:46am, "Ben Greear" <<a href="mailto:greearb@candelatech.com" target="_blank">greearb@candelatech.com</a>> said:<br><br></div>
<div id="gmail-m_-6396285309990615985gmail-m_-5774724729815547007gmail-m_272466165573362254SafeStyles1625772289">
<div style="margin:0px;padding:0px;font-family:arial;font-size:10pt">> Hello,<br>> <br>> I am interested to hear wish lists for network testing features. We make test<br>> equipment, supporting lots<br>> of wifi stations and a distributed architecture, with built-in udp, tcp, ipv6,<br>> http, ... protocols,<br>> and open to creating/improving some of our automated tests.<br>> <br>> I know Dave has some test scripts already, so I'm not necessarily looking to<br>> reimplement that,<br>> but more fishing for other/new ideas.<br>> <br>> Thanks,<br>> Ben<br>> <br>> On 7/2/21 4:28 PM, Bob McMahon wrote:<br>> > I think we need the language of math here. It seems like the network<br>> power metric, introduced by Kleinrock and Jaffe in the late 70s, is something<br>> useful.<br>> > Effective end/end queue depths per Little's law also seems useful. Both are<br>> available in iperf 2 from a test perspective. Repurposing test techniques to<br>> actual<br>> > traffic could be useful. Hence the question around what exact telemetry<br>> is useful to apps making socket write() and read() calls.<br>> ><br>> > Bob<br>> ><br>> > On Fri, Jul 2, 2021 at 10:07 AM Dave Taht <<a href="mailto:dave.taht@gmail.com" target="_blank">dave.taht@gmail.com</a><br>> <<a href="mailto:dave.taht@gmail.com" target="_blank">mailto:dave.taht@gmail.com</a>>> wrote:<br>> ><br>> > In terms of trying to find "Quality" I have tried to encourage folk to<br>> > both read "zen and the art of motorcycle maintenance"[0], and Deming's<br>> > work on "total quality management".<br>> ><br>> > My own slice at this network, computer and lifestyle "issue" is aiming<br>> > for "imperceptible latency" in all things. [1]. There's a lot of<br>> > fallout from that in terms of not just addressing queuing delay, but<br>> > caching, prefetching, and learning more about what a user really needs<br>> > (as opposed to wants) to know via intelligent agents.<br>> ><br>> > [0] If you want to get depressed, read Pirsig's successor to "zen...",<br>> > lila, which is in part about what happens when an engineer hits an<br>> > insoluble problem.<br>> > [1] <a href="https://www.internetsociety.org/events/latency2013/" target="_blank">https://www.internetsociety.org/events/latency2013/</a><br>> <<a href="https://www.internetsociety.org/events/latency2013/" target="_blank">https://www.internetsociety.org/events/latency2013/</a>><br>> ><br>> ><br>> ><br>> > On Thu, Jul 1, 2021 at 6:16 PM David P. Reed <<a href="mailto:dpreed@deepplum.com" target="_blank">dpreed@deepplum.com</a><br>> <<a href="mailto:dpreed@deepplum.com" target="_blank">mailto:dpreed@deepplum.com</a>>> wrote:<br>> > ><br>> > > Well, nice that the folks doing the conference are willing to<br>> consider that quality of user experience has little to do with signalling rate at<br>> the<br>> > physical layer or throughput of FTP transfers.<br>> > ><br>> > ><br>> > ><br>> > > But honestly, the fact that they call the problem "network quality"<br>> suggests that they REALLY, REALLY don't understand the Internet isn't the hardware<br>> or<br>> > the routers or even the routing algorithms *to its users*.<br>> > ><br>> > ><br>> > ><br>> > > By ignoring the diversity of applications now and in the future,<br>> and the fact that we DON'T KNOW what will be coming up, this conference will<br>> likely fall<br>> > into the usual trap that net-heads fall into - optimizing for some<br>> imaginary reality that doesn't exist, and in fact will probably never be what<br>> users<br>> > actually will do given the chance.<br>> > ><br>> > ><br>> > ><br>> > > I saw this issue in 1976 in the group developing the original<br>> Internet protocols - a desire to put *into the network* special tricks to optimize<br>> ASR33<br>> > logins to remote computers from terminal concentrators (aka remote<br>> login), bulk file transfers between file systems on different time-sharing<br>> systems, and<br>> > "sessions" (virtual circuits) that required logins. And then trying to<br>> exploit underlying "multicast" by building it into the IP layer, because someone<br>> > thought that TV broadcast would be the dominant application.<br>> > ><br>> > ><br>> > ><br>> > > Frankly, to think of "quality" as something that can be "provided"<br>> by "the network" misses the entire point of "end-to-end argument in system<br>> design".<br>> > Quality is not a property defined or created by The Network. If you want<br>> to talk about Quality, you need to talk about users - all the users at all times,<br>> > now and into the future, and that's something you can't do if you don't<br>> bother to include current and future users talking about what they might expect<br>> to<br>> > experience that they don't experience.<br>> > ><br>> > ><br>> > ><br>> > > There was much fighting back in 1976 that basically involved<br>> "network experts" saying that the network was the place to "solve" such issues as<br>> quality,<br>> > so applications could avoid having to solve such issues.<br>> > ><br>> > ><br>> > ><br>> > > What some of us managed to do was to argue that you can't "solve"<br>> such issues. All you can do is provide a framework that enables different uses to<br>> > *cooperate* in some way.<br>> > ><br>> > ><br>> > ><br>> > > Which is why the Internet drops packets rather than queueing them,<br>> and why diffserv cannot work.<br>> > ><br>> > > (I know the latter is conftroversial, but at the moment, ALL of<br>> diffserv attempts to talk about end-to-end applicaiton specific metrics, but<br>> never, ever<br>> > explains what the diffserv control points actually do w.r.t. what the IP<br>> layer can actually control. So it is meaningless - another violation of the<br>> > so-called end-to-end principle).<br>> > ><br>> > ><br>> > ><br>> > > Networks are about getting packets from here to there, multiplexing<br>> the underlying resources. That's it. Quality is a whole different thing. Quality<br>> can<br>> > be improved by end-to-end approaches, if the underlying network provides<br>> some kind of thing that actually creates a way for end-to-end applications to<br>> > affect queueing and routing decisions, and more importantly getting<br>> "telemetry" from the network regarding what is actually going on with the other<br>> > end-to-end users sharing the infrastructure.<br>> > ><br>> > ><br>> > ><br>> > > This conference won't talk about it this way. So don't waste your<br>> time.<br>> > ><br>> > ><br>> > ><br>> > ><br>> > ><br>> > ><br>> > ><br>> > > On Wednesday, June 30, 2021 8:12pm, "Dave Taht"<br>> <<a href="mailto:dave.taht@gmail.com" target="_blank">dave.taht@gmail.com</a> <<a href="mailto:dave.taht@gmail.com" target="_blank">mailto:dave.taht@gmail.com</a>>> said:<br>> > ><br>> > > > The program committee members are *amazing*. Perhaps, finally,<br>> we can<br>> > > > move the bar for the internet's quality metrics past endless,<br>> blind<br>> > > > repetitions of speedtest.<br>> > > ><br>> > > > For complete details, please see:<br>> > > > <a href="https://www.iab.org/activities/workshops/network-quality/" target="_blank">https://www.iab.org/activities/workshops/network-quality/</a><br>> <<a href="https://www.iab.org/activities/workshops/network-quality/" target="_blank">https://www.iab.org/activities/workshops/network-quality/</a>><br>> > > ><br>> > > > Submissions Due: Monday 2nd August 2021, midnight AOE<br>> (Anywhere On Earth)<br>> > > > Invitations Issued by: Monday 16th August 2021<br>> > > ><br>> > > > Workshop Date: This will be a virtual workshop, spread over<br>> three days:<br>> > > ><br>> > > > 1400-1800 UTC Tue 14th September 2021<br>> > > > 1400-1800 UTC Wed 15th September 2021<br>> > > > 1400-1800 UTC Thu 16th September 2021<br>> > > ><br>> > > > Workshop co-chairs: Wes Hardaker, Evgeny Khorov, Omer Shapira<br>> > > ><br>> > > > The Program Committee members:<br>> > > ><br>> > > > Jari Arkko, Olivier Bonaventure, Vint Cerf, Stuart Cheshire,<br>> Sam<br>> > > > Crowford, Nick Feamster, Jim Gettys, Toke Hoiland-Jorgensen,<br>> Geoff<br>> > > > Huston, Cullen Jennings, Katarzyna Kosek-Szott, Mirja<br>> Kuehlewind,<br>> > > > Jason Livingood, Matt Mathias, Randall Meyer, Kathleen<br>> Nichols,<br>> > > > Christoph Paasch, Tommy Pauly, Greg White, Keith Winstein.<br>> > > ><br>> > > > Send Submissions to: <a href="mailto:network-quality-workshop-pc@iab.org" target="_blank">network-quality-workshop-pc@iab.org</a><br>> <<a href="mailto:network-quality-workshop-pc@iab.org" target="_blank">mailto:network-quality-workshop-pc@iab.org</a>>.<br>> > > ><br>> > > > Position papers from academia, industry, the open source<br>> community and<br>> > > > others that focus on measurements, experiences, observations<br>> and<br>> > > > advice for the future are welcome. Papers that reflect<br>> experience<br>> > > > based on deployed services are especially welcome. The<br>> organizers<br>> > > > understand that specific actions taken by operators are<br>> unlikely to be<br>> > > > discussed in detail, so papers discussing general categories<br>> of<br>> > > > actions and issues without naming specific technologies,<br>> products, or<br>> > > > other players in the ecosystem are expected. Papers should not<br>> focus<br>> > > > on specific protocol solutions.<br>> > > ><br>> > > > The workshop will be by invitation only. Those wishing to<br>> attend<br>> > > > should submit a position paper to the address above; it may<br>> take the<br>> > > > form of an Internet-Draft.<br>> > > ><br>> > > > All inputs submitted and considered relevant will be published<br>> on the<br>> > > > workshop website. The organisers will decide whom to invite<br>> based on<br>> > > > the submissions received. Sessions will be organized according<br>> to<br>> > > > content, and not every accepted submission or invited attendee<br>> will<br>> > > > have an opportunity to present as the intent is to foster<br>> discussion<br>> > > > and not simply to have a sequence of presentations.<br>> > > ><br>> > > > Position papers from those not planning to attend the virtual<br>> sessions<br>> > > > themselves are also encouraged. A workshop report will be<br>> published<br>> > > > afterwards.<br>> > > ><br>> > > > Overview:<br>> > > ><br>> > > > "We believe that one of the major factors behind this lack of<br>> progress<br>> > > > is the popular perception that throughput is the often sole<br>> measure of<br>> > > > the quality of Internet connectivity. With such narrow focus,<br>> people<br>> > > > don’t consider questions such as:<br>> > > ><br>> > > > What is the latency under typical working conditions?<br>> > > > How reliable is the connectivity across longer time periods?<br>> > > > Does the network allow the use of a broad range of protocols?<br>> > > > What services can be run by clients of the network?<br>> > > > What kind of IPv4, NAT or IPv6 connectivity is offered, and<br>> are there firewalls?<br>> > > > What security mechanisms are available for local services,<br>> such as DNS?<br>> > > > To what degree are the privacy, confidentiality, integrity<br>> and<br>> > > > authenticity of user communications guarded?<br>> > > ><br>> > > > Improving these aspects of network quality will likely depend<br>> on<br>> > > > measurement and exposing metrics to all involved parties,<br>> including to<br>> > > > end users in a meaningful way. Such measurements and exposure<br>> of the<br>> > > > right metrics will allow service providers and network<br>> operators to<br>> > > > focus on the aspects that impacts the users’ experience<br>> most and at<br>> > > > the same time empowers users to choose the Internet service<br>> that will<br>> > > > give them the best experience."<br>> > > ><br>> > > ><br>> > > > --<br>> > > > Latest Podcast:<br>> > > ><br>> <a href="https://www.linkedin.com/feed/update/urn:li:activity:6791014284936785920/" target="_blank">https://www.linkedin.com/feed/update/urn:li:activity:6791014284936785920/</a><br>> <<a href="https://www.linkedin.com/feed/update/urn:li:activity:6791014284936785920/" target="_blank">https://www.linkedin.com/feed/update/urn:li:activity:6791014284936785920/</a>><br>> > > ><br>> > > > Dave Täht CTO, TekLibre, LLC<br>> > > > _______________________________________________<br>> > > > Cerowrt-devel mailing list<br>> > > > <a href="mailto:Cerowrt-devel@lists.bufferbloat.net" target="_blank">Cerowrt-devel@lists.bufferbloat.net</a><br>> <<a href="mailto:Cerowrt-devel@lists.bufferbloat.net" target="_blank">mailto:Cerowrt-devel@lists.bufferbloat.net</a>><br>> > > > <a href="https://lists.bufferbloat.net/listinfo/cerowrt-devel" target="_blank">https://lists.bufferbloat.net/listinfo/cerowrt-devel</a><br>> <<a href="https://lists.bufferbloat.net/listinfo/cerowrt-devel" target="_blank">https://lists.bufferbloat.net/listinfo/cerowrt-devel</a>><br>> > > ><br>> ><br>> ><br>> ><br>> > --<br>> > Latest Podcast:<br>> > <a href="https://www.linkedin.com/feed/update/urn:li:activity:6791014284936785920/" target="_blank">https://www.linkedin.com/feed/update/urn:li:activity:6791014284936785920/</a><br>> <<a href="https://www.linkedin.com/feed/update/urn:li:activity:6791014284936785920/" target="_blank">https://www.linkedin.com/feed/update/urn:li:activity:6791014284936785920/</a>><br>> ><br>> > Dave Täht CTO, TekLibre, LLC<br>> > _______________________________________________<br>> > Make-wifi-fast mailing list<br>> > <a href="mailto:Make-wifi-fast@lists.bufferbloat.net" target="_blank">Make-wifi-fast@lists.bufferbloat.net</a><br>> <<a href="mailto:Make-wifi-fast@lists.bufferbloat.net" target="_blank">mailto:Make-wifi-fast@lists.bufferbloat.net</a>><br>> > <a href="https://lists.bufferbloat.net/listinfo/make-wifi-fast" target="_blank">https://lists.bufferbloat.net/listinfo/make-wifi-fast</a><br>> <<a href="https://lists.bufferbloat.net/listinfo/make-wifi-fast" target="_blank">https://lists.bufferbloat.net/listinfo/make-wifi-fast</a>><br>> ><br>> ><br>> > This electronic communication and the information and any files transmitted<br>> with it, or attached to it, are confidential and are intended solely for the use<br>> of<br>> > the individual or entity to whom it is addressed and may contain information<br>> that is confidential, legally privileged, protected by privacy laws, or otherwise<br>> > restricted from disclosure to anyone else. If you are not the intended<br>> recipient or the person responsible for delivering the e-mail to the intended<br>> recipient,<br>> > you are hereby notified that any use, copying, distributing, dissemination,<br>> forwarding, printing, or copying of this e-mail is strictly prohibited. If you<br>> > received this e-mail in error, please return the e-mail to the sender, delete<br>> it from your computer, and destroy any printed copy of it.<br>> ><br>> > _______________________________________________<br>> > Starlink mailing list<br>> > <a href="mailto:Starlink@lists.bufferbloat.net" target="_blank">Starlink@lists.bufferbloat.net</a><br>> > <a href="https://lists.bufferbloat.net/listinfo/starlink" target="_blank">https://lists.bufferbloat.net/listinfo/starlink</a><br>> ><br>> <br>> <br>> --<br>> Ben Greear <<a href="mailto:greearb@candelatech.com" target="_blank">greearb@candelatech.com</a>><br>> Candela Technologies Inc <a href="http://www.candelatech.com/" target="_blank">http://www.candelatech.com</a><br>></div>
</div>
_______________________________________________<br>Starlink mailing list<br><a href="mailto:Starlink@lists.bufferbloat.net" target="_blank">Starlink@lists.bufferbloat.net</a><br><a href="https://lists.bufferbloat.net/listinfo/starlink" target="_blank">https://lists.bufferbloat.net/listinfo/starlink</a></div>
</blockquote>
</div>
</div>
</div>
_______________________________________________<br> Make-wifi-fast mailing list<br><a href="mailto:Make-wifi-fast@lists.bufferbloat.net" target="_blank">Make-wifi-fast@lists.bufferbloat.net</a><br><a rel="noreferrer" href="https://lists.bufferbloat.net/listinfo/make-wifi-fast" target="_blank">https://lists.bufferbloat.net/listinfo/make-wifi-fast</a></blockquote>
</div>
</div>
</div>
</div>
</div></font></div></blockquote></div><br></div></div></blockquote></div>
</blockquote></div>
<br>
<span style="background-color:rgb(255,255,255)"><font size="2">This electronic communication and the information and any files transmitted with it, or attached to it, are confidential and are intended solely for the use of the individual or entity to whom it is addressed and may contain information that is confidential, legally privileged, protected by privacy laws, or otherwise restricted from disclosure to anyone else. If you are not the intended recipient or the person responsible for delivering the e-mail to the intended recipient, you are hereby notified that any use, copying, distributing, dissemination, forwarding, printing, or copying of this e-mail is strictly prohibited. If you received this e-mail in error, please return the e-mail to the sender, delete it from your computer, and destroy any printed copy of it.</font></span>