Location:
Search - poisson queue
Search list
Description: 自己写的用Matlab模拟一个缓冲区大小（包括正在服务的那个）为10的随机排队系统。
（1）到达过程是的泊松过程（到达速率为Mu），服务时间服从独立指数分布（均值为1/Lamda）。
对Mu//Lamda=0.2，Mu//Lamda=0.8和Mu//Lamda=1.1三种情况进行仿真，求出队列中接受服务用户为n的概率P(n), n=0,...,10。并与理论结果进行比较。
（2）假设到达过程为均匀过程（到达速率为Mu），服务时间服从独立瑞利分布（均值为1/Lamda）。-yourself writing a simulation using Matlab buffer size (including services that are) for the following 10 Machine queuing system. (1) arrival process is the Poisson process (arrival rate of Mu), submit to independent service index distribution (mean of 1 / Lamda). Right Mu / / Lamda = 0.2, Mu / / Lamda = 0.8 and the Mu / / = 1.1 Lamda three of the simulation, Queue calculated users receive services n the probability P (n), n = 0 ,..., 10. And with the theoretical results. (2) It is assumed that the arrival process for the uniform process (arrival rate of Mu), submit to independent service Rayleigh distribution (mean of 1 / Lamda).
Platform: |
Size: 1873 |
Author: xiaoce |
Hits:
Description: 这是一个将指定区域内的图像提取出来，与指定图像进行融合的matlab程序，由泊松方程引申而来-This is a designated area of the extracted image, with a specified image of Matlab integration process from the Poisson equation arising from
Platform: |
Size: 81920 |
Author: dale |
Hits:
Description: 自己写的用Matlab模拟一个缓冲区大小（包括正在服务的那个）为10的随机排队系统。
（1）到达过程是的泊松过程（到达速率为Mu），服务时间服从独立指数分布（均值为1/Lamda）。
对Mu//Lamda=0.2，Mu//Lamda=0.8和Mu//Lamda=1.1三种情况进行仿真，求出队列中接受服务用户为n的概率P(n), n=0,...,10。并与理论结果进行比较。
（2）假设到达过程为均匀过程（到达速率为Mu），服务时间服从独立瑞利分布（均值为1/Lamda）。-yourself writing a simulation using Matlab buffer size (including services that are) for the following 10 Machine queuing system. (1) arrival process is the Poisson process (arrival rate of Mu), submit to independent service index distribution (mean of 1/Lamda). Right Mu// Lamda = 0.2, Mu// Lamda = 0.8 and the Mu// = 1.1 Lamda three of the simulation, Queue calculated users receive services n the probability P (n), n = 0 ,..., 10. And with the theoretical results. (2) It is assumed that the arrival process for the uniform process (arrival rate of Mu), submit to independent service Rayleigh distribution (mean of 1/Lamda).
Platform: |
Size: 2048 |
Author: xiaoce |
Hits:
Description: C++程序，关于波松过程进入系统的包发送的仿真。对系统的队列的侦测。-C++ Process, Poisson process on the packets sent into the system simulation. The system queue detection.
Platform: |
Size: 483328 |
Author: chl |
Hits:
Description: 设计一个M/M/S/k排队系统模型，用C++进行仿真，计算一个新的服务请求在各个状态k下的阻塞率，绘制出到达率-阻塞率曲线(matlab)，并将理论值与仿真值进行比较。
M/M/S/k模型为服务请求到达间隔时间服从泊松分布、服务时间服从指数分布、系统有S个服务器、系统容量为k（有限个）的排队系统。如果一个服务请求到达排队系统时，系统内已有k个服务请求，那么这个服务请求就会被拒绝（即不为该服务请求安排服务器，也不会将其排入系统队列）。由于系统容量为k，有S个服务器，所以系统队列的长度为k-S。-The design of a M/M/S/k queuing system model, with C++ for simulation, calculation of a new service request in every state under the blocking rate k, the arrival rate of drawing- blocking probability curve (matlab), and the theoretical value and simulation values.
M/M/S/k model for the service request arrival time to obey Poisson distribution, exponential distribution of service time, the system has S servers, the system capacity of k (finite) of the queuing system. If a service request arrival queuing system, the system has k service request, then the service request will be rejected (that is, do not arrange for the service request server, nor will its queue into the system). Since the system capacity for the k, there are S servers, so the length of the queue system kS.
Platform: |
Size: 112640 |
Author: 张三 |
Hits:
Description: 拥有四条通路的转盘路口排队模型模拟。相邻路口的弧形段假设为一容量有限的队列。到达为泊松分布，不考虑车长的堵塞影响-Four channels have lined up at the junction of the turntable model. Paragraph of the arc adjacent to the junction is assumed to be a queue with limited capacity. The reach follow the Poisson distribution.The model does not consider the impact of the longs of the cars impact to the plug.
Platform: |
Size: 2048 |
Author: Wico |
Hits:
Description: This a matlab code that simulates a M/M/1 queue in a network where the queue length is got as a input and the arrival rate is poisson-This is a matlab code that simulates a M/M/1 queue in a network where the queue length is got as a input and the arrival rate is poisson
Platform: |
Size: 11264 |
Author: Aswink |
Hits:
Description: 排队论编程，单柜台，泊松分布到达，指数分布服务时间，求解平均等待队长-Queuing theory to programming, a single counter, Poisson arrival, exponential service time, average waiting queue length for solving
Platform: |
Size: 2048 |
Author: |
Hits:
Description: Simulate queueing
In queueing theory, a discipline within the mathematical theory of probability, an M/M/1 queue represents the queue length in a system having a single server, where arrivals are determined by a Poisson process and job service times have an exponential distribution. The model name is written in Kendall s notation. The model is the most elementary of queueing models[1] and an attractive object of study as closed-form expressions can be obtained for many metrics of interest in this model-In queueing theory, a discipline within the mathematical theory of probability, an M/M/1 queue represents the queue length in a system having a single server, where arrivals are determined by a Poisson process and job service times have an exponential distribution. The model name is written in Kendall s notation. The model is the most elementary of queueing models[1] and an attractive object of study as closed-form expressions can be obtained for many metrics of interest in this model
Platform: |
Size: 1024 |
Author: Giren |
Hits:
Description: In queueing theory, the M/M/c queue is a multi-server queueing model.[1] In Kendall s notation it describes a system where arrivals form a single queue and are governed by a Poisson process, there are c servers and job service times are exponentially distributed.[2] It is a generalisation of the M/M/1 queue which considers only a single server. The model with infinitely many servers is the M/M/∞ queue.
Platform: |
Size: 1024 |
Author: Giren |
Hits:
Description: 解决M/M/1排队论问题，服务时间服从指数分布，队列为泊松流。系统输出为每个个体的到达时间，离开时间，等待时间，逗留时间-M/M/1 queuing theory to solve the problem, the service time is exponentially distributed, the queue is Poisson. System output for each individual arrival time, departure time, waiting time, length of stay
Platform: |
Size: 1024 |
Author: sherry |
Hits:
Description: 这是一个M/M/C/∞排队系统，其中顾客按照泊松流输入，服务时间按照负指数分布，有C个服务台的单列多台并列服务系统。在这种系统，顾客到达系统后排成一个队列，然后到空闲的服务台接受服务，而每个服务台的服务时间都服从相同参数的负指数分布，服务完毕后顾客自动离去。(This is a M/M/C/ infinity queueing system, where the customers enter the Poisson flow, the service time is distributed according to the negative exponent, and there are C single row multiple parallel service systems of the service stations. In such a system, customers arrive at the system in the rear row into a queue, then receive service at the idle service desk, while the service time of each service station obeys the negative exponential distribution of the same parameter. After the service is finished, the customer automatically goes away.)
Platform: |
Size: 11264 |
Author: 阿杰哟666 |
Hits: