1 / 57

TCOM 540

TCOM 540. Network Optimization: Routing, Flow Management, Capacity Modeling Dr. John G. Leigh jleigh@mitretek.org. Introduction. Course Objectives Illustrate techniques and approaches appropriate for designing different types of networks

komala
Download Presentation

TCOM 540

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. TCOM 540 Network Optimization: Routing, Flow Management, Capacity Modeling Dr. John G. Leigh jleigh@mitretek.org TCOM 540/1

  2. Introduction • Course Objectives • Illustrate techniques and approaches appropriate for designing different types of networks • Illustrate ways of discriminating between good and bad network designs • Provide basis for effective communication with users, network designers, and telecommunications vendors TCOM 540/1

  3. Introduction • Text: Wide Area Network Design by Robert S. Cahn, Publ. Morgan Kaufmann, ISBN 1-55860-458-8 • Other supplementary readings TCOM 540/1

  4. Introduction (2) • Approximate schedule for TCOM 540 • Week 1 – Basic network design principles • Week 2 – Some theory – graphs, trees, and tours; basic design algorithms • Week 3 – Importance of data • Week 4 – Traffic and cost generators • Week 5 – Access and backbones • Week 6 – Capacity, routing and reliability (TCOM 540 term paper due if applicable) • Week 7 – TCOM 540 final TCOM 540/1

  5. Introduction (3) • Evaluation weightings • Homework 25% • Term paper/project 25% • Finals 30% • Class Participation 20% TCOM 540/1

  6. Network Optimization … • Is generally not possible … • Conflicting objectives • Combinatorial explosion defeats exact solutions • Inadequate /inaccurate information • Rate of change, especially for data networks • Usually have to settle for a “pretty good” design TCOM 540/1

  7. Conflicting Objectives • Cost • Performance • Reliability • Trade-offs are inevitable! TCOM 540/1

  8. Combinatorial Explosion • Number of possible pairwise interconnections between n nodes is N = 0.5*n*(n-1) = O(n2) • Complexity of overall network design problem is O(2N) TCOM 540/1

  9. Inadequate/Inaccurate Information • Traffic data can be hard to get • Traffic flows may not be measured • Carrier may not be willing to provide data (it means work for him) TCOM 540/1

  10. Rate of Change • “Best” network today may not be best tomorrow • Traffic growth and changes • Price changes • Technology changes TCOM 540/1

  11. Types of Networks • Circuit-switched • Also called connection-oriented • Connectionless • Packet, frame, or cell switched • Dedicated • Circuits permanently established (“nailed up”) TCOM 540/1

  12. Circuit-Switched Networks • Connections or circuits established for each call • Resources are released when call is completed TCOM 540/1

  13. Connectionless Networks • Packets of data are routed independently • Packet Switched, Frame Relay, Asynchronous Transfer Mode • However, Permanent Virtual Circuits may be set up TCOM 540/1

  14. Dedicated Networks • Circuits are permanently established using dedicated resources • No call set-up time, very low latency • User decides what/how/when to transmit - voice, data, ... TCOM 540/1

  15. Example of Trade-Offs TCOM 540/1

  16. Criteria Measurement - Cost • Commitment (size and duration) • Lease vs. buy • Provision for expansion (flexibility) • Choice of provider (where competition exists) TCOM 540/1

  17. Criteria Measurement - Delay • Single parameter inadequate to describe a distribution • Measurement • User may inject test packets - requires diligence • Or rely on provider’s data • Delay may depend on traffic characteristics - e.g., time of day TCOM 540/1

  18. Criteria Measurement - Reliability • Measurement of infrequent events • May have to rely on provider to collect data • User may only notice that a circuit is down if he tries to use it • Single-point measurement inadequate to describe a probability distribution (e.g., lots of short outages vs. one long one) TCOM 540/1

  19. Circuit-Switched Two-Location Problem • Two locations (A and B), 200km apart • 5 employees in A, 10 in B • Assume • Each employee calls other site 4 times x 5 mins. per day • Each employee calls same site 10 times x 3 mins. per day TCOM 540/1

  20. Example Unit Costs TCOM 540/1

  21. Example Total Costs TCOM 540/1

  22. Phone Utilization TCOM 540/1

  23. . . . . . . Add PBXs • Local calls cost $487.50/month • All within same building! • Add PBXs at $120/mo PSTN PBX PBX 5 phones 5 10 10 phones A B TCOM 540/1

  24. Delete Unnecessary Trunks • Can delete 5 lines at B • Since these are now used only for long distance, and A has only 5 phones … TCOM 540/1

  25. Traffic Distribution and Measurement • Traffic peaks around 11 am and 2 pm • Assume 20% of traffic in “busy hour” • (Voice) traffic is measured in Erlangs • Erlangs = arrival rate/departure rate • E.g., if calls arrive at 2 per minute and hold for 3 minutes, then: • Arrival rate = 2 per minute • Departure rate = 0.3333 per minute • Traffic = 2/(0.3333) = 6 Erlangs TCOM 540/1

  26. Traffic Parameters • In the example, we had 300 call mins per day • So 0.2 x 300 = 60 call mins are in the busy hour • Each call is 5 mins long, so 12 calls arrive per hour • That is 0.2 calls per minute arrival rate TCOM 540/1

  27. Traffic Parameters (2) • Assume we have 5 lines • So there can be 0, 1, 2, 3, 4, or 5 calls present • Departure rate is no. of calls/call duration • That is n/5 calls per minute departure rate • Note – if a call arrives when all lines are busy it is lost – this is called “blocking” TCOM 540/1

  28. Traffic Parameters (3) 0.2 0.2 0.2 0.2 0.2 • Define Pn = probability there are n calls in the system, n = 0, 1, …, 5 • P1 = P0; P2 = P1/2; P3 = P2/3; P4 = P3/4; P5 = P4/5 • So Pn = P0/n! 0 1 2 3 4 5 0.2 0.6 0.8 1.0 0.4 TCOM 540/1

  29. Sizing Long Distance Link • Long distance link is sized so that desired blocking is not exceeded • With 5 lines, P5 = blocking probability • P5 = 0.31% • With 4 lines, blocking probability would be 1.54% • Lines may be dedicated or dial up TCOM 540/1

  30. Traffic Carried by Lines TCOM 540/1

  31. Simplifying Assumption – Traffic Profile • Assume just two levels of traffic • 2 peak hours at 60 mins/hr • 6 other hours at 30 mins/hr • Total dial costs • Peak: 60 x 2 x $0.40 x 21.6667 = $1040/month • Other: 30 x 6 x $0.40 x 21.6667 = $1560/month TCOM 540/1

  32. Designing the Long Distance Link • First dedicated line carries 50% of peak traffic @ 0.5 x $1040 = $520 per month • Cost of line is $225/month, net of access lines – makes sense to keep it • Second line carries 30% @ 0.3 x $1040 = $312/month – keep this one too • Third line carries 13.75% @ 0.1375 x $1040 = $143, etc. TCOM 540/1

  33. Designing the Long Distance Link (2) • In order to justify lines 3 through 5, we must • add the value of non-peak traffic carried TCOM 540/1

  34. Erlang Recursion • Let B(E, n) = blocking when E Erlangs of traffic offered to n lines • Then B(E, n) = E*B(E, n-1)/(E*B(E, n-1) + n) TCOM 540/1

  35. Designing the Long Distance Link (3) • For off-peak hours B(0.5, 1) = 0.3333 • Value of off-peak traffic carried by line 1 is (1 – 0.3333)*$1560 = $1040/month • Total value of traffic carried by line 1 is $520 (peak) + $1040 (off-peak) TCOM 540/1

  36. Designing the Long Distance Link (4) • B(0.5, 2) = 0.5*0.3333/(0.5*0.3333+2) • Value of off-peak traffic carried by line 2 is (0.3333-0.0769)*$1560 = $400/month • Total value of traffic carried by line 2 is $312 (peak) + $400 (off-peak) = $712 = 0.0769 TCOM 540/1

  37. Designing the Long Distance Link (5) • Similarly, value of traffic carried by line 3 is $143 (peak) + $100.25 (off-peak) = $243 • This is just $18 more than the $225 cost of the line • Lines 4 and 5 fail to be justified TCOM 540/1

  38. Long Distance Summary TCOM 540/1

  39. Final Design TCOM 540/1

  40. Final Design (2) • Cost reduction from $3462.50 per month (slide 14) to $1126 per month TCOM 540/1

  41. Comments on Voice Example • This example is showing its age • Nobody pays $0.40/min for voice • Large users may pay as little as $0.03/min • Dedicated DS0 costs at $275/month may be high • Access line charges at $25/month may be low TCOM 540/1

  42. Data • Data is harder to classify than voice traffic • Many different types – email, file transfer, web browsing, database access, … • While voice is circuit switched, data is (usually) packet, cell, frame switched • Different data streams using the same circuit contend for the same bandwidth • Data is bursty – high peak to average ratio TCOM 540/1

  43. Contention • Happens when two or more users want to transmit data over the link simultaneously • Resolution by coordination or queueing • Wide area networks generally rely on queueing TCOM 540/1

  44. Data (2) • Data network design principles are different from voice • Voice likes highly-utilized links • Data hates highly utilized links TCOM 540/1

  45. Queuing Theory (1) • Needed to understand/calculate link delays • Store-and-forward • Service time = packet size/link speed • Delay determined by packet size distribution and packet arrival distribution TCOM 540/1

  46. Queuing Theory (2) • Service time is N/S, where: • N = number of bits/packet • S = link speed in bits/sec • Assume interarrival and packet length PDFs are of form c*exp(-c*x) • Called an M/M/1 queue TCOM 540/1

  47. Queuing Theory (3) • Define r = ratio of arrival rate (l) to service rate (m) • Average waiting time Tw = (r/m)/(1- r) • Average service time Ts = 1/ m • Average total time = Ts + Tw = (1/m)/(1-r) TCOM 540/1

  48. Queuing Theory (4) • Note these are only valid when r < 1 • I.e., when arrival rate < service rate • As r approaches 1, delays get long • Practically, knee in curve about 70% utilization TCOM 540/1

  49. Cahn Data Network Example • Three locations • Four types of traffic – internal email, external email, WWW, database access • Multiple components/speeds • Make assumptions to build traffic model • Traffic per employee • Each source can be modeled by the average flow – law of large numbers TCOM 540/1

  50. Build Traffic Matrix TCOM 540/1

More Related