Browsing by Author "Nikolov, A. V."

Now showing 1 - 3 of 3
  • No Thumbnail Available
    Item
    Approximate Model for a Merge Configuration of Multiservers With Finite Capacity Intermediate Buffers
    (International Journal of Applied Mathematics, 2013) Nikolov, A. V.
    We consider a queueing network consisting of multiservers in parallel and connected to a merger queue. All servers have an infinite capacity buffers. The configuration is decomposed into two subsystems: merging multi-servers and merger server and then analyzed in isolation. All times are assumed to be exponentially distributed. First we set and solve the equations for the aggregated merger queue, then express the occupancy probabilities of the original queue through the probabilities of the aggregated one, which reduces significantly the number of equations describing the behavior of the network. Using the fore-mentioned result, we derive expressions for the occupancy probabilities and other parameters of the merging queue.
  • No Thumbnail Available
    Item
    Finite Capacity Queue with Multiple Poisson Arrivals and Generally Distrubuted Service Times
    (International Journal of Applied Mathematics, 2013) Nikolov, A. V.
    The present article explores a queuing system with multiple inputs, single server, different service rates, and limited size of the buffer. The system parameters are crucial for the performance of numerous applications. We develop an analytical model of such a system and obtain the following results: steady-state probabilities of the system and system throughput.
  • No Thumbnail Available
    Item
    Model For A Merge Configuration of Identical Single Servers with Finite Capacity Buffers
    (International Journal of Scientific Research, 2013) Nikolov, A. V.
    We consider a queuing network consisting of identical single servers in parallel and connected to a merger queue. All servers have finite capacity buffers of equal size. The configuration is decomposed into two subsystems: merging servers and merger server and then analyzed in isolation. All times of the merging servers are assumed to be exponentially and identically distributed, but the service time of the merger queue is quite generally distributed. First we set and solve integro-differential equations for the merger queue, then express the occupancy probabilities of the merging queue through the probabilities of the merger, which reduces significantly the number of equations describing the behavior of the network.