Chapter 6 Flow Control.

Slides:



Advertisements
Similar presentations
Ch. 12 Routing in Switched Networks
Advertisements

Ch. 12 Routing in Switched Networks Routing in Packet Switched Networks Routing Algorithm Requirements –Correctness –Simplicity –Robustness--the.
1 EP2210 Fairness Lecture material: –Bertsekas, Gallager, Data networks, 6.5 –L. Massoulie, J. Roberts, "Bandwidth sharing: objectives and algorithms,“
Why to learn OSI reference Model? The answer is too simple that It tells us that how communication takes place between computers on internet but how??
Congestion Control Tanenbaum 5.3 Tanenbaum 6.5. Congestion Control Network Layer – Congestion control point to point Transport Layer – Congestion control.
24-1 Chapter 24. Congestion Control and Quality of Service (part 1) 23.1 Data Traffic 23.2 Congestion 23.3 Congestion Control 23.4 Two Examples.
Jaringan Komputer Lanjut Traffic Management Aurelio Rahmadian.
Optical Networks BM-UC Davis122 Part III Wide-Area (Wavelength-Routed) Optical Networks – 1.Virtual Topology Design 2.Wavelength Conversion 3.Control and.
Chapter 8 Switching Switching at the physical layer in the traditional telephone network uses the circuit-switching approach.
CS541 Advanced Networking 1 Spectrum Sharing in Cognitive Radio Networks Neil Tang 3/23/2009.
10 - Network Layer. Network layer r transport segment from sending to receiving host r on sending side encapsulates segments into datagrams r on rcving.
Analysis and Simulation of a Fair Queuing Algorithm
1 TCP Transport Control Protocol Reliable In-order delivery Flow control Responds to congestion “Nice” Protocol.
8/28/2015  A. Orda, R. Rom, A. Segall, Design of Computer Networks Prof. Ariel Orda Room 914, ext 4646.
Data Link Control Protocols
CONGESTION CONTROL and RESOURCE ALLOCATION. Definition Resource Allocation : Process by which network elements try to meet the competing demands that.
TCP : Transmission Control Protocol Computer Network System Sirak Kaewjamnong.
Data and Computer Communications Chapter 10 – Circuit Switching and Packet Switching (Wide Area Networks)
Sami Al-wakeel 1 Data Transmission and Computer Networks The Switching Networks.
Chapter 5 Peer-to-Peer Protocols and Data Link Layer PART I: Peer-to-Peer Protocols ARQ Protocols and Reliable Data Transfer Flow Control.
Copyright 2008 Kenneth M. Chipps Ph.D. Controlling Flow Last Update
Eighth Edition by William Stallings Chapter 7 – Data Link Control Protocols Data Link Control Protocols need layer of logic above Physical to manage exchange.
Transport Layer: Sliding Window Reliability
© Janice Regan, CMPT 128, CMPT 371 Data Communications and Networking Congestion Control 0.
D. AriflerCMPE 548 Fall CMPE 548 Routing and Congestion Control.
Chapter 10 Congestion Control in Data Networks and Internets 1 Chapter 10 Congestion Control in Data Networks and Internets.
Chapter 3: The Data Link Layer –to achieve reliable, efficient communication between two physically connected machines. –Design issues: services interface.
Powerpoint Templates Data Communication Muhammad Waseem Iqbal Lec # 15.
Section 5.4 Flow Models, Optimal Routing, and Topological Design p.1.
Chapter 3 Part 3 Switching and Bridging
Congestion Control in Data Networks and Internets
Instructor Materials Chapter 6: Quality of Service
DMET 602: Networks and Media Lab
Data Link Layer Flow Control.
Corelite Architecture: Achieving Rated Weight Fairness
Chapter 23 Introduction To Transport Layer
UNIT-V Transport Layer protocols for Ad Hoc Wireless Networks
Buffer Management in a Switch
Network Layer – Routing 1
Congestion Control and Resource Allocation
Switching Techniques In large networks there might be multiple paths linking sender and receiver. Information may be switched as it travels through various.
Chapter 4: Network Layer
Chapter 3 Part 3 Switching and Bridging
Introduction of Transport Protocols
TCP, XCP and Fair Queueing
Lecture 19 – TCP Performance
Computer Network Performance Measures
William Stallings Data and Computer Communications
Switching Techniques In large networks there might be multiple paths linking sender and receiver. Information may be switched as it travels through various.
Chapter 5 Peer-to-Peer Protocols and Data Link Layer
Computer Network Performance Measures
CSCD 433/533 Advanced Networks
Switching Techniques.
COP 5611 Operating Systems Spring 2010
The Impact of Multihop Wireless Channel on TCP Performance
Congestion Control, Quality of Service, & Internetworking
Congestion Control (from Chapter 05)
Zafer Sahinoglu, Ghulam Bhatti, Anil Mehta
Chapter 3 Part 3 Switching and Bridging
TCP Congestion Control
Congestion Control (from Chapter 05)
Chapter-5 Traffic Engineering.
Transport Layer Outline Intro to transport UDP
Chapter 5 Peer-to-Peer Protocols and Data Link Layer
Lecture 4 Peer-to-Peer Protocols and Data Link Layer
Congestion Control (from Chapter 05)
Congestion Control (from Chapter 05)
Horizon: Balancing TCP over multiple paths in wireless mesh networks
Chapter 4: Network Layer
Presentation transcript:

Chapter 6 Flow Control

Flow Control Flow control Major objectives Window flow control A mechanism to throttle traffic input into the network in order to reduce congestion Major objectives Keep delay small Maintain fairness(priorities) Prevent buffer overflows Window flow control Permit scheme(token scheme) Focused on network and transport layer Window size=number of outstanding packets

6.2.1 End-to-End window What is the best window size? Depends on propagation delay Depends on the number of links on the paths

End-to-End window origin dest X d Ack Window size W=3

End-to-End window X = length of packet/cap. Of channel = tx time dW  X The source can transmit at full speed and flow control is not active Full speed = cap. of channel = 1/X(packets/sec)

End-to-End window origin dest d 1 2 3

End-to-End window If d>W  X, then the source can only transmit at a rate of W/d (packets/sec) The max. rate of transmission r = min { 1/X , W/d }

End-to-End window d: should be measured in packet tx time 1/X W/d WX d Packet length = 1 Kbits W/d 1/X d WX

End-to-End window For low-speed channel Cap =50 k bits/sec  X= 0.02 S=20ms

End-to-End window For high-speed channel Fiber optical channel Cap =3 G bits/sec

End-to-End window Suppose there are n active flow control processes in the network with window size W1…Wn The total number of packets in the network is

End-to-End window By Little’s formula Average number in system = (total arrival rate) * (average delay in system) There is a max value corresponding the channel cap.

End-to-End window To reduce T Reduce n Reduce window size for each process(window flow control)

6.5.1 Joint Routing ad Flow control Major objective of flow control are Reduce delay Maintain fairness

Joint Routing ad Flow control Flow control throttles input to the network For each O-D pair, say w , there is a flow requirement 1 4 3 2 Consider O-D pair1(OD pair 13)

Joint Routing ad Flow control Recall routing

Joint Routing ad Flow control 這裡改為 類似要max flow

Joint Routing ad Flow control Joint routing and flow control problem is equivalent to a routing problem Let yw = - rw = overflow traffic requirement

Joint Routing ad Flow control

Joint Routing ad Flow control Optimality conditions(necessary and sufficient)

Joint Routing ad Flow control Example origin dest r

Joint Routing ad Flow control No flow control:

Joint Routing ad Flow control

Joint Routing ad Flow control Accepted load r Point where flow control becomes active

6.5.2 Max-Min flow control(Fairness) Maximize the minimum allocation to any one user Allocate proportionally to traffic requirement Allocate proportionally to cost

Max-Min flow control(Fairness) Using the Max-Min criteria

Max-Min flow control(Fairness)

Max-Min flow control(Fairness) Reduce delay Maintain fairness Criterion Max the min allocation to the users Describe a procedure to achieve this

Max-Min flow control(Fairness) 2 1 3 4 5 Ex : (p451)

Max-Min flow control(Fairness) O-D1 (135) 1/3 2/3 x O-D2 (23) 1/3 x 1/3 x O-D3 O-D4 (45) 2/3 1 x O-D5 (235)

Max-Min flow control(Fairness) Homework III Due 1/3 共四題 5.2 5.25 6.4 6.6