Computational methods for integral equations
Computational methods for integral equations
On defining, computing and guaranteeing quality-of-service in high-speed networks
IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 3)
On computing per-session performance bounds in high-speed multi-hop computer networks
SIGMETRICS '92/PERFORMANCE '92 Proceedings of the 1992 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
On the self-similar nature of Ethernet traffic (extended version)
IEEE/ACM Transactions on Networking (TON)
Dynamic management of guaranteed-performance multimedia connections
Multimedia Systems
Wide area traffic: the failure of Poisson modeling
IEEE/ACM Transactions on Networking (TON)
RCBR: a simple and efficient service for multiple time-scale traffic
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Experimental queueing analysis with long-range dependent packet traffic
IEEE/ACM Transactions on Networking (TON)
What are the implications of long-range dependence for VBR-video traffic engineering?
IEEE/ACM Transactions on Networking (TON)
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
On the relevance of long-range dependence in network traffic
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Predictive dynamic bandwidth allocation for efficient transport of real-time VBR video over ATM
IEEE Journal on Selected Areas in Communications
On the use of fractional Brownian motion in the theory of connectionless networks
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
Performance-oriented studies typically rely on the assumption that the stochastic process modeling the phenomenon of interest is already in steady state. This assumption is, however, not valid if the life cycle of the phenomenon under study is not large enough, since usually a stochastic process cannot reach steady state unless time evolves towards infinity. Therefore, it is important to address performance issues in transient state.Previous work in transient analysis of queueing systems usually focuses on Markov models. This paper, in contrast, presents an analysis of transient loss performance for a class of finite buffer queueing systems that are not necessarily Markovian. We obtain closed-form transient loss performance measures. Based on the loss measures, we compare transient loss performance against steady-state loss performance and examine how different assumptions on the arrival process will affect transient loss behavior of the queueing system. We also discuss how to guarantee transient loss performance. The analysis is illustrated with numerical results.