Segments spread queue no longer builds slow link 305

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: flows that are boklenecked 4.  Go to step 2 for any remaining flows 269 Max- Min Example •  Example: network with 4 flows, links equal bandwidth –  What is the max- min fair alloca7on? 270 32 11/4/13 Max- Min Example (2) •  When rate=1/3, flows B, C, and D bokleneck R4—R5 –  Fix B, C, and D, con7nue to increase A Bokleneck 271 Max- Min Example (3) •  When rate=2/3, flow A boklenecks R2—R3. Done. Bokleneck Bokleneck 272 33 11/4/13 Max- Min Example (4) •  End with A=2/3, B, C, D=1/3, and R2—R3, R4—R5 full –  Other links have extra capacity that can’t be used •  , linksxample: network with 4 flows, links equal bandwidth –  What is the max- min fair alloca7on? 273 Adap7ng over Time •  Alloca7on changes as flows start and stop Time 274 34 11/4/13 Adap7ng over Time (2) Flow 1 slows when Flow 2 starts Flow 1 speeds up when Flow 2 stops Flow 3 limit is elsewhere Time 275 Introduc7on to Computer Networks Addi7ve Increase Mul7plica7ve Decrease (AIMD) (§6.3.2) Computer Science & Engineering 35 11/4/13 Recall •  Want to allocate capacity to senders –  Network layer provides feedback –  Transport layer adjusts offered load –  A good alloca7on is efficient and fair •  How should we perform the alloca7on? –  Several different possibili7es … 278 Bandwidth Alloca7on Models •  Open loop versus closed loop –  Open: reserve bandwidth before use –  Closed: use feedback to adjust rates •  Host versus Network support –  Who sets/enforces alloca7ons? •  Window versus Rate based –  How is alloca7on expressed? TCP is a...
View Full Document

This document was uploaded on 04/04/2014.

Ask a homework question - tutors are online