Continuously growing needs for distributed applications that transmit massive amount of data has led to the emergence of high-speed networks that require broadband and multimedia capabilities. Such networks are supposed to have the ability to handle heterogeneous trajjic and to manage large span of resources and services effectively. In this paper, a single server G/D/l queuing system with infinite buffer is simulated with the consideration of three input traffic sources: exponential, weibull, and normal distrbutions. The upper bounds on buffer size are evaluated for the given distributions. 1
In this thesis, we study an important measure of network congestion: the queue length (buffer occupa...
We consider a queuing network consisting of two nodes connected in series. Jobs (or customers) arriv...
The interaction of traffic streams within an ATM network raises several interesting ques-tions conce...
Continuously growing needs for distributed applications that transmit massive amount of data has led...
Queueing theory offers a large variety of techniques that can be used in performance modelling of co...
We present the results of a parametric study of the buffer size needed to prevent overflow or loss i...
this paper, we will plot using logarithmic scales, usually multiplying by 1-ae. The curves are disco...
Traffic on high-speed networks is expected to be `bursty'. This has spurred interest in the que...
Rapid development of telecommunication technologies and the ever growing network user’s demands ha...
ATM traffic is complex but only simple statistical models are amenable to mathematical analysis. We ...
The present article explores a queuing system with multiple inputs, single server, different service...
Abstract: The present article explores a queuing system with multiple inputs, single server, differe...
An analytic cost model is presented for M/G/1/N queueing systems. It considers the cost of customer ...
The paper recommends an approach to estimate effectively the probability of buffer overflow in high-...
In this contribution, we investigate the performance of the output buffer of an ‘ondemand’ video str...
In this thesis, we study an important measure of network congestion: the queue length (buffer occupa...
We consider a queuing network consisting of two nodes connected in series. Jobs (or customers) arriv...
The interaction of traffic streams within an ATM network raises several interesting ques-tions conce...
Continuously growing needs for distributed applications that transmit massive amount of data has led...
Queueing theory offers a large variety of techniques that can be used in performance modelling of co...
We present the results of a parametric study of the buffer size needed to prevent overflow or loss i...
this paper, we will plot using logarithmic scales, usually multiplying by 1-ae. The curves are disco...
Traffic on high-speed networks is expected to be `bursty'. This has spurred interest in the que...
Rapid development of telecommunication technologies and the ever growing network user’s demands ha...
ATM traffic is complex but only simple statistical models are amenable to mathematical analysis. We ...
The present article explores a queuing system with multiple inputs, single server, different service...
Abstract: The present article explores a queuing system with multiple inputs, single server, differe...
An analytic cost model is presented for M/G/1/N queueing systems. It considers the cost of customer ...
The paper recommends an approach to estimate effectively the probability of buffer overflow in high-...
In this contribution, we investigate the performance of the output buffer of an ‘ondemand’ video str...
In this thesis, we study an important measure of network congestion: the queue length (buffer occupa...
We consider a queuing network consisting of two nodes connected in series. Jobs (or customers) arriv...
The interaction of traffic streams within an ATM network raises several interesting ques-tions conce...