Browsing by Subject "Residual capacity"

Filter results by typing the first few letters
Now showing 1 - 2 of 2
  • Thumbnail Image
    ItemOpen Access
    Robust path design algorithms for traffic engineering with restoration in MPLS networks
    (IEEE, 2002-07) Yetginer, Emre; Karasan, Ezhan
    In this paper we study traffic engineering of restorable paths in multiprotocol label switching (MPLS) networks. We consider off-line computation of working and restoration paths with path rerouting as the restoration scheme. First we compute a link-disjoint path set for given set of demands. Using this path set we study four approaches for selecting working and restoration paths, and formulate each method as an integer linear programming (ILP) problem. A traffic uncertainty model is developed in order to compare these approaches based on their robustness with respect to changing traffic patterns. We obtain numerical results and compare these design approaches based on the number of additional demands carried and the distribution of residual capacity over the network. © 2002 IEEE.
  • Thumbnail Image
    ItemOpen Access
    The splittable flow arc set with capacity and minimum load constraints
    (Elsevier, 2013) Yaman, H.
    We study the convex hull of the splittable flow arc set with capacity and minimum load constraints. This set arises as a relaxation of problems where clients have demand for a resource that can be installed in integer amounts and that has capacity limitations and lower bounds on utilization. We prove that the convex hull of this set is the intersection of the convex hull of the set with a capacity constraint and the convex hull of the set with a minimum load constraint.