<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Sharp Bounds in Stochastic Network Calculus · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1303.4114/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/1303.4114/feed.xml" rel="self" type="application/rss+xml" /><item><title>Sharp Bounds in Stochastic Network Calculus — mentioned by srean</title><link>https://news.ycombinator.com/item?id=14169278</link><guid isPermaLink="false">urn:hackerpapers:mention:1303.4114:14169278</guid><pubDate>Fri, 21 Apr 2017 20:42:39 GMT</pubDate><description>&lt;p&gt;&amp;gt; I never heard of &amp;quot;Network calculus and stochastic network calculus&amp;quot;. ...and now you have :) &amp;gt; Certainly no such topics were in any of the applied math grad courses I took. Yeah they are a newer development. Stochastic network calculus more so. Network calculus is older, it even has a wikipedia page https://en.wikipedia.org/wiki/Network_calculus A key idea is convolution but in the max-plus algebra and martingale large deviations. &amp;gt; For network queuing, really I was suggesting using that as a paradigm to formulate an analysis; Indeed. SNCs can be a helpful tool there. Yes they are bounds…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1303.4114/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.PF</category></item></channel></rss>
