Results 21 to 30 of about 56,152 (322)
Branching processes, the max-plus algebra and network calculus [PDF]
Branching processes can describe the dynamics of various queueing systems, peer-to-peer systems, delay tolerant networks, etc. In this paper we study the basic stochastic recursion of multitype branching processes, but in two non-standard contexts. First,
D.G. Kendall +18 more
core +2 more sources
Queueing theory is currently a widely used method for optimizing activities not only in air transport but also in other sectors, in both production and the use of personnel.
Edina Jenčová +2 more
doaj +1 more source
About the cumulative idle time in multiphase queues [PDF]
The paper is designated to the analysis of queueing systems, arising in the network theory and communications theory (called multiphase queueing systems, tandem queues or series of queueing systems).
Minkevičius, Saulius +1 more
core +1 more source
Queueing Systems with Random Volume Customers and a Sectorized Unlimited Memory Buffer
In the present paper, we concentrate on basic concepts connected with the theory of queueing systems with random volume customers and a sectorized unlimited memory buffer.
Tikhonenko Oleg +2 more
doaj +1 more source
Optimization Method of Dynamic Beam Position for LEO Beam-Hopping Satellite Communication Systems
The beam-hopping (BH) technology applied to low earth orbit (LEO) satellite communication networks is a superior choice, but the long transmission delay partly caused by data packets waiting in the queue of satellite transponders will seriously affect ...
Jingyu Tang +4 more
doaj +1 more source
Application of queueing models with abandonment for Call Center congestion analysis [PDF]
This paper studies and applies queueing systems to Call Centers regarding the possibility of customer abandonment from the system before being served due to their impatience in waiting for a service.
Sidney Carlos Ferrari, Reinaldo Morabito
doaj +1 more source
Analysis of Closed Queueing Networks with Batch Service [PDF]
We consider a closed queuing network with batch service and movements of customers in continuous time. Each node in the queueing network is an infinite capacity single server queueing system under a RANDOM discipline.
Stankevich, Elena Petrovna +2 more
doaj +1 more source
Selfish traffic allocation for server farms [PDF]
We study the price of selfish routing in noncooperative networks like the Internet. In particular, we investigate the price of selfish routing using the price of anarchy (a.k.a.
Artur Czumaj +3 more
core +1 more source
Abstract Mobile Ad‐hoc Network (MANET) is an ad hoc Wireless subset with a unique dynamic geometry of the system and movable nodes. The MANETs are auto‐organized networks that permit mobility without infrastructure. Specific protocols for MANET routing are provided with these attributes.
Shalini Goel +5 more
wiley +1 more source
Maximum Likelihood Estimation of Closed Queueing Network Demands from Queue Length Data [PDF]
Resource demand estimation is essential for the application of analyical models, such as queueing networks, to real-world systems. In this paper, we investigate maximum likelihood (ML) estimators for service demands in closed queueing networks with load ...
Bard Y. +7 more
core +2 more sources

