#### DMCA

## On the Quantitative Specification of Jitter Constrained Periodic Streams (1997)

Venue: | In MASCOTS |

Citations: | 17 - 4 self |

### Citations

197 | Comparison of rate-based service disciplines.
- Zhang, Keshav
- 1991
(Show Context)
Citation Context ...e processes). On the other hand a determistic model is used for the same reason in [11]. However, only few papers compare several models or traffic descriptions but with respect to server disciplines =-=[14] or traffi-=-c constraint functions [8]; the latter includes the Tenet traffic model. Khan's approach [6] is similar to ours: he introduced the "(L, M, T) mechanism" to evaluate the leaky bucket behaviou... |

160 | Support for Continuous Media
- Anderson, Tzou, et al.
- 1990
(Show Context)
Citation Context ...ed with spacing no less T p N t t T t T t T t T p s s s s ( )s+ + +s1 1 if MBS if MBS t corresponds to (9). 4.2. Linear Bounded Arrival Processes Anderson introduced a continuous media resource model =-=[2]-=- that decomposes a distributed system into a set of resources such as CPU, networks, and file systems. Several data streams with different quality are to be processed, stored, and transferred between ... |

149 | Rate-Controlled Service Disciplines
- ZHANG, FERRARI
- 1994
(Show Context)
Citation Context ...(that means the Generic Cell Rate Algorithm in ATM) is described in [4], burst streams are considered in [9], both with respect to end-toend delay founded on an deterministic model. Zhang and Ferrari =-=[13]-=- introduced a probabilistic model, and [7], 10], [12] deal with bounds of buffer space based on Markovian chains (discrete-time, finite state processes). On the other hand a determistic model is used ... |

123 | Determining Endto-End Delay Bounds in Heterogeneous Networks.
- Goyal, Lam, et al.
- 1995
(Show Context)
Citation Context ...ects of traffic models, above all buffer space requirements and end-to-end delay guarantees. For instance, the "leaky bucket" model (that means the Generic Cell Rate Algorithm in ATM) is des=-=cribed in [4]-=-, burst streams are considered in [9], both with respect to end-toend delay founded on an deterministic model. Zhang and Ferrari [13] introduced a probabilistic model, and [7], 10], [12] deal with bou... |

76 | Fundamental limits and tradeoffs of providing deterministic guarantees to VBR video traffic
- Knightly, Wrege, et al.
- 1995
(Show Context)
Citation Context ...ermistic model is used for the same reason in [11]. However, only few papers compare several models or traffic descriptions but with respect to server disciplines [14] or traffic constraint functions =-=[8]; the latt-=-er includes the Tenet traffic model. Khan's approach [6] is similar to ours: he introduced the "(L, M, T) mechanism" to evaluate the leaky bucket behaviour, where L and T are the minimum and... |

9 |
Discrete Time Analysis of Leaky-Bucket Congestion Control
- Wu, Mark
- 1993
(Show Context)
Citation Context ...s described in [4], burst streams are considered in [9], both with respect to end-toend delay founded on an deterministic model. Zhang and Ferrari [13] introduced a probabilistic model, and [7], 10], =-=[12]-=- deal with bounds of buffer space based on Markovian chains (discrete-time, finite state processes). On the other hand a determistic model is used for the same reason in [11]. However, only few papers... |

8 |
The Tenet Real-Time
- Banerjea, Ferrari, et al.
- 1994
(Show Context)
Citation Context ... N(t) is a natural number a priori it follows N(t)sW + Rt. This is the same like (10) except the notations and the assumption t 0 = 0. 4.3. The Tenet Protocol Suite The Tenet Real-Time Protocol Suite =-=[3]-=- was developed to meet the real-time demands and guaranteed performance requirements of applications communicating in an internetwork, such as bounds on throughput, delay, or reliability. This protoco... |

7 | Burst Scheduling Networks: Flow Specification and Performance Guarantees
- Lam, Xie
- 1995
(Show Context)
Citation Context ...fer space requirements and end-to-end delay guarantees. For instance, the "leaky bucket" model (that means the Generic Cell Rate Algorithm in ATM) is described in [4], burst streams are cons=-=idered in [9]-=-, both with respect to end-toend delay founded on an deterministic model. Zhang and Ferrari [13] introduced a probabilistic model, and [7], 10], [12] deal with bounds of buffer space based on Markovia... |

6 | Dimensioning of an ATM switch with shared buffer and threshold policy - Meyer, Montagna, et al. - 1993 |

4 |
Traffic Management Specification, Version 4.0
- ATM
- 1996
(Show Context)
Citation Context ...ntify an event E i with its time a(E i )). 4. Equivalence of Parameter Sets 4.1. ATM The comparison between event streams according definition 1 and sequences of events in ATM connections is based on =-=[1]-=-; refer to chapter 4.4: Traffic Contract Parameters and Related Algorithms. The following traffic parameters describe the traffic characteristics of an ATM connection: PCR Peak Cell Rate CDVT Cell Del... |

4 |
Reducing Buffer Space Requirements for Multimedia Data Streams
- Williamson, Wolf
- 1995
(Show Context)
Citation Context ...stic model, and [7], 10], [12] deal with bounds of buffer space based on Markovian chains (discrete-time, finite state processes). On the other hand a determistic model is used for the same reason in =-=[11]-=-. However, only few papers compare several models or traffic descriptions but with respect to server disciplines [14] or traffic constraint functions [8]; the latter includes the Tenet traffic model. ... |

3 |
Jitter constrained periodic streams
- Hamann
(Show Context)
Citation Context ... 5 contains the conclusion and outlines the future work. The paper summarizes the results only, with exception of a few cases.. The accurate formal definitions and the complete proofs are included in =-=[5]-=-. 2. The Generalized Model This paper deals with sequences of events (e.g., sending or receiving data units, all units are of the same size) called event streams in the following sense: Beginning from... |

3 |
Traffic control in ATM networks
- Khan, Li
- 1994
(Show Context)
Citation Context ...few papers compare several models or traffic descriptions but with respect to server disciplines [14] or traffic constraint functions [8]; the latter includes the Tenet traffic model. Khan's approach =-=[6] is simila-=-r to ours: he introduced the "(L, M, T) mechanism" to evaluate the leaky bucket behaviour, where L and T are the minimum and mean distance respectively between two ATM cells and M denotes th... |

3 |
Buffer dimensioning for delay/loss-sensitive traffic
- Kontovassilis, Tsiligaridis, et al.
- 1995
(Show Context)
Citation Context ... in ATM) is described in [4], burst streams are considered in [9], both with respect to end-toend delay founded on an deterministic model. Zhang and Ferrari [13] introduced a probabilistic model, and =-=[7]-=-, 10], [12] deal with bounds of buffer space based on Markovian chains (discrete-time, finite state processes). On the other hand a determistic model is used for the same reason in [11]. However, only... |