Scribd Logo
Upload

Welcome to Scribd!

  • Crashing The Network

    Uploaded by

    Manuel Magadatu
    24 views17 pages
    The document describes an iterative process to determine the optimal path for crashing a network. It tracks crash activity limits and cost slopes over multiple iterations to identify critical paths with the lowest total cost. The optimal path found has a total cost of 22 with crash limits of 1 for B and H.

    Original Description:

    Original Title

    Crashing the Network

    Copyright

    © © All Rights Reserved

    Available Formats

    PPTX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document describes an iterative process to determine the optimal path for crashing a network. It tracks crash activity limits and cost slopes over multiple iterations to identify critical paths with the lowest total cost. The optimal path found has a total cost of 22 with crash limits of 1 for B and H.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    24 views17 pages

    Crashing The Network

    Uploaded by

    Manuel Magadatu
    The document describes an iterative process to determine the optimal path for crashing a network. It tracks crash activity limits and cost slopes over multiple iterations to identify critical paths with the lowest total cost. The optimal path found has a total cost of 22 with crash limits of 1 for B and H.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 17

    Crashing the

    Network
    Crash Activity Crash Limit (NT-CT) Cost Slope

    A 3 2000

    B 10 1000

    G 2 400

    H 1 1000
    Second Iteration:
    Crash Activity Crash Limit (NT-CT) Cost Slope

    A 3 2000

    B 10 1000

    G 0 400

    H 1 1000
    Third Iteration:
    Crash Activity Crash Limit Cost Slope
    A 3 2000
    B 6 1000
    Critical
    G 0 400 Path 1
    H 1 1000

    Crash Activity Crash Limit Cost Slope


    A 3 2000
    C 1 400 Critical
    D 2 6000
    G 0 400
    Path 2
    H 1 1000
    Fourth Iteration:

    A-B-G-H= 9+9+3+2 = 23
    A-C-D-G-H= 9+3+6+3+2= 23
    E-F-H= 14+6+2= 22
    Crash Activity Crash Limit Cost Slope
    A 3 2000
    B 5 1000
    Critical
    G 0 400 Path 1
    H 1 1000

    Crash Activity Crash Limit Cost Slope


    A 3 2000
    C 0 400 Critical
    D 2 6000
    G 0 400
    Path 2
    H 1 1000
    B, H 1 22 116200 44000 160200

    You might also like