IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Latency-rate servers: a general model for analysis of traffic scheduling algorithms
IEEE/ACM Transactions on Networking (TON)
Performance bonds for flow control protocols
IEEE/ACM Transactions on Networking (TON)
Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
Journal of the ACM (JACM)
On the performance of multiplexing independent regulated inputs
Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Delay analysis for CBR traffic under static-priority scheduling
IEEE/ACM Transactions on Networking (TON)
Worst case burstiness increase due to FIFO multiplexing
Performance Evaluation
A min, + system theory for constrained traffic regulation and dynamic service guarantees
IEEE/ACM Transactions on Networking (TON)
A calculus for network delay. I. Network elements in isolation
IEEE Transactions on Information Theory
A calculus for network delay. II. Network analysis
IEEE Transactions on Information Theory
Statistical service assurances for traffic scheduling algorithms
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
We propose a simple framework for analyzing feedforward queueing networks that have the following features: each customer belongs to a (customer) flow and the route that a customer follows in the network depends on the flow to which he belongs. The amount of traffic fed by a customer flow into the network is bounded by a deterministic subadditive function, which is called a subadditive envelope in this paper. Customers are served according to a FIFO discipline at each queue. We show that the boundary of the virtual-waiting-time distribution at each queue in such networks can be analytically derived, based on the information concerning subadditive envelopes of flows. By using the proposed analysis, we investigate how the envelope of a flow changes when it traverses a series of queues.