Energy Packet Networks with general service time distribution

2020 ◽  
Author(s):  
Youssef Ait El Mahjoub ◽  
Jean-Michel Fourneau ◽  
Hind Castel-Taleb
Keyword(s):  
Service Time ◽  
Time Distribution ◽  
Packet Networks ◽  
Service Time Distribution ◽  
General Service

The discrete-time single-server queue with time-inhomogeneous compound Poisson input and general service time distribution

1978 ◽  
Vol 15 (3) ◽  
pp. 590-601 ◽  
Author(s):  
Do Le Minh
Keyword(s):  
Discrete Time ◽  
Service Time ◽  
Time Distribution ◽  
Single Server ◽  
Service Time Distribution ◽  
Queueing Model ◽  
Compound Poisson ◽  
Poisson Input ◽  
Server Queue ◽  
General Service

This paper studies a discrete-time, single-server queueing model having a compound Poisson input with time-dependent parameters and a general service time distribution.All major transient characteristics of the system can be calculated very easily. For the queueing model with periodic arrival function, some explicit results are obtained.

The discrete-time single-server queue with time-inhomogeneous compound Poisson input and general service time distribution

1978 ◽  
Vol 15 (03) ◽  
pp. 590-601 ◽  
Author(s):  
Do Le Minh
Keyword(s):  
Discrete Time ◽  
Service Time ◽  
Time Distribution ◽  
Single Server ◽  
Service Time Distribution ◽  
Queueing Model ◽  
Compound Poisson ◽  
Poisson Input ◽  
Server Queue ◽  
General Service

This paper studies a discrete-time, single-server queueing model having a compound Poisson input with time-dependent parameters and a general service time distribution. All major transient characteristics of the system can be calculated very easily. For the queueing model with periodic arrival function, some explicit results are obtained.

scholarly journals An Analysis of a Close-Type Queuing System with General Service-Time Distribution

1970 ◽  
Vol 3 (1) ◽  
pp. 77-82
Author(s):  
Yoshio Yoshioka ◽  
Tomoyuki Nagase
Keyword(s):  
Service Time ◽  
Time Distribution ◽  
Probability Distributions ◽  
Queuing System ◽  
Multiprocessor System ◽  
Service Time Distribution ◽  
Systems Model ◽  
Proposed Model ◽  
Repair Procedure ◽  
General Service

This paper presents an innovative approach to solve probability distributions of a close feed back loop type queuing system with general service time distribution. This model is applied to a multiprocessor system where some of its nodes are performed a repair procedure during a nodes malfunction condition. Our model is appropriate for a multiprocessor system that employs a common bus or for a multi-node system in computer networks. A meticulous analysis of the systems model has been conducted and numerical results have been obtained to scrutinize the proposed model.

scholarly journals Buffer Overflow Period in a MAP Queue

2007 ◽  
Vol 2007 ◽  
pp. 1-18 ◽  
Author(s):  
Andrzej Chydzinski
Keyword(s):  
Service Time ◽  
Time Distribution ◽  
Markovian Arrival Process ◽  
Numerical Calculations ◽  
Buffer Overflow ◽  
Arrival Process ◽  
Service Time Distribution ◽  
Process Map ◽  
General Service ◽  
Number Of Cells

The buffer overflow period in a queue with Markovian arrival process (MAP) and general service time distribution is investigated. The results include distribution of the overflow period in transient and stationary regimes and the distribution of the number of cells lost during the overflow interval. All theorems are illustrated via numerical calculations.

Sign in / Sign up

Export Citation Format

Share Document