<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Algorithm on JackKuo's Blog</title><link>https://jackkuo.org/tags/algorithm/</link><description>Recent content in Algorithm on JackKuo's Blog</description><generator>Hugo -- gohugo.io</generator><language>zh-TW</language><lastBuildDate>Wed, 11 Mar 2020 00:00:00 +0000</lastBuildDate><atom:link href="https://jackkuo.org/tags/algorithm/index.xml" rel="self" type="application/rss+xml"/><item><title>Max-min fairness 演算法</title><link>https://jackkuo.org/post/max_min_fairness/</link><pubDate>Wed, 11 Mar 2020 00:00:00 +0000</pubDate><guid>https://jackkuo.org/post/max_min_fairness/</guid><description>介紹 Max-min fairness 是在通訊網路中針對多工、有限的資源做分配的演算法，分配方式是對較高流量或是突發的流量進行限制。 跟 FSFS (first-come first-served) 比較起來，max-min fairness 具有</description></item></channel></rss>