Return-Path: william@bourbon.usc.edu Delivery-Date: Thu Dec 11 19:05:38 2008 X-Spam-Checker-Version: SpamAssassin 3.2.3 (2007-08-08) on merlot.usc.edu X-Spam-Level: X-Spam-Status: No, score=-2.4 required=5.0 tests=AWL,BAYES_00 autolearn=ham version=3.2.3 Received: from bourbon.usc.edu (bourbon.usc.edu [128.125.9.75]) by merlot.usc.edu (8.14.1/8.14.1) with ESMTP id mBC35cov001075 for ; Thu, 11 Dec 2008 19:05:38 -0800 Received: from bourbon.usc.edu (localhost.localdomain [127.0.0.1]) by bourbon.usc.edu (8.14.2/8.14.1) with ESMTP id mBC38FHG001886 for ; Thu, 11 Dec 2008 19:08:15 -0800 Message-Id: <200812120308.mBC38FHG001886@bourbon.usc.edu> To: cs551@merlot.usc.edu Subject: Re: Lecture 17 slide 9 Date: Thu, 11 Dec 2008 19:08:14 -0800 From: Bill Cheng Someone wrote: > Ok. I get it. > Now, can there be a case where (C-x1-x2-....-xn-1) be less than xn > (since Flow n is the only flow thats left)? > in that case, flow 1 will not be able to acquire that much bandwidth. The algorithm stops at some point. You probably should watch the lecture video or lookup max-min fairness on the web. -- Bill Cheng // bill.cheng@usc.edu Bill Cheng wrote: > Someone wrote: > > > I am a bit confused about how are the requests served in Max Min. As the > > slide mentions, x1 is served and then the distribution takes place again. > > I want to know that when x1 is served, nothing is served to others right > > ? that means, it is not round robin in this case. > > x1 was not "served". Max-min fairness is about "bandwidth > allocation". Flow 1 asked for x1 (bits/sec) and it was > allocated x1. > -- > Bill Cheng // bill.cheng@usc.edu