liu.seSearch for publications in DiVA
Endre søk
Begrens søket
1 - 18 of 18
RefereraExporteraLink til resultatlisten
Permanent link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Treff pr side
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sortering
  • Standard (Relevans)
  • Forfatter A-Ø
  • Forfatter Ø-A
  • Tittel A-Ø
  • Tittel Ø-A
  • Type publikasjon A-Ø
  • Type publikasjon Ø-A
  • Eldste først
  • Nyeste først
  • Skapad (Eldste først)
  • Skapad (Nyeste først)
  • Senast uppdaterad (Eldste først)
  • Senast uppdaterad (Nyeste først)
  • Disputationsdatum (tidligste først)
  • Disputationsdatum (siste først)
  • Standard (Relevans)
  • Forfatter A-Ø
  • Forfatter Ø-A
  • Tittel A-Ø
  • Tittel Ø-A
  • Type publikasjon A-Ø
  • Type publikasjon Ø-A
  • Eldste først
  • Nyeste først
  • Skapad (Eldste først)
  • Skapad (Nyeste først)
  • Senast uppdaterad (Eldste først)
  • Senast uppdaterad (Nyeste først)
  • Disputationsdatum (tidligste først)
  • Disputationsdatum (siste først)
Merk
Maxantalet träffar du kan exportera från sökgränssnittet är 250. Vid större uttag använd dig av utsökningar.
  • 1.
    Broström, Peter
    Linköpings universitet, Matematiska institutionen, Optimeringslära. Linköpings universitet, Tekniska högskolan.
    Optimization in the Design of OSPF Telecommunication Networks2004Licentiatavhandling, med artikler (Annet vitenskapelig)
    Abstract [en]

    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. This link state based protocol uses link weights, which usually are set by an network operator, for providing routers necessary information regarding how traffic should be routed. By shortest path computations, router decide by themselves how to distribute the traffic.

    One problem considered in this thesis is the problem of designing networks which are capable of accommodating large parts of the traffic when network components fails. Link failures are the most common failures, and this is the kind of disturbance which is considered. A multiobjective optimization model is presented and we search for pareto-optimal solutions using a two-phased weight based search method. This method tries to minimize the design cost simultaneously as the level of network survivability is maximized. This method uses the fact that is is easy to compute how traffic is distributed when the OSPF metric is known.

    In contrary, it is a much more difficult task to determine if there are any OSPF weights that yield a desired flow distribution. This is a topic which also is studied in the thesis. Necessary conditions, which flow patterns must fulfill for being identical to the shortest paths obtained from OSPF weights, are reported. Sufficient conditions for a special type of flow patterns are also presented. The thesis also contains a polynomial method which can be used for detecting impossibilities in a set of flow patterns when this set do not correspond to the shortest paths of any OSPF weights.

    Flow patterns are the basis for a new model which is developed for designing lP networks where OSPF and ECM distribution is used . This model uses a set of in-graphs in order to represent weights implicitly. The model also uses a new set of constraints used for modeling ECM distribution. The usefulness of the model is verified by computational experiments.

    Delarbeid
    1. Multiobjective design of survivable IP networks
    Åpne denne publikasjonen i ny fane eller vindu >>Multiobjective design of survivable IP networks
    2006 (engelsk)Inngår i: Annals of Operations Research, ISSN 0254-5330, E-ISSN 1572-9338, Vol. 147, nr 1, s. 235-253Artikkel i tidsskrift (Fagfellevurdert) Published
    Abstract [en]

    Modern communication networks often use Internet Protocol routing and the intra-domain protocol OSPF (Open Shortest Path First). The routers in such a network calculate the shortest path to each destination and send the traffic on these paths, using load balancing. The issue of survivability, i.e. the question of how much traffic the network will be able to accommodate if components fail, is increasingly important. We consider the problem of designing a survivable IP network, which also requires determining the routing of the traffic. This is done by choosing the weights used for the shortest path calculations.

    Emneord
    Internet protocol, Network design, OSPF, Survivability, Weight optimization
    HSV kategori
    Identifikatorer
    urn:nbn:se:liu:diva-50114 (URN)10.1007/s10479-006-0067-y (DOI)
    Tilgjengelig fra: 2009-10-11 Laget: 2009-10-11 Sist oppdatert: 2017-12-12
    2. Determining the Non-Existence of a Compatible OSPF Metric
    Åpne denne publikasjonen i ny fane eller vindu >>Determining the Non-Existence of a Compatible OSPF Metric
    2004 (engelsk)Rapport (Annet vitenskapelig)
    Abstract [en]

    Many telecommunication networks use Internet Protocol for deciding the routing of traffic. The specifications OSPF (Open Shortest Path First) and ECM (Equal Cost Multipath) are very common, and state that each router sends the traffic on the shortest path to the destination. If there are several shortest path, the router splits the traffic evenly. In order to have some control over the traffic distribution, the operator can assign weights to the links in the network, and these weights are used by the routers when calculating the shortest paths. It has been shown that by optimizing over the values of the weights, the performance of a network can be much improved. A difficult question is whether or not for a set of desired traffic patterns there exists a compatible metric, i.e. weights making the routers give the specified traffic patterns. There is one known necessary condition for the existence of such a metric, but up to now no sufficient conditions. We investigate this problem, and find more general necessary conditions for the existence of compatible weights for a set of given desired "shortest path"-graphs. A polynomial algorithm that for most cases verifies the non-existence of a compatible metric is presented. The algorithm also indicates which parts of the traffic patterns that are in conflict. A few numer;cal examples are used to illustrate the procedure, and some computational tests are reported.

    sted, utgiver, år, opplag, sider
    Linköping: University of Linköping, Department of Mathematics, 2004. s. 42
    Serie
    LiTH-MAT-R, ISSN 0348-2960 ; 6
    Emneord
    Internet protocol, OSPF, compatible metric, optimization
    HSV kategori
    Identifikatorer
    urn:nbn:se:liu:diva-22362 (URN)1569 (Lokal ID)1569 (Arkivnummer)1569 (OAI)
    Tilgjengelig fra: 2009-10-07 Laget: 2009-10-07 Sist oppdatert: 2013-11-06
    3. Stronger Necessary Conditions for the Existence of a Compatible OSPF Metric
    Åpne denne publikasjonen i ny fane eller vindu >>Stronger Necessary Conditions for the Existence of a Compatible OSPF Metric
    2004 (engelsk)Rapport (Annet vitenskapelig)
    Abstract [en]

    A dominating standard for routing in telecommunication networks is Internet Protocol with OSPF (Open Shortest Path First) and ECM (Equal Cost Multipath). Each router sends the traffic on the shortest path to the destination. If there are several shortest path, the router splits the traffic evenly. The operator can assign weights to the links in the network, which are used by the routers when calculating the shortest paths. An important question is whether or not for a set of desired traffic patterns there exists a compatible metric, i.e. weights making the routers give the specified traffic patterns. We describe necessary conditions, stronger than those previously discovered, for the existence of compatible weights for a set of given desired shortest path-graphs.

    sted, utgiver, år, opplag, sider
    Linköping: Linköpings universitet, 2004. s. 24
    Serie
    LiTH-MAT-R, ISSN 0348-2960 ; 8
    Emneord
    Internet protocol, OSPF, compatible metric, optimization
    HSV kategori
    Identifikatorer
    urn:nbn:se:liu:diva-22361 (URN)1568 (Lokal ID)1568 (Arkivnummer)1568 (OAI)
    Tilgjengelig fra: 2009-10-07 Laget: 2009-10-07 Sist oppdatert: 2013-11-06
    4. Design of IP/OSPF Networks Using a Lagrangean Heuristic on an In-graph Based Model
    Åpne denne publikasjonen i ny fane eller vindu >>Design of IP/OSPF Networks Using a Lagrangean Heuristic on an In-graph Based Model
    2005 (engelsk)Inngår i: Proceedings of the International Network Optimization Conference, INOC 2005 / [ed] L. Gouveia and C. Mourao, Lisbon, Portugal: University of Lisbon , 2005, s. 702-Konferansepaper, Publicerat paper (Fagfellevurdert)
    Abstract [en]

    This paper address the problem of designing IP networks where traffic is distributed in accordance with the OSPF protocol. Routers use link weights for determining how traffic is distributed. All shortest paths between pairs of routers are used and the traffic is evenly divided when several paths are shortest. We formulate a new model for the design of IP networks with OSPF and ECM distribution where weights are implicitly included. Necessary constraints for representing the shortest paths obtained from link weights by in-graphs are described. A Lagrangean heuristic is developed for verifying the usefulness of the model. Numerical experiments on test problems shows that acceptable gaps are obtained in reasonable time.

    sted, utgiver, år, opplag, sider
    Lisbon, Portugal: University of Lisbon, 2005
    Emneord
    Internet Protocol, OSPF, network design, in-graph
    HSV kategori
    Identifikatorer
    urn:nbn:se:liu:diva-30654 (URN)16250 (Lokal ID)16250 (Arkivnummer)16250 (OAI)
    Konferanse
    INOC 2005: Lisbon, Portugal, March 20-23, 2005
    Tilgjengelig fra: 2009-10-09 Laget: 2009-10-09 Sist oppdatert: 2013-11-06
  • 2.
    Broström, Peter
    Linköpings universitet, Matematiska institutionen, Optimeringslära. Linköpings universitet, Tekniska högskolan.
    Optimization Models and Methods for Telecommunication Networks using OSPF2006Doktoravhandling, monografi (Annet vitenskapelig)
    Abstract [en]

    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.

    This thesis includes models and methods for various problems related to OSPF networks and OSPF routing. Two different models for the design of OSPF networks are presented. One model ensures that the network is capable of accommodating large parts of the traffic even if a single link fails. The OSPF protocol is modeled using constraints based on weights, and a heuristical method uses the link weights for generating good feasible solutions. The second model is based on routing patterns and does not include the link weights. The OSPF protocol is modeled by ensuring that no pair of routing patterns contains different paths between the same pair of nodes, which is a necessary condition for the existence of weights. A Lagrangean heuristic is proposed as solution method.

    The thesis also includes models that can be used for determining if a set of desired routing patterns is obtainable in an OSPF network. The models are infeasible if no link weights yield shortest path graphs which are identical to the patterns, and this means that the patterns can not be used simultaneously in an OSPF network. Infeasible instances are characterized using LP-duality, and a certain structure called “valid cycle” is found in most infeasible instances. A valid cycle involves two routing patterns and indicates which parts of the patterns that are in conflict. This information can be used for finding weights that yields slightly modified patterns. Polynomial methods which can be used for finding valid cycles are presented. There are however also some infeasible instances where no valid cycle exists, so the absence of valid cycles is a necessary condition for the existence of weights. In this case, the conflict involves more than two routing patterns, and such conflicts are characterized by a structure called “3-valid set of cycles”. The absence of 3-valid sets of cycles is a stronger necessary condition for the existence of weights.

  • 3.
    Broström, Peter
    et al.
    Linköpings universitet, Tekniska högskolan. Linköpings universitet, Matematiska institutionen, Optimeringslära.
    Holmberg, Kaj
    Linköpings universitet, Tekniska högskolan. Linköpings universitet, Matematiska institutionen, Optimeringslära.
    A new derivation of valid cycles2005Rapport (Annet vitenskapelig)
  • 4.
    Broström, Peter
    et al.
    Linköpings universitet, Tekniska högskolan. Linköpings universitet, Matematiska institutionen, Optimeringslära.
    Holmberg, Kaj
    Linköpings universitet, Tekniska högskolan. Linköpings universitet, Matematiska institutionen, Optimeringslära.
    Compatible Weights and Valid Cycles in Non-spanning OSPF Routing Patterns2007Rapport (Annet vitenskapelig)
  • 5.
    Broström, Peter
    et al.
    Linköpings universitet, Matematiska institutionen, Optimeringslära. Linköpings universitet, Tekniska högskolan.
    Holmberg, Kaj
    Linköpings universitet, Matematiska institutionen, Optimeringslära. Linköpings universitet, Tekniska högskolan.
    Compatible Weights and Valid Cycles in Non-spanning OSPF Routing Patterns2009Inngår i: Algorithmic Operations Research, ISSN 1718-3235, Vol. 4, nr 1, s. 19-35Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    Many IP (Internet Protocol) networks use OSPF (Open Shortest Path First) for determining the routing of traffic. OSPF routers compute routing paths using link weights set by the network administrator, and the routers send traffic on all shortest paths to the destination. An interesting question is whether or not a set of prespecified routing patterns can be realized in an OSPF network. If not, we seek structural properties that explain why no such weights exist. Mathematical models for finding weights and for combining routing patterns are presented. We show that two possibly non-spanning routing patterns forming a ``valid cycle'' cannot simultaneously be obtained in an OSPF network. Two new methods for finding valid cycles are presented, illustrated by numerical examples, and shown to be faster that those previously known.

  • 6.
    Broström, Peter
    et al.
    Linköpings universitet, Tekniska högskolan. Linköpings universitet, Matematiska institutionen, Optimeringslära.
    Holmberg, Kaj
    Linköpings universitet, Tekniska högskolan. Linköpings universitet, Matematiska institutionen, Optimeringslära.
    Design of OSPF Networks using Subpath Consistent Routing Patterns2007Rapport (Annet vitenskapelig)
  • 7.
    Broström, Peter
    et al.
    Linköpings universitet, Tekniska högskolan. Linköpings universitet, Matematiska institutionen, Optimeringslära.
    Holmberg, Kaj
    Linköpings universitet, Tekniska högskolan. Linköpings universitet, Matematiska institutionen, Optimeringslära.
    Determining the Non-Existence of a Compatible OSPF Metric2004Inngår i: Nordic MPS 2004,2004, 2004Konferansepaper (Annet vitenskapelig)
  • 8.
    Broström, Peter
    et al.
    Linköpings universitet, Matematiska institutionen, Optimeringslära. Linköpings universitet, Tekniska högskolan.
    Holmberg, Kaj
    Linköpings universitet, Matematiska institutionen, Optimeringslära. Linköpings universitet, Tekniska högskolan.
    Determining the Non-Existence of a Compatible OSPF Metric2004Rapport (Annet vitenskapelig)
    Abstract [en]

    Many telecommunication networks use Internet Protocol for deciding the routing of traffic. The specifications OSPF (Open Shortest Path First) and ECM (Equal Cost Multipath) are very common, and state that each router sends the traffic on the shortest path to the destination. If there are several shortest path, the router splits the traffic evenly. In order to have some control over the traffic distribution, the operator can assign weights to the links in the network, and these weights are used by the routers when calculating the shortest paths. It has been shown that by optimizing over the values of the weights, the performance of a network can be much improved. A difficult question is whether or not for a set of desired traffic patterns there exists a compatible metric, i.e. weights making the routers give the specified traffic patterns. There is one known necessary condition for the existence of such a metric, but up to now no sufficient conditions. We investigate this problem, and find more general necessary conditions for the existence of compatible weights for a set of given desired "shortest path"-graphs. A polynomial algorithm that for most cases verifies the non-existence of a compatible metric is presented. The algorithm also indicates which parts of the traffic patterns that are in conflict. A few numer;cal examples are used to illustrate the procedure, and some computational tests are reported.

  • 9.
    Broström, Peter
    et al.
    Linköpings universitet, Tekniska högskolan. Linköpings universitet, Matematiska institutionen, Optimeringslära.
    Holmberg, Kaj
    Linköpings universitet, Tekniska högskolan. Linköpings universitet, Matematiska institutionen, Optimeringslära.
    Internet Protocol Network Design and Routing2003Inngår i: 18th International Symposium on Mathematical Programming,2003, 2003Konferansepaper (Annet vitenskapelig)
  • 10.
    Broström, Peter
    et al.
    Linköpings universitet, Tekniska högskolan. Linköpings universitet, Matematiska institutionen, Optimeringslära.
    Holmberg, Kaj
    Linköpings universitet, Tekniska högskolan. Linköpings universitet, Matematiska institutionen, Optimeringslära.
    Multiobjective design of survivable IP networks2004Rapport (Annet vitenskapelig)
  • 11.
    Broström, Peter
    et al.
    Linköpings universitet, Matematiska institutionen, Optimeringslära. Linköpings universitet, Tekniska högskolan.
    Holmberg, Kaj
    Linköpings universitet, Matematiska institutionen, Optimeringslära. Linköpings universitet, Tekniska högskolan.
    Multiobjective design of survivable IP networks2006Inngår i: Annals of Operations Research, ISSN 0254-5330, E-ISSN 1572-9338, Vol. 147, nr 1, s. 235-253Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    Modern communication networks often use Internet Protocol routing and the intra-domain protocol OSPF (Open Shortest Path First). The routers in such a network calculate the shortest path to each destination and send the traffic on these paths, using load balancing. The issue of survivability, i.e. the question of how much traffic the network will be able to accommodate if components fail, is increasingly important. We consider the problem of designing a survivable IP network, which also requires determining the routing of the traffic. This is done by choosing the weights used for the shortest path calculations.

  • 12.
    Broström, Peter
    et al.
    Linköpings universitet, Tekniska högskolan. Linköpings universitet, Matematiska institutionen, Optimeringslära.
    Holmberg, Kaj
    Linköpings universitet, Tekniska högskolan. Linköpings universitet, Matematiska institutionen, Optimeringslära.
    On the Extremal Structure of an OSPF Related Cone2007Inngår i: Vietnam journal of mathematics, ISSN 0866-7179, Vol. 35, s. 507-522Artikkel i tidsskrift (Fagfellevurdert)
  • 13.
    Broström, Peter
    et al.
    Linköpings universitet, Tekniska högskolan. Linköpings universitet, Matematiska institutionen, Optimeringslära.
    Holmberg, Kaj
    Linköpings universitet, Tekniska högskolan. Linköpings universitet, Matematiska institutionen, Optimeringslära.
    On the Extremal Structure of an OSPF Related Cone2006Rapport (Annet vitenskapelig)
  • 14.
    Broström, Peter
    et al.
    Linköpings universitet, Matematiska institutionen, Optimeringslära. Linköpings universitet, Tekniska högskolan.
    Holmberg, Kaj
    Linköpings universitet, Matematiska institutionen, Optimeringslära. Linköpings universitet, Tekniska högskolan.
    Stronger Necessary Conditions for the Existence of a Compatible OSPF Metric2004Rapport (Annet vitenskapelig)
    Abstract [en]

    A dominating standard for routing in telecommunication networks is Internet Protocol with OSPF (Open Shortest Path First) and ECM (Equal Cost Multipath). Each router sends the traffic on the shortest path to the destination. If there are several shortest path, the router splits the traffic evenly. The operator can assign weights to the links in the network, which are used by the routers when calculating the shortest paths. An important question is whether or not for a set of desired traffic patterns there exists a compatible metric, i.e. weights making the routers give the specified traffic patterns. We describe necessary conditions, stronger than those previously discovered, for the existence of compatible weights for a set of given desired shortest path-graphs.

  • 15.
    Broström, Peter
    et al.
    Linköpings universitet, Matematiska institutionen, Optimeringslära. Linköpings universitet, Tekniska högskolan.
    Holmberg, Kaj
    Linköpings universitet, Matematiska institutionen, Optimeringslära. Linköpings universitet, Tekniska högskolan.
    Valid Cycles: A Source of Infeasibility in Open Shortest Path First Routing2008Inngår i: Networks, ISSN 0028-3045, E-ISSN 1097-0037, Vol. 52, nr 4, s. 206-215Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    Many telecommunication networks use the open shortest path first (OSPF) protocol for the routing of traffic. In such networks, each router sends the traffic on the shortest paths to the destination, with respect to the link weights assigned. An interesting question is whether or not a set of desired routing patterns can be obtained in an OSPF network by assigning appropriate weights. If not, we wish to find the source of the infeasibility. We study these issues by formulating a mathematical model and investigating its feasibility. A certain structure, called valid cycle, is found to be present in most infeasible instances. This yields new necessary conditions, stronger than those previously known, for the existence of weights yielding a set of given desired shortest path graphs. A valid cycle indicates which parts of the routing patterns are in conflict and can be used for changing the routing patterns to make the problem feasible. A polynomial algorithm for finding valid cycles is presented, the method is illustrated by a numerical example, and computational tests are reported.

  • 16.
    Holmberg, Kaj
    et al.
    Linköpings universitet, Matematiska institutionen, Optimeringslära. Linköpings universitet, Tekniska högskolan.
    Broström, Peter
    Linköpings universitet, Matematiska institutionen, Optimeringslära. Linköpings universitet, Tekniska högskolan.
    Design of IP/OSPF Networks Using a Lagrangean Heuristic on an In-graph Based Model2005Inngår i: Proceedings of the International Network Optimization Conference, INOC 2005 / [ed] L. Gouveia and C. Mourao, Lisbon, Portugal: University of Lisbon , 2005, s. 702-Konferansepaper (Fagfellevurdert)
    Abstract [en]

    This paper address the problem of designing IP networks where traffic is distributed in accordance with the OSPF protocol. Routers use link weights for determining how traffic is distributed. All shortest paths between pairs of routers are used and the traffic is evenly divided when several paths are shortest. We formulate a new model for the design of IP networks with OSPF and ECM distribution where weights are implicitly included. Necessary constraints for representing the shortest paths obtained from link weights by in-graphs are described. A Lagrangean heuristic is developed for verifying the usefulness of the model. Numerical experiments on test problems shows that acceptable gaps are obtained in reasonable time.

  • 17.
    Holmberg, Kaj
    et al.
    Linköpings universitet, Tekniska högskolan. Linköpings universitet, Matematiska institutionen, Optimeringslära.
    Broström, Peter
    Linköpings universitet, Tekniska högskolan. Linköpings universitet, Matematiska institutionen, Optimeringslära.
    Determining the Non-Existence of a Compatible OSPF Metric2005Inngår i: International Network Optimization Conference, INOC 2005,2005, Lisbon, Portugal: University of Lisbon, , 2005, s. 106-Konferansepaper (Fagfellevurdert)
  • 18.
    Holmberg, Kaj
    et al.
    Linköpings universitet, Tekniska högskolan. Linköpings universitet, Matematiska institutionen, Optimeringslära.
    Broström, Peter
    Linköpings universitet, Tekniska högskolan. Linköpings universitet, Matematiska institutionen, Optimeringslära.
    Stronger Necessary Conditions for the Existence of a Compatible OSPF Metric2004Inngår i: Nordic MPS 04,2004, 2004Konferansepaper (Annet vitenskapelig)
1 - 18 of 18
RefereraExporteraLink til resultatlisten
Permanent link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf