• Title/Summary/Keyword: Loss Probability

Search Result 639, Processing Time 0.027 seconds

M/PH/1 QUEUE WITH DETERMINISTIC IMPATIENCE TIME

  • Kim, Jerim;Kim, Jeongsim
    • Communications of the Korean Mathematical Society
    • /
    • v.28 no.2
    • /
    • pp.383-396
    • /
    • 2013
  • We consider an M/PH/1 queue with deterministic impatience time. An exact analytical expression for the stationary distribution of the workload is derived. By modifying the workload process and using Markovian structure of the phase-type distribution for service times, we are able to construct a new Markov process. The stationary distribution of the new Markov process allows us to find the stationary distribution of the workload. By using the stationary distribution of the workload, we obtain performance measures such as the loss probability, the waiting time distribution and the queue size distribution.

Distributed Resource Allocation in Multimedia Ad Hoc Local Area Networks Based on OFDM-CDMA (OFDM-CDMA 기반 멀티미디어 무선 Ad Hoc LAN에서의 분산적 자원 할당 방식)

  • Yang, Hyun-ho;Jeon, Hee-jeong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.5 no.7
    • /
    • pp.1250-1256
    • /
    • 2001
  • A resource management scheme for ad hoc wireless local area networks (AWLAN's) is presented. This scheme combines distributed resource management scheme and orthogonal frequency division multiplexing-code division multiple access(OFDM-CDMA) technique to support multimedia services with QoS guarantees. The performance evaluation has done in terms of blocking rates and QoS loss probability.

  • PDF

Performance Analysis of an ATM Multiplexer with Multiple QoS VBR Traffic

  • Kim, Young-Jin;Kim, Jang-Kyung
    • ETRI Journal
    • /
    • v.19 no.1
    • /
    • pp.13-25
    • /
    • 1997
  • In this paper, we propose a new queuing model, MMDP/MMDP/1/K, for an asynchronous transfer mode(ATM) multiplexer with multiple quality of service(QoS) variable bit rate (VBR) traffic in broadband-integrated services digital network (B-ISDN). We use the Markov Modulated Deterministic Process(MMDP) to approximate the actual arrival process and another MMDP for service process Using queuing analysis, we derive a formula for the cell loss probability of the ATM multiplexer in terms of the limiting probabilities of a Markov chain. The cell loss probability can be used for connection admission control in ATM multiplexer and the calculation of equivalent bandwidth for arrival traffic, The major advantages of this approach are simplicity in analysis, accuracy of analysis by comparison of simulation, and numerical stability.

  • PDF

A Stochastic Model for Maximizing the Lifetime of Wireless Sensor Networks (확률모형을 이용한 무선센서망 수명 최대화에 관한 분석)

  • Lee, Doo-Ho;Yang, Won-Seok
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.37 no.3
    • /
    • pp.69-78
    • /
    • 2012
  • Reduction of power consumption has been a major issue and an interesting challenge to maximize the lifetime of wireless sensor networks. We investigate the practical meaning of N-policy in queues as a power saving technique in a WSN. We consider the N-policy of a finite M/M/1 queue. We formulate the optimization problem of power consumption considering the packet loss probability. We analyze the trade-off between power consumption and the packet loss probability and demonstrate the operational characteristics of N-policy as a power saving technique in a WSN with various numerical examples.

Optimal Offset-Time Decision for QoS in Optical Burst Switching Networks

  • Kim, Sung-Chang;Choi, Jin-Seek;Yoon, Bin-Yeong;Kang, Min-Ho
    • Journal of Communications and Networks
    • /
    • v.9 no.3
    • /
    • pp.312-318
    • /
    • 2007
  • In this paper, we propose the optimal offset-time decision (OOD) algorithm which can effectively reduce the pre-transmission delay compared to the perfect isolation model, and can also be extended to general n priority classes while the target loss probability of each class is guaranteed for the variable offered load. In order to drive the OOD algorithm, we first analyze the loss probability of each priority class through class aggregation and iteration method; the analytic results obtained through the proposed algorithm are then validated with results garnered from extensive simulation tests.

Integrated Model for Assessment of Risks in Rail Tracks under Various Operating Conditions

  • G. Chattopadhyay;V. Reddy;Larsson, P-O
    • International Journal of Reliability and Applications
    • /
    • v.4 no.4
    • /
    • pp.183-190
    • /
    • 2003
  • Rail breaks and derailments can cause a huge loss to rail players due to loss of service, revenue, property or even life. Maintenance has huge impact on reliability and safety of railroads. It is important to identify factors behind rail degradation and their risks associated with rail breaks and derailments. Development of mathematical models is essential for prediction and prevention of risks due to rail and wheel set damages, rail breaks and derailments. This paper addresses identification of hazard modes, estimation of probability of those hazards under operating, curve and environmental condition, probability of detection of potential hazards before happening and severity of those hazards for informed strategic decisions. Emphasis is put on optimal maintenance and operational decisions. Real life data is used for illustration.

  • PDF

Exact Decoding Probability of Random Linear Network Coding for Tree Networks

  • Li, Fang;Xie, Min
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.2
    • /
    • pp.714-727
    • /
    • 2015
  • The hierarchical structure in networks is widely applied in many practical scenarios especially in some emergency cases. In this paper, we focus on a tree network with and without packet loss where one source sends data to n destinations, through m relay nodes employing random linear network coding (RLNC) over a Galois field in parallel transmission systems. We derive closed-form probability expressions of successful decoding at a destination node and at all destination nodes in this multicast scenario. For the convenience of computing, we also propose an upper bound for the failure probability. We then investigate the impact of the major parameters, i.e., the size of finite fields, the number of internal nodes, the number of sink nodes and the channel failure probability, on the decoding performance with simulation results. In addition, numerical results show that, under a fixed exact decoding probability, the required field size can be minimized. When failure decoding probabilities are given, the operation is simple and its complexity is low in a small finite field.

Evaluation of Piping Failure Probability of Reactor Coolant System in Kori Unit 1 Considering Stress Corrosion Cracking (응력부식균열을 고려한 고리 1호기 원자로냉각재계통의 배관 파손확률 평가)

  • Park, Jeong Soon;Choi, Young Hwan;Park, Jae Hak
    • Transactions of the Korean Society of Pressure Vessels and Piping
    • /
    • v.6 no.1
    • /
    • pp.43-49
    • /
    • 2010
  • The piping failure probability of the reactor coolant system in Kori unit 1 was evaluated considering stress corrosion cracking. The P-PIE program (Probabilistic Piping Integrity Evaluation Program) developed in this study was used in the analysis. The effect of some variables such as oxygen concentration during start up and steady state operation, and operating temperature, which are related with stress corrosion cracking, on the piping failure probabilities was investigated. The effects of leak detection capability, the size of big leak, piping loops, and reactor types on the piping failure probability were also investigated. The results show that (1) LOCA (loss of coolant accident) probability of Kori unit 1 is extremely low, (2) leak probability is sensitive to oxygen concentration during steady state operation and operating temperature, while not sensitive to the oxygen concentration during start up, and (3) the piping thickness and operating temperature play important roles in the leak probabilities of the cold leg in 4 reactor types having same inner diameter.

  • PDF

Effective Priority Control Scheme according to Cell Loss Probability in ATM (ATM에서의 셀 손실율에 따른 효율적인 우선순위 제어)

  • 이상태;김남희전병실
    • Proceedings of the IEEK Conference
    • /
    • 1998.06a
    • /
    • pp.70-73
    • /
    • 1998
  • This paper present a new priority control mechanism which is to balance the cell loss rate by measuring, in real time, the number of discarded cells in the queuing system with a different loss priority for each class of service such that each class of service meets its cell loss rate requirements. And, to reduce the delay rates we modified existing cell scheduling scheme. Throughout the computer simulation, the existing methods and proposed scheme is compared with respect to cell loss rate and average delay time. In the result of simulation, the proposed scheme have more improved performance than the other schemes with respect to cell loss rate and average delay time.

  • PDF

Window input buffer switch performance progressing by pushing police (푸싱 방식에 의한 윈도우 입력 버퍼 스위치의 성능 향상 에 관한 연구)

  • 양승헌;조용권;곽재영;이문기
    • Proceedings of the IEEK Conference
    • /
    • 2000.06a
    • /
    • pp.123-126
    • /
    • 2000
  • In this paper, we are proposed to pushing window input buffer A.T.M Switch that is not use memory read and write of general window police. Pushing window switch is superior to general window switch in performance but is large to general window switch in cross point number. Max throughput and Cell occupying probability results are verified by analysis an simulation. The evaluation of performance is max throughput and cell loss probability and mean queue length.

  • PDF