#### DMCA

## Measurement-Based Admission Control with Aggregate Traffic Envelopes (2001)

### Cached

### Download Links

- [www-ece.rice.edu]
- [networks.rice.edu]
- [networks.rice.edu]
- [www-ece.rice.edu]
- [www.ece.rice.edu]
- [www.ece.rice.edu]
- DBLP

### Other Repositories/Bibliography

Citations: | 88 - 2 self |

### Citations

2210 | On the self-similar nature of ethernet traffic - Leland, Taqqu, et al. - 1993 |

1005 | RSVP: A new resource reservation protocol - Zhang, Deering, et al. - 1993 |

742 | Self-similarity through high-variability: statistical analysis of Ethernet LAN traffic at the source level - Willinger, Taqqu, et al. - 1995 |

702 | A Scheme for Real-time Channel Establishment in Wide Area Networks",
- Ferrari, Verma
- 1990
(Show Context)
Citation Context ...ommunications, September 1998 1 Introduction To satisfy the Quality of Service (QoS) requirements of real-time multimedia applications, networks must employ resource reservation and admission control =-=[2, 5, 13]-=-. However, traditional approaches to resource reservation require that an accurate characterization of each flow be specified at flow setup time, a requirement that, in practice, may be difficult for ... |

665 |
A calculus for network delay, part I: network elements in isolation
- Cruz
- 1991
(Show Context)
Citation Context ...ed by ( �� R k + r k + ffoe k ); k = 1; 2; \Delta \Delta \Delta ; T , also with probability \Phi(ff). Therefore, with this bound on the envelope of the aggregate flow that includes the new flow, f=-=rom [3] the-=- maximum queue length will be bounded by Equation (5) with probability \Phi(ff). From extreme value theory, we approximate R k as having a Gumbel distribution with mean �� R k and variance oe 2 k ... |

618 | Link-sharing and resource management models for packet networks,” Networking,
- Floyd, Jacobson
- 1995
(Show Context)
Citation Context ...ximal rate R k by F k (\Delta). With probability \Phi(ff) = Z �� Rk+ffoek \Gamma1 dF k the future aggregate flow, denoted by A[s; t], satisfies Pfmax s A[s; s + k�� ]=k��s�� R k + ffoe=-= k g = \Phi(ff) (7) Sin-=-ce max s fA[s; s + t] +sA[s; s + t]gsmax s A[s; s + t] + max ssA[s; s + t]; (8) the rate envelope of the past aggregate flow multiplexed with the new flow is bounded by ( �� R k + r k + ffoe k ); ... |

573 | Supporting real-time applications in an integrated services packet network: Architecture and mechanism. In
- Clark, Shenker, et al.
- 1992
(Show Context)
Citation Context ...ommunications, September 1998 1 Introduction To satisfy the Quality of Service (QoS) requirements of real-time multimedia applications, networks must employ resource reservation and admission control =-=[2, 5, 13]-=-. However, traditional approaches to resource reservation require that an accurate characterization of each flow be specified at flow setup time, a requirement that, in practice, may be difficult for ... |

548 | Analysis, modeling and generation of self-similar VBR video traffic. In
- Garrett, Willinger
- 1994
(Show Context)
Citation Context ...s especially problematic for applications which exhibit rate variations over multiple time scales, as this behavior is not adequately characterized by standard traffic models such as the leaky bucket =-=[8, 14]-=-. This research is supported by NSF CAREER Award ANI-9733610 and NSF Grant ANI-9730104 An alternative technique for supporting applications with ill-specified traffic characteristics is a measurement-... |

420 | Specification of the Controlled-Load Network Element Service, - Wroclawski - 1997 |

338 | A Measurement-Based Admission Control Algorithm for Integrated Services Packet Networks,”,
- Jamin, Danzing, et al.
- 1997
(Show Context)
Citation Context ...cal multiplexing gains are available such as in a link sharing environment [7], the MBAC algorithm correctly restricts the admissible region to lower utilizations. Previous approaches to MBAC such as =-=[4, 6, 9, 10, 11, 17]-=- have employed a number of measurement methodologies to characterize traffic including instantaneous peak rate, the instantaneous rate's mean and variance or moment generating function, and per-flow s... |

326 | Statistical signal processing: detection, estimation, and time series analysis - Scharf - 1991 |

308 | Statistical properties of MPEG video traffic and their impact on traffic modeling
- Rose
- 1995
(Show Context)
Citation Context ...xample. 3 Experimental Results In this section, we evaluate the performance of the new MBAC algorithm. The workload consists of a set of twenty 30-minute traces of MPEG and JPEG compressed video from =-=[16]-=-. With this collection of traces and an implementation of our MBAC algorithm, we perform a set of trace-driven simulation and admission control experiments for a wide variety of traffic mixes and netw... |

253 | Quality of service guarantees in virtual circuit switched networks - Cruz - 1995 |

162 |
Extreme Value Theory in Engineering,
- Castillo
- 1988
(Show Context)
Citation Context ...aximal rates over the corresponding interval lengths, we directly characterize the peaks and extremes of the aggregate flow which are most likely to lead to packet loss. We apply extreme value theory =-=[1]-=- to obtain insights into the statistical behavior of the maximal rate envelope for a broad class of underlying traffic characteristics, including Gaussian, log-normal, and Gamma distributions, and sho... |

127 | Admission control for Statistical QoS: Theory and Practice”, In - Knightly, &Shroff - 1999 |

120 | Deterministic delay bounds for VBR video in packet-switching networks: Fundamental limits and practical tradeoffs
- Wrege, Knightly, et al.
- 1996
(Show Context)
Citation Context ...e Schedulability and Confidence Level Upon arrival of a new flow request, we first perform a test for "aggregate schedulability ". This test, quite different from a strictly worst-case analy=-=sis as in [18]-=-, ensures that for a certain confidence level, no packet loss will occur if the new flow is admitted. The confidence level is required here since there is no a priori assurance that the past envelope ... |

114 | Comments on the performance of measurement-based admission control algorithms, - Breslau, Jamin, et al. - 2000 |

106 | A framework for robust measurement-based admission control. - Grossglauser, Tse - 1999 |

90 | Measurement-based connection admission control - Gibbens, Kelly - 1997 |

87 |
A decision-theoretic approach to call admission control in atm networks,
- Gibbens, Kelly
- 1995
(Show Context)
Citation Context ...cal multiplexing gains are available such as in a link sharing environment [7], the MBAC algorithm correctly restricts the admissible region to lower utilizations. Previous approaches to MBAC such as =-=[4, 6, 9, 10, 11, 17]-=- have employed a number of measurement methodologies to characterize traffic including instantaneous peak rate, the instantaneous rate's mean and variance or moment generating function, and per-flow s... |

84 | Comments on measurement-based admissions control for controlled-load services.
- Floyd
- 1996
(Show Context)
Citation Context ...cal multiplexing gains are available such as in a link sharing environment [7], the MBAC algorithm correctly restricts the admissible region to lower utilizations. Previous approaches to MBAC such as =-=[4, 6, 9, 10, 11, 17]-=- have employed a number of measurement methodologies to characterize traffic including instantaneous peak rate, the instantaneous rate's mean and variance or moment generating function, and per-flow s... |

66 | On the self-similar nature of Ethernet trac - Leland, Taqqu, et al. - 1994 |

60 |
Control of resources in broadband networks with quality of service guarantees
- Lazar, Pacifici
- 1991
(Show Context)
Citation Context ...ommunications, September 1998 1 Introduction To satisfy the Quality of Service (QoS) requirements of real-time multimedia applications, networks must employ resource reservation and admission control =-=[2, 5, 13]-=-. However, traditional approaches to resource reservation require that an accurate characterization of each flow be specified at flow setup time, a requirement that, in practice, may be difficult for ... |

57 | Inter-class resource sharing using statistical service envelopes - Qiu, Knightly - 1999 |

56 | D-BIND: An accurate traffic model for providing QoS guarantees to VBR traffic,”
- Knightly, Zhang
- 1997
(Show Context)
Citation Context ...ak rate over any interval of length I k is given by R k = max s A[s; s + I k ]=I k . We refer to a set of rates R k which bound the flow's rate over intervals of length I k as a maximal rate envelope =-=[12]-=-. The goal of our measurement methodology is twofold. First, by measuring an envelope of the aggregate flow, we capture the short time scale burstiness of the traffic which we will use to analyze the ... |

56 | On the characterization of VBR MPEG streams”, in - Krunz, Tripathi - 1997 |

47 | Modern Filters. - Haykin - 1989 |

46 | A central limit theorem based approach to analyze queue behavior in atm networks - Kim, Shroff - 1998 |

39 | Scalable services via egress admission control - Cetinkaya, Kanodia, et al. - 2001 |

37 | A framework for bandwidth management in ATM networks - aggregate equivalent bandwidth estimation approach,
- Dziong, Juda, et al.
- 1997
(Show Context)
Citation Context |

34 | Performance analysis of an RSVP capable router, - Neogi, Chiueh, et al. - 1999 |

29 | Measurement-based call admission control: Analysis and simulation
- Tse, Grossglauser
- 1997
(Show Context)
Citation Context |

28 | et al., Integrated Services in the Internet Architecture: an Overview - Braden - 1994 |

25 | Dynamic bandwidth allocation for ATM switches
- Hsu, Walrand
- 1996
(Show Context)
Citation Context |

23 | Effective Envelopes: Statistical Bounds on Multiplexed Traffic in Packet networks. - Boorstyn, Buchard, et al. - 2000 |

20 |
Modeling video sources for real time scheduling
- Lazar, Pacifici, et al.
- 1994
(Show Context)
Citation Context ...s especially problematic for applications which exhibit rate variations over multiple time scales, as this behavior is not adequately characterized by standard traffic models such as the leaky bucket =-=[8, 14]-=-. This research is supported by NSF CAREER Award ANI-9733610 and NSF Grant ANI-9730104 An alternative technique for supporting applications with ill-specified traffic characteristics is a measurement-... |

17 | Measurement-based admission control: What is the research agenda? - Breslau, Jamin, et al. - 1999 |

16 | Statistical properties of MPEG video trac and their impact on trac modeling in ATM systems - Rose - 1995 |

10 | A New Algorithm for Measurement-Based Admission Control in Integrated Services Packet Networks - Casetti, Kurose, et al. - 1996 |

8 | Design and Implementation of Scalable Admission Control - Yuan, Schlembach, et al. - 2001 |

8 | On-line measurement of QoS for call admission control - Siler, Walrand - 1998 |

3 | D-BIND: An Accurate Trac Model for Providing QoS Guarantees to VBR Trac - Knightly, Zhang - 1997 |

2 | Measurement-Based Admission Control in Integrated Services Networks
- Qiu
- 1998
(Show Context)
Citation Context ...traffic distributions. The temporal correlation structure of the aggregate flow is captured by the rate envelope for intervals up to T seconds. We address correlation at time scales greater than T in =-=[15]-=-, but ignore it here for simplicity (again, T is typically on the order of several seconds). Second, a new flow is not required to specify a complete rate envelope. For example, if only an estimate of... |

2 | et al. Integrated services in the internet architecture: an overview - Clark - 1994 |

1 | on the performance of measurement-based admission control algorithms - “Comments - 2000 |