Beruflich Dokumente
Kultur Dokumente
Internet 0
MIT
October 1, 2004
Leonard Kleinrock 2004
My Early Years at MIT
Leonard Kleinrock
This is EXACT!!
New Jersey
Hudson
Manhattan River
Holland
Tunnel
Holland
Throughput Tunnel
(Cars/sec)
ft/sec
Whoa !!
PING ! BIG
!
DP
SYS
COMPUTER
Leonard Kleinrock 2004 NET
Constraints are Dangerous
…, 3, X
2, 1
LOSS
Leonard Kleinrock 2004 Network Cloud
Flow Control
Output 0
IDEAL
0 DYNAMIC
CONSERVATIVE
FREE-FLOW
0 DEADLOCK
Input
Leonard Kleinrock 2004
Distributed Control
• Routing Procedures:
• Easy to design
• Hard to analyze (dynamic)
• Flow Control:
• Hard to design
• Outrageously difficult to analyze
• Absolutely essential
• Guaranteed to GET you!
Leonard Kleinrock 2004
Response Time
Throughput
Loss
RESPONSE TIME
T
LOSS
Leonard Kleinrock 2004 Network Cloud
Response Time vs Throughput
Throughput
POWER = = P =
Response Time T( )
Do you want
to operate here?
T( ) Or here?
Response
Time
Max Power Point
1/P
0 * ( )
Kleinrock, L., "On Flow Control in Computer Networks", Conference Record,
Leonard Kleinrock
Proceedings of the International
2004 Conference on Communications, Vol. II,
Toronto, Ontario, pp. 27.2.1 to 27.2.5, June 1978.
Throughput
Response Time vs Throughput
At Max Power
N* = 1
T( )
Response
Time
Max Power Point
0 * ( )
Leonard Kleinrock 2004 Throughput
N*=1
T( )
M/G/1
Only 1 customer
Insight:
Just keep the T = Min
pipe full! Eff = Max
Leonard Kleinrock 2004
Highly Structured Systems
• A.M. Radio Quality
Distance
• Poor reception
• Slowly gets worse with distance
• F.M. Radio
Quality
• Good reception Distance
0 *
Throughput
250 cu in
25 watts
25 pounds
Leonard
Leonard Kleinrock 2004
Kleinrock 1999
A Brief History of Pkt Radio
• 1990’s: ARPA
10 cu in
1 watt
1 pound
Leonard
Leonard Kleinrock 2004
Kleinrock 1999
Leonard Kleinrock 2004
Leonard Kleinrock 2004
Leonard Kleinrock 2004
Giant Stepping
in Packet Radio
• Multihop
• Each hop covers distance R (Tx Radius)
• Total distance to cover is D (D>>R)
• Big R, more interference, fewer hops
• Small R, less interference, more hops
• Total Delay = T(R)[
T(R) D/R]
D/R
• Choose R=R* to minimize total delay
• dT(R)/dR = T(R)/R optimality condition
T(R)
R* R
Leonard Kleinrock 2004
The General Optimization
Problem (1961 LK)
Σ
λi
• Minimize T = γ
Ti
Channel Capacity Assignment
i
Routing Procedure
Message queueing discipline
Topology
• Subject to: D = Σd
i
i Ci
Where
Ci = Channel capacity of ith channel
di = Cost to supply 1 unit of capacity to ith channel
D = Total dollars available for design
Leonard Kleinrock 2004
Solution to the Problem
• Exact solution for di = 1
• Exact solution for arbitrary di
• Implications for topology
• Implications for routing procedure
• Implications for message sizes
? ! !
C
Type 2
? ! !
C
Type 2 Type 3
C C
C C
C C
Throughput $/Kbps
Locus of Small
Large Network Designs Net
Net
Large
Net
Small
Net
Slope = Kbps/$
0
0 Cost Throughput
Leonard Kleinrock 2004
Key System Parameter
a = Propag Delay/Pkt Tx Time
= 5LC/b (# packets in cable)
C = Bandwidth (megabits/sec)
L = Cable Length (kilometers)
PD = 5L (microseconds)
SPEED PKT LNGTH PROP DELAY LATENCY
MBPS BITS MICROSEC a
LOCAL NET 10.00 1,000 5 0.05