59 citations found. Retrieving documents...
R. Gibbens and F. Kelly. Measurement-based Connection Admission Control. In Proceedings of the 15th International Teletraffic Congress - ITC 15, Washington, DC, USA, pages 879--888, 1997. Martin Karsten and Jens Schmitt Technical Report TUD-KOM 2002-03 17

 Home/Search   Document Details and Download   Summary   Related Articles   Check  

This paper is cited in the following contexts:

First 50 documents  Next 50

Traffic Equivalence and Substitution in a - Multiplexer With Applications (2002)   (Correct)

....researchers as an attractive solution in supporting real time services over a network offering statistical guarantees [7] 8] 9] 10] By using traffic measurements instead of traffic descriptors, the levels of utilization achieved are higher than with static CAC, without compromising QoS. In [11] and [9] Chernoff bounds are employed in the estimation of available capacity using ON OFF traffic approximation arguments. ON OFF Markov as well as Normal approximations of available capacity are given in [12] Also, in [13] measurement based CAC is performed by employing estimates of buffer ....

....buffer overflow probability, which are derived online by means of a method based on virtual systems. The effects of measurement errors and call dynamics in performance is considered in [7] and [14] and robust control mechanisms are proposed. Our work on dynamic CAC should be compared to that of [11] and [9] Since, the estimation of available capacity by our algorithm relies entirely on measurements, it is expected that the utilization attained is in general higher. Moreover, since our algorithm employs the value of the buffer size, contrary to algorithms based on Normal approximation of the ....

R. J. Gibbens and F. P. Kelly, "Measurement-based connection admission control," in Proc. of 15th International Teletraffic Congress, Washington, D.C., USA, June 1997.


DDM : Statistical Admission Control Using Delay Distribution - Kartik Gopalan Tzi-Cker   (Correct)

....flow specific delay violation probability guarantees. Several existing measurement based admission control (MBAC) algorithms address flow QoS requirements along the dimensions of the bandwidth or aggregate loss rate. Breslau et al. 4] performed a comparative study of several MBAC algorithms [17, 12, 8, 10, 5] under FIFO service discipline and concluded that none of them are capable of accurately achieving loss targets. Qiu and Knightly[17] proposed an MBAC scheme that measures maximal rate envelopes of aggregate traffic flows. Boorstyn et al. 3] developed the notion of effective envelopes that capture ....

R. Gibbens and F. Kelly. Measurement-based connection admission control. In Proc. of 15th Intl. Teletraffic Conference, June 1997.


Optimal Trajectory to Overflow in a Queue Fed By a Large.. - Mandjes, Ridder (1998)   (2 citations)  (Correct)

....determined. We indicate how to efficiently perform these computations. Applications. The theory of this paper has several applications. In the first place it sheds light on the question how overflow occurs, and in particular it provides the relevant time scale. As discussed in Gibbens and Kelly [11], this is extremely useful in Connection Admission Control (CAC, a device that decides whether or not a new request can be admitted to the network, without violating service criteria) This CAC gives rise to the notion of effective bandwidth, an amount of system resources that is occupied by a ....

R. Gibbens and F. Kelly. Measurement-based connection admission control. In: Proceedings 15th International Teletraffic Congress, eds. V. Ramaswami and P. Wirth, 879 -- 888, 1997.


Efficient Network Resource Allocation With QoS Guarantees - Gopalan (2003)   (Correct)

....flows and are especially suited to provide flow specific delay violation probability guarantees. Several existing MBAC algorithms address flow QoS requirements along the dimensions of the bandwidth or aggregate loss rate. Breslau et al. 7] performed a comparative study of several MBAC algorithms [35, 23, 17, 19, 9] under FIFO service discipline and concluded that none of them are capable of accurately achieving loss targets. Qiu and Knightly[35] proposed an MBAC scheme that measures maximal rate envelopes of aggregate traffic flows. Boorstyn et al. 6] developed the notion of effective envelopes that capture ....

R. Gibbens and F. Kelly. Measurement-based connection admission control. In Proc. of 15th Intl. Teletraffic Conference, June 1997.


AC Algorithms in Aquila QoS IP Network - Brandauer, Burakowski, Dbrowski.. (2002)   (Correct)

....traffic could vary from declaration; To capture the stochastic nature of the user traffic more accurately than it is possible with DBAC, which assumes traffic description by deterministic parameters. The MBAC method selected for the PVBR service is the algorithm based on Hoeffding bound [6, 15]. It is relatively easy to implement since it assumes the measurements of aggregate mean bit rate only. For this purpose, a special measurement module is implemented as part of the ACA agent. The number of bytes transferred on the outgoing link is collected by polling the router in predefined ....

R.J.Gibbens,F.P.Kelly,Measurement-based connection admission control,15 th International Teletraffic Congress, June 1997.


Measurement-Based Admission Control with Aggregate Traffic.. - Qiu, Knightly (2001)   (31 citations)  (Correct)

....earliest deadline first. In contrast, our MBAC algorithm utilizes measurements to characterize and control the aggregate traffic envelope. Several approaches to MBAC perform admission control using a priori per flow traffic models such as on off in addition to aggregate measurements, e.g. 11] [14], 15] While all schemes require at least an initial coarse description of a new flow, we have found that later discarding all specified parameters (even if they are accurate) and performing aggregate control is important for efficient service provisioning. Namely, we find that using prespecified ....

....Namely, we find that using prespecified parameters to estimate properties of the aggregate flow introduces inaccuracies that can be avoided by directly observing and controlling the aggregate flow. Other studies have used a simplified system model, e.g. bufferless multiplexers [10] 11] [14] [16] and or simplified traffic models, e.g. Gaussian arrivals [10] 16] to study particular aspects of MBAC. For example, a study of the role of the measurement window and the impact of measurement errors is found in [16] In contrast, our goal was to design and implement an algorithm that ....

R. Gibbens and F. Kelly, "Measurement-based connection admission control," in Proc. 15th Int. Teletraffic Cong., Amsterdam, The Netherlands, 1997, pp. 781--790.


The Influence of Long-range Dependence on Prediction - Östring, Sirisena (2001)   (Correct)

....a network is one of the fundamental requirements of network design and management. Traffic prediction is required for a number of different time scales, including long term planning of network topology, admission of connections that may impact the quality of service of the existing traffic [1] [2], and finally the dynamic prediction that is required for traffic control and buffer management. What must be achieved is a balance between network utilization and the provision of quality of service. If a management policy is too conservative in an effort to ensure absolute quality of service to ....

R. Gibbens and F. Kelly, "Measurement-based connection ad- mission control," 15th ITC Proceedings, June 1997.


Internet Traffic Engineering - Mortier (2002)   (2 citations)  (Correct)

.... protocol should have some standard behaviour in the face of ECN marks, perhaps even behaviour identical to that in the face of loss [RFC2481] The second category is price driven, where the network counts the marks it sees, and presents the user with a bill for the marks they receive [Key99a, Gibbens99b,Kelly00]. This category is discussed further in Section 2.2.4. 2.1.3 User Datagram Protocol UDP (USER DATAGRAM PROTOCOL) RFC768] adds two features to IP: a data checksum so that the receiver may verify that data has been correctly Rather, between individual IP addresses as a host may support many IP ....

....rates in order that resources may be reserved at connection setup [ATMF TM99] 2.2. 3 Measurement based admission control An alternative to requiring that the connection explicitly declare its traffic parameters is to use MBAC (MEASUREMENT BASED ADMISSION CONTROL) Gibbens95, Floyd96, Gibbens97, Jamin97a, Jamin97b, Wang99] In this case, the network measures its current load and then uses these measurements to make a decision about whether it should accept a new connection. This approach has the advantage that it relaxes the requirement that users or applications know a priori the ....

R.J. Gibbens and F.P. Kelly. Measurement-based Connection Admission Control. In V. Ramaswami and P.E. Wirth, editors, Teletraffic Contributions for the Information Age: Proceedings of the 15th International Teletraffic Congress, Washington, DC, pages 879--888,


Measurement-Based Management of Network Resources - Moore (2002)   (Correct)

....as equally valid as traffic descriptors given a priori may, therefore, lead to a degrading of the MBAC algorithm s ability to honour the QoS to which it is committed. The ability to reuse static AC algorithms has meant many MBAC algorithms are based upon the CE model (e.g. Floyd96, Casetti96, Gibbens97, Jamin97c, Jamin97b, Jamin97c, Droz97] and [Lewis98] However, this does not mean the problem with measurement uncertainty has been left unconsidered. A common approach used to overcome the disadvantage introduced by this error is to compensate with a conservative measurement procedure; examples ....

....and [Lewis98] However, this does not mean the problem with measurement uncertainty has been left unconsidered. A common approach used to overcome the disadvantage introduced by this error is to compensate with a conservative measurement procedure; examples of this approach include [Floyd96, Gibbens97, Jamin97c] A slight variation is given in [Casetti96] an algorithm that adjusts its behaviour on the basis of the traffic offered. The MBAC algorithms from [Grossglauser97b, Tse99, Gibbens95, Key95, Courcoubetis95] and [Duffield99a] depart from the CE model. Each of these algorithms recognises ....

[Article contains additional citation context not shown here]

R. J. Gibbens and F. P. Kelly. Measurement-based connection admission control. In Proceedings of 15th International Teletraffic Congress (ITC15), June 1997. (pp 58, 59, 105, 107, 129, 136, 147, 167)


Admission Control Based on Packet Marking and . . . - Karsten (2002)   (Correct)

No context found.

R. Gibbens and F. Kelly. Measurement-based Connection Admission Control. In Proceedings of the 15th International Teletraffic Congress - ITC 15, Washington, DC, USA, pages 879--888, 1997. Martin Karsten and Jens Schmitt Technical Report TUD-KOM 2002-03 17


Charging for Packet-switched Network Communication -.. - Karsten, Schmitt.. (2000)   (2 citations)  (Correct)

No context found.

Richard J. Gibbens and Frank P. Kelly. Measurement-Based Connection Admission Control. In Proceedings of 15th International Teletraffic Congress - ITC 15, Washington, DC, USA, June 1997.


Bottleneck Estimation for Load Control Gateways - Pandit, Schmitt, Karsten..   (Correct)

No context found.

R. Gibbens and F. Kelly. Measurement-based Connection Admission Control. In Proceedings of the 15th International Teletraffic Congress - ITC 15, Washington, DC, USA, pages 879--888, 1997.


Bottleneck Estimation for Load Control Gateways - Extended Version - Pandit, al. (2003)   (Correct)

No context found.

R. Gibbens and F. Kelly. Measurement-based Connection Admission Control. In Proceedings of the 15th International Teletraffic Congress - ITC 15, Washington, DC, USA, pages 879--888, 1997. 18


Probabilistic Delay Guarantees Using Delay Distribution.. - Gopalan, Chiueh, Lin (2004)   (Correct)

No context found.

R. Gibbens and F. Kelly. Measurement-based connection admission control. In Proc. of 15th Intl. Teletra#c Conference, June 1997.


Allocating Commodity Resources in Aggregate Traffic Networks - Duffield, Low (2003)   (Correct)

No context found.

R.J. Gibbens and F.P. Kelly. Measurement-based connection admission control. Proceedings ITC-15, Washington, DC, USA, 22-27 June, 1997.


On the Tradeoff between Effectiveness and Scalability of.. - Veres, Turanyi (2000)   (Correct)

No context found.

R. J. Gibbens, F. P. Kelly, "Measurement-Based Connection Admission Control ", International Teletra#c Congress 15, Jun. 1997


Efficient Provisioning Algorithms for Network Resource.. - Gopalan (2003)   (Correct)

No context found.

R. Gibbens and F. Kelly. Measurement-based connection admission control. In Proc. of 15th Intl. Teletraffic Conference, June 1997.


Bottleneck Estimation for Load Control Gateways - Pandit, Schmitt, Karsten..   (Correct)

No context found.

R. Gibbens and F. Kelly. Measurement-based Connection Admission Control. In Proceedings of the 15th International Teletraffic Congress - ITC 15, Washington, DC, USA, pages 879--888, 1997.


A Low Cost Approximation for a Controlled Load Service in a.. - Kim (2000)   (Correct)

No context found.

R. Gibbens, F. Kelly, Measurement-based connection admission control, in 15th International Teletraffic Congress, June 1997.


QoS Signalling and Charging in a Multi-service Internet using RSVP - Karsten (2000)   (Correct)

No context found.

Richard J. Gibbens and Frank P. Kelly. Measurement-based connection admission control. In Proceedings of the 15th International Teletraffic Congress - ITC 15, Washington, DC, USA, pages 879--888. Elsevier Science B.V., 1997.


Admission Control Based on Packet Marking and . . . - Karsten, Schmitt   (Correct)

No context found.

R. Gibbens and F. Kelly. Measurement-based Connection Admission Control. In Proceedings of the 15th International Teletraffic Congress - ITC 15, Washington, DC, USA, pages 879--888, 1997. Martin Karsten and Jens Schmitt Technical Report TUD-KOM 2002-03 17


An Implementation-Based Comparison of Measurement-Based Admission.. - Moore (2004)   (Correct)

No context found.

R. J. Gibbens and F. P. Kelly. Measurement-based connection admission control. In Proceedings of 15th International Teletra#c Congress (ITC15), June 1997.


Bottleneck Estimation for Load Control Gateways - Extended Version - Pandit, al. (2003)   (Correct)

No context found.

R. Gibbens and F. Kelly. Measurement-based Connection Admission Control. In Proceedings of the 15th International Teletraffic Congress - ITC 15, Washington, DC, USA, pages 879--888, 1997. 18


Robust Measurement-Based Admission Control Using Markov's.. - Pandit, Meyn (2003)   (Correct)

No context found.

R. Gibbens and F. Kelly. Measurement-based connection admission control. 15th International Teletra#c Congress, 1997.


Measurement-based Admission Control using Worst-case Source.. - Pandit, Meyn (2003)   (Correct)

No context found.

R. Gibbens and F. Kelly. Measurement-based connection admission control. 15th International Teletra#c Congress, 1997.

First 50 documents  Next 50

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC