A New Routing-Based Admission Control for MPLS Networks

Oulai, Desire; Chamberland, Steven; Pierre, Samuel

doi:10.1109/lcomm.2007.061618

Cited by 19 publications

(14 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Edge Admission Control is developed in [10] that computing admission thresholds and takes into account both the best-effort traffic's performance and QoS traffic's constraints. A routing-based admission control mechanism is presented for the IP traffic flows in MPLS networks, routing and admission control problem with multi-constrained end-to-end QoS is used in the presented CAC to improve MPLS networks [11].…”

Section: Introductionmentioning

confidence: 99%

Admission Control Algorithm for MPLS-TE Networks

Allah¹,

El-Fishawy²,

Elshennawy³

2017

IJCA

View full text Add to dashboard Cite

Today real-time applications involve, Voice over IP (VoIP) is gaining increasing popularity. MPLS is developed to combine properties of Data-Link Layer with the flexibility and robustness of datagram Network Layer in efficient traffic transmission and QoS support. Connection Admission Control (CAC) mechanism for the RSVP-TE in MPLS network leaks its availability to achieve high performance especially with the increased importance of real-time application that need high end-to-end QoS. So, in this paper, Connection Admission Control (CAC) mechanism is proposed with inputs parameters not only bandwidth but also end-to-end delay and jitter to making its decision. A simulation comparison using OPNET simulator between the proposed algorithm and the most used CAC is presented. The results indicate that the proposed algorithm outperforms the other one.

show abstract

Section: Introductionmentioning

confidence: 99%

Admission Control Algorithm for MPLS-TE Networks

Allah¹,

El-Fishawy²,

Elshennawy³

2017

IJCA

View full text Add to dashboard Cite

show abstract

“…Several other researchers have also attempted to address the problem of delay-constrained routing in recent years. For instance, in [14] a routing-based admission control mechanism that considers an end-to-end delay for the IP traffic flows was introduced. In [15], a routing algorithm was proposed to minimize an average of the queuing delay by using capacity allocation.…”

Section: Introductionmentioning

confidence: 99%

A novel Hα control strategy for design of a robust dynamic routing algorithm in traffic networks

Abdollahi

Khorasani

2008

IEEE J. Select. Areas Commun.

View full text Add to dashboard Cite

In this paper novel centralized and decentralized routing control strategies based on minimization of the worst-case queuing length are proposed. The centralized routing problem is formulated as an H∞ optimal control problem to achieve a robust routing performance in presence of multiple and unknown fast time-varying network delays. Unlike similar previous work in the literature the delays in the queuing model are assumed to be unknown and time-varying. A Linear Matrix Inequality (LMI) constraint is obtained to design a delay-dependent H∞ controller. The physical constraints that are present in the network are then expressed as LMI feasibility conditions. Our proposed centralized routing scheme is then reformulated in a decentralized frame work. This modification yields an algorithm that obtains the "fastest route", increases the robustness against multiple unknown time-varying delays, and enhances the scalability of the algorithm to large scale traffic networks. Simulation results are presented to illustrate and demonstrate the effectiveness and capabilities of our proposed novel dynamic routing strategies.

show abstract

“…A multitude of admission control mechanisms have been proposed for MPLS and GMPLS networks [1][2][3][4][5][6][7]. In [2], Oulai et al proposed a mathematical formulation for the admission control problem named JRAC, based on a given logical topology (set of LSPs in an MPLS domain).…”

Section: Introductionmentioning

confidence: 99%

“…In [2], Oulai et al proposed a mathematical formulation for the admission control problem named JRAC, based on a given logical topology (set of LSPs in an MPLS domain). Mathematical model aims to minimize the global delay in the network while admitting a new connection.…”

Section: Introductionmentioning

confidence: 99%