Principles from the Past - Leonard Kleinrock - UCLA

More documents

Recommendations

Info

dT(R)/dR = T/R T(R) © Leonard Kleinrock 2004 R * R
The General Optimization Problem (1961 LK) • Minimize T = Channel Capacity Assignment Routing Procedure Message queueing discipline Topology λ i Σ γ i T i © Leonard Kleinrock 2004 • Subject to: D = Where Ci = Channel capacity of Σ i d i = Channel capacity of i th channel d i = Cost to supply 1 unit of capacity to i th channel D = Total dollars available for design C i
Page 1 and 2: Leonard Kleinrock Professor, UCLA C
Page 3 and 4: “The purpose of this thesis is to
Page 5 and 6: Systems of Flow 1. Steady flow thro
Page 7 and 8: The Independence Assumption Each ti
Page 9 and 10: The Holland Tunnel Manhattan Hudson
Page 11 and 12: FLOW CONTROL Whoa !! PING ! BIG ! D
Page 13 and 14: Flow Control in Networks X …, 3,
Page 15 and 16: Flow Control Output 0 0 IDEAL DYNAM
Page 17 and 18: Response Time Throughput Loss RESPO
Page 19 and 20: Response Time vs Throughput T( ) At
Page 21 and 22: Use Your Intuition Only 1 customer
Page 23 and 24: Simple 2-parameter 2 Model For Dela
Page 25 and 26: A Brief History of Radio • Marcon
Page 27 and 28: A Brief History of Pkt Radio • 19
Page 29 and 30: © Leonard Kleinrock 2004
Page 31: Giant Stepping in Packet Radio •
Page 35 and 36: The Underlying Principles • Resou
Page 37 and 38: Conflict Resolution • Queueing:
Page 39 and 40: The Law of Large Numbers (The First
Page 41 and 42: The Economy of Scale (The Second Re
Page 43 and 44: Economy of Scale in Networks Throug
Page 45 and 46: Conclusions • Flow control is nee

Principles from the Past - Leonard Kleinrock - UCLA

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?