slide1 n.
Download
Skip this Video
Loading SlideShow in 5 Seconds..
Atlanta PowerPoint Presentation
Download Presentation
Atlanta

Loading in 2 Seconds...

play fullscreen
1 / 11
orson-bailey

Atlanta - PowerPoint PPT Presentation

90 Views
Download Presentation
Atlanta
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. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.

- - - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript

  1. HW #1 (20 points) Consider the network: 2 Boston Chicago San Francisco 3 6 7 New York Los Angeles 5 1 4 Atlanta Dallas Figure 1. Example Problem 1

  2. Distance Matrix – in km

  3. Traffic Matrix – in bits per second - bps

  4. Cost: You can install 64,000 bps links at a monthly cost of $0.40 per km per month Suppose you have traffic on the link CHI-DAL at the following rate: CHI-DAL = 70,000 bps DAL-CHI = 80,000 bps Cost = 2 (64 K lines) x 0.40 ($) x 1448 = $1158.40/month

  5. Determine the routing and least cost network required to service the traffic. Routing Answer: ATL-BOS: ATL-DAL-CHI-BOS 50,000 bps BOS-LA: BOS-CHI-DAL-LA 90,000 bps Link Flows & Cost Answer: ATL-DAL: 50,000 1x0.40x1287 = 514.8 CHI-DAL: 90,000 2x0.40x1448 = 1158.4 BOS-CHI: 90,000 2x0.4x1609 = 1029.76 DAL-LA: 90,000 2x0.4x2253 = 1802.4 Total Network Cost: $4505.36

  6. Note: For the 2 demands, there was a unique route for each. If there are multiple routes, then select the one or ones by splitting the demand that yield the least cost network. If there is traffic on a link from two different point-to-point pairs, then the traffic is summed. BOS-LA: 90,000 bps and SF-LA: 10,000 bps results in flow on the link CHI-DAL 0f 100,000 bps.

  7. You must solve a similar problem on this network. 2 Boston Chicago San Francisco 3 6 7 New York Los Angeles 5 1 4 Atlanta Dallas Figure 2. Example Problem 2

  8. Traffic Matrix – in bits per second – bps (K = 1000)

  9. Determine the routing for each of the traffic demands. You can split traffic to achieve a smaller total cost. Routing Answer: BOS-LA: ___________________________ NY-SF: ____________________________ ATL-SF: ____________________________

  10. Link Flows & Cost: ATL-CHI: ATL-DAL: ATL-LA: ATL-NY: BOS-CHI: BOS-NY: CHI-DAL: CHI-NY:

  11. CHI-SF: DAL-LA: DAL-SF: LA-SF: TOTAL NETWORK COST: __________________