Name
Abstract | ||
|---|---|---|
We consider a traffic model where a single source generates traffic having J (J⩾2) quality of service (QoS) classes, QoS in this case described by a cell loss probability objective εj for QoS class j. We assume that ε1⩾ε2 ⩾...⩾εJ, in other words, class J has the most stringent QoS requirements and class 1 the least. The traffic from K such independent heterogeneous Markov-modulated fluid sources is multiplexed into a single buffer of size B. There are J-1 thresholds {B j, 1⩽j⩽J-1} such that 0<B1<B2 <...<BJ-1<B. Let B0=0 and BJ =B. If the buffer content is in (Bj-1, Bj), 1⩽j⩽J only traffic of class index J or above is accepted and all other traffic is rejected. For this system of K sources we define an effective bandwidth vector of size J such that QoS requirements for all classes are satisfied if each component of the vector is less than the channel capacity. We propose several bandwidth vectors that can be computed for each source separately. Numerical studies are reported on the efficacy of these bandwidth vectors |
Year | DOI | Venue |
|---|---|---|
1995 | 10.1109/49.400659 | IEEE Journal on Selected Areas in Communications |
Keywords | Field | DocType |
bandwidth vector,QoS class j,QoS requirement,class J,class index J,size J,stringent QoS requirement,traffic model,B j,effective bandwidth vector,multiclass traffic,partitioned buffer | Service quality,Computer science,Computer network,Quality of service,Real-time computing,Traffic model,Asynchronous Transfer Mode,Bandwidth (signal processing),Multiplexing,Channel capacity,Telecommunications service | Journal |
Volume | Issue | ISSN |
13 | 6 | 0733-8716 |
Citations | PageRank | References |
6 | 0.72 | 5 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Vidyadhar G. Kulkarni | 1 | 539 | 60.15 |
| Levent Gün | 2 | 98 | 38.06 |
| Phillip F. Chimento Jr. | 3 | 13 | 2.57 |
| Chimento, P.F. | 4 | 14 | 1.63 |