Lecture26

# Lecture26 - ECE-547 Introduction to Computer Communication...

This preview shows pages 1–10. Sign up to view the full content.

Purdue University ECE ECE - - 547 547 Introduction to Computer Introduction to Computer Communication Networks Communication Networks Instructor: Instructor: Xiaojun Xiaojun Lin Lin Lecture 26 Lecture 26

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Purdue University Generalizing the Sliding Window Generalizing the Sliding Window Concept Concept ¾ Arrivals at V.C. are controlled depending on packets in V.C.: ¾ Arrival rate is now a function of the number in the queue: λ (n) ¾ Idea: if n is large (n) and vice versa.
Purdue University ¾ Product form solution still exists. ¾ Want to find optimal control, i.e., find λ (n) such that γ is maximized subject to μE(T) L 12 3 M μ 1 μ 2 μ 3 μ M N (n)

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Purdue University Optimal Control Optimal Control ¾ Proof: A.A. Lazar “Optimal Flow Control of a Class of Queueing Networks”, in IEEE Transaction on Automatic Control, 1983. ¾ Best control is Sliding Window Control! if () 0 if cn N n nN λ = > ¾ Let (n) c ¾ Best control algorithm is of the form:
Purdue University IBM SNA Virtual Route Pacing IBM SNA Virtual Route Pacing Protocol Protocol ¾ SNA: System Network Architecture ¾ Virtual Route Pacing Protocol: ¾ A fixed window of size k is initially established over a Virtual Route (VR) ¾ Pacing count PC = k . ¾ PC is decremented every time a packet enters a Virtual Route. ¾ Packets are withheld from entering network if PC = 0

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Purdue University Virtual Route Pacing Protocol: cont. Virtual Route Pacing Protocol: cont. ¾ First packet in a given window generates a special ACK called Virtual Route Pacing Response (VRPS) ¾ On arrival of VRPS at the source: PC=PC + k 0 <= PC <= 2k -1
Purdue University Virtual Route Pacing Protocol: cont. Virtual Route Pacing Protocol: cont. 12 3 M μ 1 μ 2 μ 3 μ M 2k-1 λ SD ij PC -counter k-box

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Purdue University Comparison of all Three Schemes Comparison of all Three Schemes γ μE(T) Sliding Window SNA Fixed ACK at end
Purdue University TCP/IP Architecture TCP/IP Architecture Application Transport Internet Network Interface Application Transport Internet Network Interface Internet Network Interface Network 1 Network 2 Machine A Machine B Router/Gateway

This preview has intentionally blurred sections. Sign up to view the full version.

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

## This note was uploaded on 01/06/2010 for the course ECE 547 taught by Professor Xiaojunlin during the Spring '09 term at Purdue.

### Page1 / 30

Lecture26 - ECE-547 Introduction to Computer Communication...

This preview shows document pages 1 - 10. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online