Decomposition properties in fluid queues

Authors:
Yujing Wu;Weibo Gong;Don Towsley
Affiliations:
Department of Computer Science, University of Calgary, Calgary AB, Canada T2N 1N4;Department of Electrical and Computer Engineering, University of Massachusetts, Amherst, MA 01003, USA;Department of Computer Science, University of Massachusetts, Amherst, MA 01003, USA
Venue:
Performance Evaluation
Year:
2008

Citing 2
Cited 0

Error analysis of burst level modeling of active-idle sources

ACM Transactions on Modeling and Computer Simulation (TOMACS)
Network decomposition: theory and practice

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We discover two decomposition properties in certain fluid queues. In a queue fed by burst flows, the impact of flow dynamics over shorter timescales on the mean buffer length can be separated from the impact of flow dynamics over larger timescales. A queue with multiple inputs can be decomposed into multiple simpler queues and the two systems have the same mean buffer length. This study may find applications in fast evaluation and resource management of computer networks.