Sökning: "OSPF"
Visar resultat 1 - 5 av 6 avhandlingar innehållade ordet OSPF.
1. Optimization Models and Methods for Telecommunication Networks using OSPF
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
2. Optimization in the Design of OSPF Telecommunication Networks
Sammanfattning : This thesis address optimization problems related to the design of lP (Internet Protocol) networks. One of the most commonly used IGP's (Interior Gateway Protocols) in telecommunication networks is the OSPF (Open Shortest Path First) protocol with ECM (Equal Cost Multipath) distribution. LÄS MER
3. Constraint Programming Methods for Optimization of Single Shortest Path Routing
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. Shortest Path Routing Modelling, Infeasibility and Polyhedra
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
5. Network overload avoidance by traffic engineering and content caching
Sammanfattning : The Internet traffic volume continues to grow at a great rate, now driven by video and TV distribution. For network operators it is important to avoid congestion in the network, and to meet service level agreements with their customers. LÄS MER