文件名称:Discrete_Time_Queue
- 所属分类：
- 数据库编程
- 资源属性：
- [Windows] [Visual C] [源码]
- 上传时间：
- 2012-11-26
- 文件大小：
- 1.59mb
- 下载次数：
- 0次
- 提 供 者：
- Yan****
- 相关连接：
- 无
- 下载说明：
- 别用迅雷下载，失败请重下，重下不扣分！
介绍说明－－下载内容均来自于网络，请自行研究使用
离散时间堆栈系统
The queue can store up to five packets. All packets are processed on a first come – first served basis. Assume that when a packet is serviced all other packets in a queue (if any) are shifted instantaneously towards the output. Each slot departures from the queue are processed before arrivals.-Discrete Time Queue
write a program to produce a discrete time simulation of a queue as shown in Fig. 1. Time is slotted on the input and the output. Each input packet follows a Bernoulli process. In a given time slot the independent probability that a packet arrives in a time slot is p, while the probability that the packet will be serviced is q. One packet fills one time slot. The queue can store up to five packets. All packets are processed on a first come – first served basis. Assume that when a packet is serviced all other packets in a queue (if any) are shifted instantaneously towards the output. Each slot departures from the queue are processed before arrivals.
The queue can store up to five packets. All packets are processed on a first come – first served basis. Assume that when a packet is serviced all other packets in a queue (if any) are shifted instantaneously towards the output. Each slot departures from the queue are processed before arrivals.-Discrete Time Queue
write a program to produce a discrete time simulation of a queue as shown in Fig. 1. Time is slotted on the input and the output. Each input packet follows a Bernoulli process. In a given time slot the independent probability that a packet arrives in a time slot is p, while the probability that the packet will be serviced is q. One packet fills one time slot. The queue can store up to five packets. All packets are processed on a first come – first served basis. Assume that when a packet is serviced all other packets in a queue (if any) are shifted instantaneously towards the output. Each slot departures from the queue are processed before arrivals.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
Discrete Time Queue\1.cpp
...................\1.dsp
...................\1.dsw
...................\1.ncb
...................\1.opt
...................\1.plg
...................\Debug\1.exe
...................\.....\1.ilk
...................\.....\1.obj
...................\.....\1.pch
...................\.....\1.pdb
...................\.....\projectdraft4.exe
...................\.....\projectdraft4.ilk
...................\.....\projectdraft4.pch
...................\.....\projectdraft4.pdb
...................\.....\vc60.idb
...................\.....\vc60.pdb
...................\projectdraft4.dsp
...................\projectdraft4.dsw
...................\projectdraft4.ncb
...................\projectdraft4.opt
...................\projectdraft4.plg
...................\Debug
Discrete Time Queue
...................\1.dsp
...................\1.dsw
...................\1.ncb
...................\1.opt
...................\1.plg
...................\Debug\1.exe
...................\.....\1.ilk
...................\.....\1.obj
...................\.....\1.pch
...................\.....\1.pdb
...................\.....\projectdraft4.exe
...................\.....\projectdraft4.ilk
...................\.....\projectdraft4.pch
...................\.....\projectdraft4.pdb
...................\.....\vc60.idb
...................\.....\vc60.pdb
...................\projectdraft4.dsp
...................\projectdraft4.dsw
...................\projectdraft4.ncb
...................\projectdraft4.opt
...................\projectdraft4.plg
...................\Debug
Discrete Time Queue