Throughput guarantees for elastic flows using end-to-end admission control

Fàbrega, Lluís; Jové, Teodor; Meisel, Yezid Donoso

doi:10.1145/1035662.1035676

Cited by 5 publications

(3 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Lluis Fabrega et al [2], elaborates an admission control scheme exclusively for TCP flows. In their approach the admission control phase occurs within data transfer phase.…”

Section: Related Workmentioning

confidence: 99%

Integrated Proactive Admission Control Technique For both UDP And TCP Traffic Flows

Senthilkumar¹,

Sankaranarayanan²

2007

JNW

View full text Add to dashboard Cite

Real time traffic adopting UDP at the transport layer needs some quality of service. It is offered through an admission control scheme. This paper adopts one such scheme which is extended for elastic traffics adopting TCP at the transport layer. The proposed scheme operates on reserving network resources on a proactive manner. It is based on the principle of telephone networks Erlang-B model. The blocking probability measured is used as a flow admission decision parameter. The effectiveness of the proposed admission control algorithm is determined here through simulation. It offers a fair admission rate to both UDP and TCP traffic flows. It also results in a better bottleneck link utilization at a comparatively lower overhead traffic.

show abstract

“…Lluis Fabrega et al [2], elaborates an admission control scheme exclusively for TCP flows. In their approach the admission control phase occurs within data transfer phase.…”

Section: Related Workmentioning

confidence: 99%

Integrated Proactive Admission Control Technique For both UDP And TCP Traffic Flows

Senthilkumar¹,

Sankaranarayanan²

2007

JNW

View full text Add to dashboard Cite

show abstract

“…In these schemes, the special probing flow is an extra flow of packets sent before the AC decision and the data packets. However, in our scheme [4], the first packets of the flow are used as a probing flow to test if the network throughput in a path is enough to satisfy the flow's request. Moreover, in these schemes, the queues use different priorities for scheduling packets (packets of accepted flows have higher priority than packets of flows in the AC phase), while in our scheme, we use different priorities for discarding packets.…”

Section: The Intradomain Architecture Of the Schemementioning

confidence: 99%

“…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 be sent at a minimum rate. In this article, we develop this scheme, initially outlined in Fàbrega, Jové, and Donoso [4], and we present simulation results using statistical traffic variations to show its validity as well as to study the influence of several parameters on its performance. This article is organized as follows.…”

Section: Introductionmentioning

confidence: 99%

Throughput Guarantees for TCP Flows in a Network Based on Packet Classes Using Edge-to-Edge Per Flow Measurements

et al. 2006

View full text Add to dashboard Cite

TCP flows generated by applications such as the Web or FTP require a minimum network throughput and can also benefit from an extra throughput due to their rate-adaptive algorithms. To build a guaranteed minimum throughput service, the authors propose a scheme with Admission Control (AC) using a small set of packet classes in a core-stateless network. At the ingress of the network, each flow packet is marked as one of the set 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 measurements and requires flows to be sent at a minimum rate. The scheme is able to provide different minimum throughput to different users and protection against nonresponsive sources. The authors evaluate the scheme through simulation using different traffic loads consisting of TCP flows that carry files of varying sizes. In the simulation, TCP uses a new algorithm that forces the source to keep the short-term sending rate above a desired minimum rate. The authors study the influence of several parameters on the performance of the scheme in different network topologies. The results show that the scheme guarantees the requested throughput to accepted flows and achieves a high utilization of network resources, similar to the ideal results of a classical hop-by-hop AC.

show abstract

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

Throughput guarantees for elastic flows using end-to-end admission control

Cited by 5 publications

References 7 publications

Integrated Proactive Admission Control Technique For both UDP And TCP Traffic Flows

Integrated Proactive Admission Control Technique For both UDP And TCP Traffic Flows

Throughput Guarantees for TCP Flows in a Network Based on Packet Classes Using Edge-to-Edge Per Flow Measurements

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

Contact Info

Product

Resources

About