Measurement‐based admission control scheme with priority and service classes for application in wireless IP networks

Jamalipour, Abbas; Kim, Jade

doi:10.1002/dac.602

Cited by 10 publications

(9 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Examples of MBAC algorithms can be found in [9,24,25,26] and a comparison in [16,22,27] (and also in [28] for ATM). More specifically, the works in [22,27] describe and compare several AC algorithms (Measured Sum, Hoeffding Bounds, Tangent at Peak, Aggregate Traffic Envelopes, etc.)…”

Section: Classical Measurement-based Hop-by-hop Ac Schemesmentioning

confidence: 99%

A review of the architecture of admission control schemes in the Internet

Fàbrega

Jové

2013

NPA

View full text Add to dashboard Cite

Admission Control (AC) is an efficient way of dealing with congestion situations in a network. Using AC, when network resources in a path are not enough for all flows (i.e., during congestion), some of the flows receive the requested service and the rest do not. Congestion situations can be reduced by increasing network resources or by optimizing their use through better routing techniques, but if congestion still occurs, AC achieves efficient use of network resources by maximizing the number of satisfied flows. However, using AC complicates the network scheme, and therefore a major concern is making the AC as simple as possible. In this paper we review the main AC schemes that have been proposed for the Internet, focusing on the simplicity of their architectures in terms of the number of nodes that participate in the AC, the required state, the use of signaling, and others.

show abstract

Section: Classical Measurement-based Hop-by-hop Ac Schemesmentioning

confidence: 99%

A review of the architecture of admission control schemes in the Internet

Fàbrega

Jové

2013

NPA

View full text Add to dashboard Cite

show abstract

“…However, our scheme is able to provide different throughput to different flows as well as protection against non-responsive sources. Moreover, it also uses measurements, but it is built from the Assured Service scheme [6] and the set of AC methods that uses end-to-end per-flow measurements [7][8][9]. Our aim is to add AC to the Assured Service scheme also using a small set of packet classes.…”

Section: Our Scheme For a Guaranteed Minimum Throughput Servicementioning

confidence: 99%

“…Our AC method belongs to the schemes based on end-to-end measurements [7][8][9]. In these schemes end-points send a special probing flow and measure its experienced QoS to estimate the available resources over a network path.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A guaranteed minimum throughput service for TCP flows using measurement‐based admission control

Fàbrega

Jové

Vilà

et al. 2006

Int J Communication

View full text Add to dashboard Cite

SUMMARYWe propose a new scheme for a network service that guarantees a minimum throughput to flows accepted by admission control (AC). The whole scheme only uses a small set of packet classes in a core-stateless network. At the ingress of the network each flow packet is marked into one of the sets of classes, and within the network, each class is assigned a different discarding priority. The AC method is based on edge-to-edge per-flow throughput measurements using the first packets of the flow, and it requires flows to send with a minimum rate. We evaluate the scheme through simulations in a simple bottleneck topology with different traffic loads consisting of TCP flows that carry files of varying sizes. We use a modified TCP source with a new algorithm that forces the source to send with a minimum rate. We compare our scheme with the besteffort service and we study the influence of the measurement duration on the scheme's performance. The results prove that the scheme guarantees the requested throughput to accepted flows and achieves a high utilization of network resources.

show abstract

“…Basically, two common possibilities exist in order to guarantee a certain QoS as required by the users of a network: either, one can use resource reservation or, alternatively, one could rely on priorization combined with admission control, cf. Reference [1].…”

Section: Introductionmentioning

confidence: 99%

Improving node behaviour in a QoS control environment by means of load-dependent resource redistributions in LANs

Wolfinger

Wolf

Grand³

2005

Int. J. Commun. Syst.

View full text Add to dashboard Cite

SUMMARYAn important means to guarantee an acceptable quality of service in networks with real-time communication requirements is the reservation of resources at connection setup time. However, such reserved resources, e.g. transmission bandwidth, may be unused as a consequence of the variations in the actual resource demands. Therefore, a more efficient resource utilization is possible if communicating stations or end-users dynamically hand over some of the free resources temporarily to the other communication partners, e.g. of a 'broadcast network'. This paper concentrates on two fundamental problems of such a demand-based sharing of resources: on the one hand, estimation of the current resource requirement on the basis of load measurements is investigated and, on the other hand, we elaborate efficient algorithms for resource sharing respecting realtime requirements. The algorithms proposed for load estimation and for resource sharing are evaluated analytically with respect to their efficiency for worst-case, average-case and realistic load scenarios. Our approach suggested for resource and traffic management allows one to achieve significantly better utilization of network resources.

show abstract

Measurement‐based admission control scheme with priority and service classes for application in wireless IP networks

Cited by 10 publications

References 22 publications

A review of the architecture of admission control schemes in the Internet

A review of the architecture of admission control schemes in the Internet

A guaranteed minimum throughput service for TCP flows using measurement‐based admission control

Improving node behaviour in a QoS control environment by means of load-dependent resource redistributions in LANs

Contact Info

Product

Resources

About