scholarly journals On pseudo-conservation laws for the cyclic server system with compound Poisson arrivals

1991 ◽  
Vol 10 (8) ◽  
pp. 453-459 ◽  
Author(s):  
Jhitti Chiarawongse ◽  
Mandyam M Srinivasan
Keyword(s):  
Conservation Laws ◽  
Compound Poisson ◽  
Poisson Arrivals ◽  
Server System

Queueing Systems of INAR(1) Processes with Compound Poisson Arrivals

2015 ◽  
Vol 31 (4) ◽  
pp. 618-635 ◽  
Author(s):  
Sebastian Schweer ◽  
Cornelia Wichelhaus
Keyword(s):  
Queueing Systems ◽  
Compound Poisson ◽  
Poisson Arrivals

scholarly journals Congestion probabilities in OFDM wireless networks with compound Poisson arrivals

2020 ◽  
Vol 14 (4) ◽  
pp. 674-681 ◽  
Author(s):  
Panagiotis I. Panagoulias ◽  
Ioannis D. Moscholios ◽  
Panagiotis G. Sarigiannidis ◽  
Michael D. Logothetis
Keyword(s):  
Wireless Networks ◽  
Compound Poisson ◽  
Poisson Arrivals

A solution to the fixed-cycle traffic light problem for compound Poisson arrivals

1968 ◽  
Vol 5 (3) ◽  
pp. 624-635 ◽  
Author(s):  
Donald R. McNeil
Keyword(s):  
Traffic Flow ◽  
Cycle Time ◽  
Mathematical Theory ◽  
Basic Problem ◽  
Arrival Process ◽  
Traffic Light ◽  
Compound Poisson ◽  
Factors Affecting ◽  
Poisson Arrivals ◽  
Pass Through

A basic problem in the mathematical theory of traffic flow is to obtain the expected delay to a vehicle at a fixed-cycle traffic light controlling an intersection. The factors affecting this expected delay are the cycle time, the fraction of time the traffic light is effectively red, the number of vehicles which can pass through when the signal is green, and the nature of the (random) arrival process for the vehicles. Once a solution is known, it is possible to fix the cycle time and the effective red period in such a way that the expected delay is minimized.

Some applications of the theory of infinite capacity service systems to a single server system with linearly state dependent service

1971 ◽  
Vol 8 (01) ◽  
pp. 202-207
Author(s):  
B. W. Conolly
Keyword(s):  
Queueing System ◽  
Service Systems ◽  
Single Server ◽  
Simple Manner ◽  
State Dependent ◽  
Poisson Arrivals ◽  
Negative Exponential ◽  
Server System

Summary A certain single server queueing system with negative exponential service with mean rate nμ, when the system contains n customers, and Poisson arrivals, is formally equivalent to the infinite capacity system M/M/∞. This equivalence is exploited to yield in a very simple manner results for the single server system which were previously obtained by difficult analysis (see Hadidi (1969)).

scholarly journals The shuttle dispatch problem with compound Poisson arrivals: Controls at two terminals

1990 ◽  
Vol 6 (1) ◽  
pp. 207-221 ◽  
Author(s):  
Hyo-Seong Lee ◽  
Mandyam M. Srinivasan
Keyword(s):  
Compound Poisson ◽  
Poisson Arrivals

Some applications of the theory of infinite capacity service systems to a single server system with linearly state dependent service

1971 ◽  
Vol 8 (1) ◽  
pp. 202-207 ◽  
Author(s):  
B. W. Conolly
Keyword(s):  
Queueing System ◽  
Service Systems ◽  
Single Server ◽  
Simple Manner ◽  
State Dependent ◽  
Poisson Arrivals ◽  
Negative Exponential ◽  
Server System

SummaryA certain single server queueing system with negative exponential service with mean rate nμ, when the system contains n customers, and Poisson arrivals, is formally equivalent to the infinite capacity system M/M/∞. This equivalence is exploited to yield in a very simple manner results for the single server system which were previously obtained by difficult analysis (see Hadidi (1969)).

Sign in / Sign up

Export Citation Format

Share Document