a two server queueing system with single and batch service is considered in this paper. the arrival process is assumed to be poisson and the service rate follows an exponential distribution. server-i serves the customers in both single and batch service, while server-ii serves the customers in batch service only. the laplace transform of the transient and steady state behavior of the model is c...

Buuer management schemes are needed in shared-memory ATM switches to regulate the sharing of memory among diierent output port queues and among traac classes with diierent loss priorities. Earlier we proposed a single-priority scheme called Dynamic Threshold, in which the maximum permissible queue length is proportional to the unused buuering in the switch. In this paper, we propose and analyze...

In this paper we consider the problem of estimating the parameters of a Markov queueing model from discrete time observations of the queue length. The proposed approach is an application of the martingale estimating function methodology which has been used extensively in mathematical finance. A small simulation study suggests that the estimator performs well, even for moderate sample size, and ...

Road traffic congestion in modern cities has become essential problem which need to be solved. To solve this problem, we have proposed a dynamic traffic light controller system based on image processing. Images (the road-images) used in this research are taken by digital camera placed at fixed position in the traffic-light with specific resolution and distance. The taken images will be analyzed...

Consider a single-server queue with a renewal arrival process and generally distributed processing times in which each customer independently reneges if service has not begun within a generally distributed amount of time. We establish that both the workload and queue-length processes in this system can be approximated by a regulated Ornstein-Uhlenbeck (ROU) process when the arrival rate is clos...

Internet Routers face the problem of congestion due to the increased use of Internet. Active Queue Management algorithm is a solution to the problem of congestion control in the Internet routers. As data traffic is bursty in routers, burstiness must be handled without comprising the high link utilization and low queuing delay. Congested link causes many problems such as large delay, unfairness ...

New deterministic algorithms for routing permutations on an n n MIMD mesh are presented. They are very eecient in terms of the size of auxiliary memory at each processor, measured as the maximum number of packets that need to be queued. One algorithm runs in the optimal time 2 n ? 2 with a maximum queue length of 33. Another runs in the near-optimal time 2 n + O(1) with a maximum queue length o...

Performance of the Adaptive RED scheme is susceptible to bursty web traffic. A parallel queue structure was proposed earlier to address this problem, where real time connections (such as web and UDP) and non-real time connections (such as FTP) are served in two different queues with droptail and Adaptive RED policies, respectively. In this paper a modified Adaptive RED scheme is proposed for th...