Scalable resource and admission management in class-based networks

Logota, Evariste; Campos, Carlos; Sargento, Susana; Neto, Augusto

doi:10.1109/iccw.2013.6649400

Cited by 2 publications

(3 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the works of Hernández and Vila 7 and Anjali et al, 8 authors examined how to dynamically determine and adjust the optimal bandwidth reserved for traffic to minimize the resource consumption while still ensuring the service quality. Moreover, in related works, [9][10][11][12] authors researched how to use the multiflow aggregation bandwidth overprovisioning method to reduce the signaling overhead in bandwidth reservation.…”

Section: Bandwidth Reservation In Mpls Networkmentioning

confidence: 99%

“…Therefore, from the perspective of load balancing, it is desirable that the available bandwidth after reservation of every link is the same (representing as C ′ ). However, with the constraints of (9), (10), and (11), the reserved bandwidth C i in link (i, j) should be represented as (12), ie,…”

Section: Algorithm Designmentioning

confidence: 99%

“…The initial path r 0 is generated and only contains the source node. Then, we use the width-first traversal algorithm to find all feasible paths from source to destination (line [4][5][6][7][8][9][10][11][12][13][14][15][16]. Thereinto, set P is used to store all possible paths generated by the algorithm, and set S is used to store all the paths from source to destination.…”

Section: Definition 1 a Path Can Be Denoted By 4 Tuples Asmentioning

confidence: 99%

See 2 more Smart Citations

Nonuniform bandwidth reservation for tunnels in MPLS network using meter tables of OpenFlow

Huang

Shen

Zhou

et al. 2018

Trans Emerging Tel Tech

View full text Add to dashboard Cite

Resource reservation protocol‐traffic engineering (RSVP‐TE) is one of the most widely used technologies to construct multiprotocol label switching tunnels across wide area network. In RSVP‐TE, along the path selected by the constrained shortest path first algorithm, resource is allocated using RSVP at each hop to provide deterministic end‐to‐end service quality, such as rate, delay, packet loss, and jitter. However, we argue that the flat and uniform bandwidth reservation mechanism of RSVP, which reserves the same bandwidth at each hop along the tunnel, ignore the difference of available bandwidth of these links, resulting in that the bandwidth of some congested links are quickly exhausted, whereas other links are not fully utilized. To further improve the load balancing and resource utilization of the network, a nonuniform bandwidth reservation (NUBR) method is proposed in this paper. With the proposed method, each node along the tunnel can flexibly reserve different bandwidth according to its own available resources. Thus, the reserved bandwidth at the congested links can be decreased by aggressively overreserving at idle links. In this paper, we introduce the concept of NUBR and explore the implementation based on the meter table of OpenFlow. The mathematical models and algorithms of NUBR have been studied under 2 application scenarios. At last, the simulation results show that the proposed method can allow more multiprotocol label switching tunnels than the traditional uniform bandwidth reservation method.

show abstract