Creating multipoint-to-point LSPs for traffic engineering

Bhatnagar, Sudeept; Ganguly, Samrat; Nath, Badri

doi:10.1109/hpsr.2003.1226705

Cited by 21 publications

(34 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Given an instance (G = (V, E), S ⊆ V ) of Minimum Steiner Tree problem on n vertices, we build an instance of Minimum Cost Symmetric Hypergraph Layout problem by subdividing Ω n 2 · rij ∈R m ij 4 Given a finite set S and a collection C of subsets of S, the aim is to find a subcollection C of C of minimum cardinality that covers all the elements of S. 5 Given an edge-weighted graph G = (V, E) and a subset S ⊆ V , find a connected subgraph with minimum edge-weight containing all the vertices in S. We can assume, by subdividing edges, that all edge-weights equal 1.…”

Section: Theoremmentioning

confidence: 99%

“…The label minimization problem in GMPLS networks has been widely studied in the literature during the last few years [5,[13][14][15][16][17]. All these articles focus mainly on proposing and analyzing heuristics to the problem, but there is a lack of theoretical results, like computational complexity or bounds on the approximation ratio of the proposed algorithms.…”

Section: Introductionmentioning

confidence: 99%

“…Solutions deployed by GMPLS for reducing the number of labels are label merging [5,13,15] (not discussed here) and label stacking [14,17]. With label stacking, when two or more LSPs follow the same set of links, they can be routed together "inside" a higher-level LSP, henceforth a tunnel.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Designing Hypergraph Layouts to GMPLS Routing Strategies

Bermond

Coudert

Mouliérac

et al. 2010

Structural Information and Communication Complexity

View full text Add to dashboard Cite

Abstract. All-Optical Label Switching (AOLS) is a new technology that performs packet forwarding without any Optical-Electrical-Optical (OEO) conversions. In this paper, we study the problem of routing a set of requests in AOLS networks using GMPLS technology, with the aim of minimizing the number of labels required to ensure the forwarding. We first formalize the problem by associating to each routing strategy a logical hypergraph whose hyperarcs are dipaths of the physical graph, called tunnels in GMPLS terminology. Such a hypergraph is called a hypergraph layout, to which we assign a cost function given by its physical length plus the total number of hops traveled by the traffic. Minimizing the cost of the design of an AOLS network can then be expressed as finding a minimum cost hypergraph layout. We prove hardness results for the problem, namely for general directed networks we prove that it is NPhard to find a C log n-approximation, where C is a a positive constant and n is the number of nodes of the network. For symmetric directed networks, we prove that the problem is APX-hard. These hardness results hold even is the traffic instance is a partial broadcast. On the other hand, we provide an O(log n)-approximation algorithm to the problem for a general symmetric network. Finally, we focus on the case where the physical network is a path, providing a polynomial-time dynamic programming algorithm for a bounded number of sources, thus extending the algorithm given in [2] for a single source.

show abstract

Section: Theoremmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Designing Hypergraph Layouts to GMPLS Routing Strategies

Bermond

Coudert

Mouliérac

et al. 2010

Structural Information and Communication Complexity

View full text Add to dashboard Cite

show abstract

“…OSPF -Open Shortest Path First) to generate the initial LSP. At the next step all simultaneous flows caused by former contracted SLAs have to be taken in calculation, too (correlation with other LSPs); see [4]. The BB (Bandwidth Broker) will therefore check if there are enough resources to satisfy the requested CoS in the specified path.…”

Section: Introductionmentioning

confidence: 99%

Traffic Routing Through Off-Line LSP Creation

Krile

Kuzumilovic

2007

Computational Science – ICCS 2007

View full text Add to dashboard Cite

Abstract. In the context of dynamic bandwidth allocation the QoS path provisioning for coexisted and aggregated traffic could be very important element of resource management. As we know all traffic in DiffServ/MPLS network is distributed among LSPs (Label Switching Path). Packets are classified in FEC (Forwarding Equivalence Class) and can be routed in relation to CoS (Class of Service). In the process of resource management we are looking for optimal LSP, taking care of concurrent flows traversing the network simultaneously. For better load-balancing purposes and congestion avoidance the LSP creation can be done off-line, possible during negotiation process. The main difference from well known routing techniques is that optimal LSP need not to be necessarily the shortest path solution as it is in the case of typical online routing (e.g. with OSPF protocol).

show abstract

“…Despite this is a sufficient number for label encoding in a single LSR, large enough NHLFE could cause long delays while a LSR looks up in its forwarding table for the next hop LSR each time a packet is received. Therefore, a smaller forwarding table will reduce LSR memory requirements and aids LSR to forward packets faster [4], [5] [6]. Now, considering Multi Protocol Lambda Switching (MPλS), this problem achieves a greater magnitude.…”

Section: Introductionmentioning

confidence: 99%

Asymmetric tunnels in P2MP LSPs as a label space reduction method

Solano

Fabregat

Donoso

et al.

IEEE International Conference on Communications, 2005. ICC 2005. 2005

View full text Add to dashboard Cite

-Traffic Engineering objective is to optimize network resource utilization. Although several works have been published about minimizing network resource utilization, few works have been focused in LSR label space. This paper proposes an algorithm that gets advantage of the MPLS label stack features in order to reduce the number of labels used in LSPs. Some tunnelling methods and their MPLS implementation drawbacks are also discussed. The described algorithm sets up the NHLFE tables in each LSR creating asymmetric tunnels when possible. Experimental results show that the described algorithm achieves a great reduction factor in the label space. The presented works applies for both types of connections: P2MP and P2P.

show abstract

Creating multipoint-to-point LSPs for traffic engineering

Cited by 21 publications

References 14 publications

Designing Hypergraph Layouts to GMPLS Routing Strategies

Designing Hypergraph Layouts to GMPLS Routing Strategies

Traffic Routing Through Off-Line LSP Creation

Asymmetric tunnels in P2MP LSPs as a label space reduction method

Contact Info

Product

Resources

About