As a model for streaming multimedia applications, we study an unreliable retrial queue with infinite-capacity orbit and normal queue for which the retrial rate and the server repair rate are controllable. Customers join the retrial orbit if and only if their service is interrupted by a server failure. Interrupted customers do not rejoin the normal queue but repeatedly attempt to access the serv...

this paper presents a discrete-time single-server finite buffer n threshold policy queue with renewal input and discretemarkovian service process. the server terminates service whenever the system becomes empty, and recommencesservice as soon as the number of waiting customers in the queue is n. we obtain the system-length distributionsat pre-arrival and arbitrary epochs using the supplementary...

active queue management (aqm) plays an important role in the internet congestion control. it tries to enhance congestion control, and to achieve tradeoff between bottleneck utilization and delay. random early detection (red) is the most popular active queue management algorithm that has been implemented in the in internet routers and is trying to supply low delay and low packet loss. red algori...

Differentiated Services (DiffServ) is a promising architecture for the next generation Internet due to its highly flexible, scalable and interoperable design. In DiffServ, scheduling disciplines play an important role in achieving service differentiation. In this paper, we extend the average delay analysis of the Probabilistic Priority (PP) scheduling discipline first proposed in [8] to the mul...

This paper proposes the use of discrete stochastic approximation (DSA) algorithm for a crosslayer adaptive modulation problem in wireless communications. In this system, the throughput in the physical (PHY) layer and quality of service (QoS) incurred by the queueing effects in the data link layer are required to be optimized simultaneously and in the long run. By assuming Markov decision proces...

This paper provides steady state queue-size distribution for a G/G/1 queue by using principle of maximum entropy. For this purpose we have used average queue length and normalizing condition as constraints to derive queue-size distribution. Our results give good approximation as demonstrated by taking a numerical illustration. In particular case when square coefficient of variation of inter-arr...

workspace analysis is one of the most important issues in the robotic parallel manipulator design. ‎however, ‎the unidirectional constraint imposed by cables causes this analysis more challenging in the cabledriven redundant parallel manipulators. controllable workspace is one of the general workspace in the cabledriven redundant parallel manipulators due to the dependency on geometry parameter...

Priority queues are container data structures essential to many high performance computing applications. In this paper, we introduce multiresolution priority queues , a data structure that achieves greater performance than the standard heap based implementation by trading off a controllable amount of resolution in the space of priorities. The new data structure can reduce the worst case perform...

in this paper, we study the network location problem for two congestible facilities, considering impatient customers. we suppose that when a customer arrives his/her corresponding facility and faces a queue with the size more than a predetermined threshold, the customer decides not to join the queue but to go to the closest facility to current facility. in the second facility, if the queue size...