Dynamic widest path selection for connection admission control in core-stateless networks

Dumitrescu, A.

doi:10.1109/qshine.2004.20

Cited by 7 publications

(3 citation statements)

References 11 publications

(16 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Our approach was to eliminate all issues related to traffic parameter variations, flow policing, throughput control, ensuring fairness, delay and jitter control, etc., from the CAC process and let those issues be handled at other procedural levels (see packet handling procedures described in [11] and [12]) still keeping within the core stateless paradigm by transferring the required information through the dynamic packet state [7]. Consequently, the CAC procedure has only to take care that the edge-to-edge path chosen by the path selection algorithm [13] has the required characteristics (bandwidth + imposed restrictions) and it does not care if the flows are in-or out-of-profile. However, in order to ensure an effective operation (better accommodation of bursty traffic that is still in-profile on the average, treatment of best effort traffic, etc.…”

Section: Discussionmentioning

confidence: 99%

Efficient Distributed Admission Control for Core-Stateless Networks

Dumitrescu

2006

Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications

Self Cite

View full text Add to dashboard Cite

Providing service guarantees requires strict admission control to ensure that the resources are not over-allocated. On another hand, limiting the core nodes' role has been recognized as a key aspect in providing scalable Quality of Service (QoS) solutions. This paper presents a scalable multiple-token mechanism that ensures a distributed and coordinated resource allocation along the logical ring of the ingress/edge nodes. The proposed mechanism alleviates the scalability problem by keeping all the admission control operations in the ingress/edge nodes while preserving guaranteed service semantics. By distributing the available bandwidth of the links over multiple tokens, increased robustness and low latency under light load conditions are achieved, while the zero-false positives property is maintained. The erroneous connection denials, which could be due to the distribution of available bandwidth information, are avoided by an accumulation procedure that concentrates the available bandwidth information whenever necessary.

show abstract

Section: Discussionmentioning

confidence: 99%

Efficient Distributed Admission Control for Core-Stateless Networks

Dumitrescu

2006

Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications

Self Cite

View full text Add to dashboard Cite

show abstract

“…It was demonstrated in the works of Ali et al and Dumitrescu that the number of user connections that the network can accommodate is mainly limited by the available bandwidth of the bottleneck link so the load‐balancing performance is better when the available bandwidth of each link is more similar. 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′ ).…”

Section: Tunnel Optimization With Nubrmentioning

confidence: 99%

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

“…The algorithm that the maximum available bandwidth selected firstly was proposed by Avadora [6],which can deal with the problem that whether there is constraints from QoS parameter more better.…”

Section: Introductionmentioning

confidence: 99%

The Algorithm for Parallel Routing Searching Based on QosR Pareto Optimization

Qin

Xiao

et al. 2008

2008 International Conference on Advanced Language Processing and Web Information Technology

View full text Add to dashboard Cite

The QoS routing is based on the computing of each flow as regards the dynamic request, the routing computing is more frequent and the granularity of resource distribution is more smaller. Aiming at fast routing computing, the method of pre-computing for parallel computing based on QoS matrices is proposed: the Pareto subset of viable path which satisfy routing constrain will be taken into account, the suitable route will be selected among the Pareto subset. In other words, the routing problem can be divided into two problem: suitable path selection unconcerned with practical routing request and route optimize concerned with practical routing request.

show abstract

Dynamic widest path selection for connection admission control in core-stateless networks

Abstract: Abstract

Cited by 7 publications

References 11 publications

Efficient Distributed Admission Control for Core-Stateless Networks

Efficient Distributed Admission Control for Core-Stateless Networks

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

The Algorithm for Parallel Routing Searching Based on QosR Pareto Optimization

Contact Info

Product

Resources

About