Pavel Bocharov

  • Citations Per Year
Learn More
type i, , K , 1 i = who finds the server free begins to get service inmediately and leaves the system after completion. Otherwise, if the server is busy, the customer with probability 1 Hi leaves the system without service and with probability Hi > 0 joins an orbit of repeated customer but conserves its own type. The intervals separating two succesive(More)
Queueing networks with negative customers (G-networks), Poisson flow of positive customers, multi-server exponential nodes, and dependent service at the different nodes are studied. Every customer arriving at the network is defined by a set of random parameters: customer route, the length of customer route, customer volume and his service time at each route(More)
Abstract—G-networks with ordinary (positive) customers and signals are considered under the assumption that signal processing (activation) requires a random amount of time. Activated signals either move a customer from the node they arrive to another node or kill a positive customer. For a network in which positive customers are processed by a single server(More)
We consider a G-network with Poisson flow of positive customers. Each positive customer entering the network is characterized by a set of stochastic parameters: customer route, the length of customer route, customer volume and his service length at each route stage as well. The following node types are considered: (0) an exponential node with cn servers,(More)
  • 1