Distributed admission control

Kelly, F. P.; Key, Peter; Zachary, Stan

doi:10.1109/49.898741

Cited by 138 publications

(99 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Hence core routers do not need to perform any QoS control operations, besides simple queueing operations. Examples of this approach are [64], [65], [66], [67], [68], [69], [70]. Most of schemes are designed for DiffServ, and aim to provide some reasonable QoS assurances (not deterministic guarantees we discussed so far) for adaptive applications such as Internet audio and video streaming.…”

Section: B Scalable Control Plane Operationsmentioning

confidence: 99%

“…Based on the willingness of users to pay a certain price, admission control decisions can be made accordingly, either by end hosts or edge routers. In [69] network models are developed for studying the performance of the proposed distributed admission control framework. Fixed point approximations are applied to these models to derive acceptance marking probabilities at routers.…”

Section: B Scalable Control Plane Operationsmentioning

confidence: 99%

“…The distributed admission control framework proposed in [68], [69], [70] is developed for the best-effort Internet using "pricing" mechanisms. In this framework, all packets (data or probe, elastic or real-time) are indistinguishable and thus treated equally.…”

Section: B Scalable Control Plane Operationsmentioning

confidence: 99%

See 2 more Smart Citations

Theories and models for Internet quality of service

Firoiu¹,

et al. 2002

View full text Add to dashboard Cite

Abstract-We survey recent advances in theories and models for Internet Quality of Service (QoS). We start with the theory of network calculus, which lays the foundation for support of deterministic performance guarantees in networks, and illustrate its applications to integrated services, differentiated services, and streaming media playback delays. We also present mechanisms and architecture for scalable support of guaranteed services in the Internet, based on the concept of a stateless core. Methods for scalable control operations are also briefly discussed. We then turn our attention to statistical performance guarantees, and describe several new probabilistic results that can be used for a statistical dimensioning of differentiated services. Lastly, we review recent proposals and results in supporting performance guarantees in a best effort context. These include models for elastic throughput guarantees based on TCP performance modeling, techniques for some quality of service differentiation without access control, and methods that allow an application to control the performance it receives, in the absence of network support.

show abstract

Section: B Scalable Control Plane Operationsmentioning

confidence: 99%

Section: B Scalable Control Plane Operationsmentioning

confidence: 99%

See 1 more Smart Citation

Theories and models for Internet quality of service

Firoiu¹,

et al. 2002

View full text Add to dashboard Cite

show abstract

“…The literature in application-layer admission control includes end-to-end measurement-based admission control (EMBAC) [3,6,12] and distributed admission control [9,11]. In EMBAC schemes, before transmission of user data, an end-system first sends probe packets to the receiver.…”

Section: Related Workmentioning

confidence: 99%

Admission control in deadline-based network resource management

Liu¹,

Wong²

IEEE International Conference on Performance, Computing, and Communications, 2004

View full text Add to dashboard Cite

show abstract

“…Proposals presented in [4], [5] and [6] are examples of centralized mechanisms. Conversely, proposals presented in [7] and [8] adopt the distributed method, where admission control decisions are taken by edge devices or end systems [9]. Regardless of the adopted method, the proposed mechanisms vary widely with respect to their implementafion details.…”

Section: Introductionmentioning

confidence: 99%

Analysis of Individual Flows Performance for Delay Sensitive Applications

Nabhen

Jamhour

Penna

et al.

IFIP International Federation for Information Processing

View full text Add to dashboard Cite

Abstract. SLA management approaches typically adopt provisioning strategies based on aggregate traffic in order to support end-to-end delay requirements of applications. They do not take into account individual flows needs in terms of delay. However, this delay can be very higher than the one observed by aggregate traffic, causing an important impact in network application performance. This paper presents a study based on simulations that makes an analysis of the end-toend delay observed by individual flows. Several scenarios are used to evaluate this performance and some metrics are proposed to investigate empirical relations that show the end-to-end delay behavior when are analyzed individual flows, the aggregate traffic and the network load.

show abstract

Distributed admission control

Cited by 138 publications

References 30 publications

Theories and models for Internet quality of service

Theories and models for Internet quality of service

Admission control in deadline-based network resource management

Analysis of Individual Flows Performance for Delay Sensitive Applications

Contact Info

Product

Resources

About