G/D/1 Queueing Analysis by Discrete Time Modeling
スポンサーリンク
概要
- 論文の詳細を見る
G/D/1 is a theoretic model for ATM network queueing based on processing cells. We investigatc the G/D/1 system by discrete time modeling. Takacs' combinatorial methods are applied to analyze the system performance. An approximation for the survivor function P[Q>q], which is the probability that the queue length Q in the stationary state exceeds q, is obtained. The obtained formula requires only very small computational complexity and gives good approximation for the true value of P[Q>q].
- 社団法人電子情報通信学会の論文
- 1996-03-25
著者
関連論文
- B-7-158 FAIRNESS IN MULTI-HOP AD-HOC NETWORKS
- Solitary fibrous tumor of the abdominal wall
- Treatment of infected total knee arthroplasty in patients with rheumatoid arthritis
- Cross-Layer Scheme to Control Contention Window for Per-Flow in Asymmetric Multi-Hop Networks
- Achieving Fairness over 802.11 Multihop Wireless Ad Hoc Networks
- G/D/1 Queueing Analysis by Discrete Time Modeling
- On the Exponential Decay of the Tail Probability of a Continuous Type Random Variable
- Application of Tauberian theorem to the exponential decay of the tail probability of a random variable (解析学における問題の計算機による解法--RIMS研究集会報告集)
- Pigmented variant of benign oncocytic lesion of the pharynx
- The Geometry and the Large Deviations of M/D/1 Queues
- Experimental Study of Collision Motion, Contact Force and Adhesion Force of Hemispherical Sliders with Stationary Magnetic Disks
- B-8-10 Cooperative Spectrum Sensing Techniques in Cognitive Radio Networks