Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If You Use a Screen Reader

This content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.

Markov-Modulated Traffic with Nearly Complete Decomposability Characteristics and Associated Fluid Queueing Models

Kimon P. Kontovasilis and Nikolas M. Mitrou
Advances in Applied Probability
Vol. 27, No. 4 (Dec., 1995), pp. 1144-1185
DOI: 10.2307/1427937
Stable URL: http://www.jstor.org/stable/1427937
Page Count: 42
  • Read Online (Free)
  • Subscribe ($19.50)
  • Cite this Item
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Markov-Modulated Traffic with Nearly Complete Decomposability Characteristics and Associated Fluid Queueing Models
Preview not available

Abstract

This paper considers fluid queuing models of Markov-modulated traffic that, due to large differences in the time-scales of events, possess structural characteristics that yield a nearly completely decomposable (NCD) state-space. Extension of domain decomposition and aggregation techniques that apply to approximating the eigensystem of Markov chains permits the approximate subdivision of the full system to a number of small, independent subsystems (decomposition phase), plus an 'aggregative' system featuring a state-space that distinguishes only one index per subsystem (aggregation phase). Perturbation analysis reveals that the error incurred by the approximation is of an order of magnitude equal to the weak coupling of the NCD Markov chain. The study in this paper is then extended to the structure of NCD fluid models describing source superposition (multiplexing). It is shown that efficient spectral factorization techniques that arise from the Kronecker sum form of the global matrices can be applied through and combined with the decomposition and aggregation procedures. All structural characteristics and system parameters are expressible in terms of the individual sources multiplexed together, rendering the construction of the global system unnecessary. Finally, besides providing efficient computational algorithms, the work in this paper can be recast as a conceptual framework for the better understanding of queueing systems under the presence of events happening in widely differing time-scales.

Page Thumbnails

  • Thumbnail: Page 
1144
    1144
  • Thumbnail: Page 
1145
    1145
  • Thumbnail: Page 
1146
    1146
  • Thumbnail: Page 
1147
    1147
  • Thumbnail: Page 
1148
    1148
  • Thumbnail: Page 
1149
    1149
  • Thumbnail: Page 
1150
    1150
  • Thumbnail: Page 
1151
    1151
  • Thumbnail: Page 
1152
    1152
  • Thumbnail: Page 
1153
    1153
  • Thumbnail: Page 
1154
    1154
  • Thumbnail: Page 
1155
    1155
  • Thumbnail: Page 
1156
    1156
  • Thumbnail: Page 
1157
    1157
  • Thumbnail: Page 
1158
    1158
  • Thumbnail: Page 
1159
    1159
  • Thumbnail: Page 
1160
    1160
  • Thumbnail: Page 
1161
    1161
  • Thumbnail: Page 
1162
    1162
  • Thumbnail: Page 
1163
    1163
  • Thumbnail: Page 
1164
    1164
  • Thumbnail: Page 
1165
    1165
  • Thumbnail: Page 
1166
    1166
  • Thumbnail: Page 
1167
    1167
  • Thumbnail: Page 
1168
    1168
  • Thumbnail: Page 
1169
    1169
  • Thumbnail: Page 
1170
    1170
  • Thumbnail: Page 
1171
    1171
  • Thumbnail: Page 
1172
    1172
  • Thumbnail: Page 
1173
    1173
  • Thumbnail: Page 
1174
    1174
  • Thumbnail: Page 
1175
    1175
  • Thumbnail: Page 
1176
    1176
  • Thumbnail: Page 
1177
    1177
  • Thumbnail: Page 
1178
    1178
  • Thumbnail: Page 
1179
    1179
  • Thumbnail: Page 
1180
    1180
  • Thumbnail: Page 
1181
    1181
  • Thumbnail: Page 
1182
    1182
  • Thumbnail: Page 
1183
    1183
  • Thumbnail: Page 
1184
    1184
  • Thumbnail: Page 
1185
    1185