140 likes | 237 Views
Lecture 14 Chapter 6 Multispeed Access Designs. Can we do it?. Use OR. Definition 6.3 on page 183 Given Nodes: N0, N1,…,Nn Weights: w1, w2,…,wn Equip Types: L1, L2,…,Lm Capacities: cap[Li] Costs: cost[t,i,j]
E N D
Lecture 14 Chapter 6 Multispeed Access Designs Can we do it? Use OR
Definition 6.3 on page 183 Given Nodes: N0, N1,…,Nn Weights: w1, w2,…,wn Equip Types: L1, L2,…,Lm Capacities: cap[Li] Costs: cost[t,i,j] Find a tree rooted at N0 and equip assignments that minimizes design cost.
Example N3 N4 N0 N5 N7 N6 N1 N2
Assumptions: • Only one type of equipment can be used between two sites • Only a single line of type 9.6K 56K, 128K can be used between two sites. You may not use two 9.6K links to get 19.2K of capacity. • Link utilization can not exceed 50%. A 9.6K line can only carry 4.8 Kbps of traffic.
Feasible Solution #1 6.7 4.2 N3 N4 56K, 12% N0 56K, 32% 56K, 43% 9.6K, 43% 9.6 N5 56K, 27% 4.2 N7 9.6K, 3% 56K, 15% N6 N1 N2 0.3 15.1 8.2
Feasible Solution #2 6.7 4.2 9.6K, 43% N3 N4 N0 56K, 44% 56K, 12% 56K, 35% 9.6 N5 4.2 N7 56K, 15% 9.6K, 43% N6 N1 N2 0.3 15.1 9.6K, 3% 8.2
Don’t do this!!!!!!!!!!!!!!!!!!!!! Use OR modelL14.txt dataL14.txt outL14.txt
Optimal Design 6.7 4.2 9.6 K N3 N4 N0 Cost = 3313 56 K 9.6 N5 4.2 N7 N6 N1 N2 0.3 15.1 8.2
THE END Thank you! Go To HW #11