Description

This thesis addresses the following fundamental maximum throughput routing problem: Given an arbitrary edge-capacitated n-node directed network and a set of k commodities, with source-destination pairs (s_i,t_i) and demands d_i>

This thesis addresses the following fundamental maximum throughput routing problem: Given an arbitrary edge-capacitated n-node directed network and a set of k commodities, with source-destination pairs (s_i,t_i) and demands d_i> 0, admit and route the largest possible number of commodities -- i.e., the maximum throughput -- to satisfy their demands.

966.42 KB application/pdf

Download count: 0

Details

Contributors
Date Created
  • 2020
Resource Type
  • Text
  • Collections this item is in
    Note
    • Masters Thesis Computer Science 2020

    Machine-readable links