Traffic engineering using multiple multipoint-to-point LSPs

Saitō, Hiroshi; Miyao, Yasuhiro; Yoshida, Mikio

doi:10.1109/infcom.2000.832264

Cited by 60 publications

(65 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…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%

“…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%

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

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: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

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

“…no changes are needed in the current standard. ing labels per LSR 1 and, therefore, the number of NHLFEs in LSRs forwarding tables [3], [5], [8], [9], [10].…”

Section: Introductionmentioning

confidence: 99%

Full label space reduction in MPLS networks: asymmetric merged tunneling

2005

View full text Add to dashboard Cite

show abstract

“…In [5], [9] and [10], algorithms that find P2P LSPs which can be merged into a minimal number of MP2P LSPs are considered. Reference [10] proves an upper bound of N (number of nodes) + M (number of links) for the label space.…”

Section: Label Space Reduction Methodsmentioning

confidence: 99%

“…Reference [10] proves an upper bound of N (number of nodes) + M (number of links) for the label space. In these works ( [5], [9] and [10]), note that minimising the label space is a base criterion to find out LSP' routes. Because ISP's customer's requirements are often measured as QoS requirements (flow dependent), we think that the label space should not be considered as an objective function (at most a model restriction) in any optimisation model that deals with finding LSP's path.…”

Section: Label Space Reduction Methodsmentioning

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

Traffic engineering using multiple multipoint-to-point LSPs

Cited by 60 publications

References 7 publications

Designing Hypergraph Layouts to GMPLS Routing Strategies

Designing Hypergraph Layouts to GMPLS Routing Strategies

Full label space reduction in MPLS networks: asymmetric merged tunneling

Asymmetric tunnels in P2MP LSPs as a label space reduction method

Contact Info

Product

Resources

About