Sökning: "shortest path routing"

Visar resultat 1 - 5 av 10 avhandlingar innehållade orden shortest path routing.

  1. 1. Shortest Path Routing Modelling, Infeasibility and Polyhedra

    Författare :Mikael Call; Kaj Holmberg; Bernard Fortz; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : The Internet is constantly growing but the available resources, i.e. bandwidth, are limited. Using bandwidth efficiently to provide high quality of service to users is referred to as traffic engineering. LÄS MER

  3. 2. Constraint Programming Methods for Optimization of Single Shortest Path Routing

    Författare :Mats Petter Wallander; Data Vetenskap; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : In this thesis, we propose methods based on constraint programming (CP) for solving an optimization problem in telecommunications, the single shortest path routing problem. The problem is to find optimal values for a set of routing configuration parameters in a shortest path routing protocol, for a given network. LÄS MER

  4. 3. Inverse Shortest Path Routing Problems in the Design of IP Networks

    Författare :Mikael Call; Kaj Holmberg; Andreas Bley; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Optimization; systems theory; Optimeringslära; systemteori;

    Sammanfattning : This thesis is concerned with problems related to shortest pathrouting (SPR) in Internet protocol (IP) networks. In IP routing, alldata traffic is routed in accordance with an SPR protocol, e.g. OSPF. LÄS MER

  5. 4. On Optimization in Design of Telecommunications Networks with Multicast and Unicast Traffic

    Författare :Mikael Prytz; KTH; []
    Nyckelord :telecommunications; network design; network dimensioning; network configuration; multicast traffic; location; network optimization; Lagrangian decomposition; branch-and-bound; branch-and-cut; shortest path routing;

    Sammanfattning : .... LÄS MER

  7. 5. Optimization Models and Methods for Telecommunication Networks using OSPF

    Författare :Peter Broström; Michal Pióro; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Telecommunication; OSPF; LP-duality; Polynomial methods; MATHEMATICS; MATEMATIK;

    Sammanfattning : The routing in OSPF Telecommunication networks is determined by computing shortest paths with respect to link weights set by the network operator. All shortest paths to a destination are used by the routers when traffic is routed, and the routers split the traffic evenly when alternative shortest paths exist. LÄS MER