• Title/Summary/Keyword: loss probabilities

Search Result 20, Processing Time 0.135 seconds

Efficient Estimation of Cell Loss Probabilities for ATM Switches with Input Queueing via Light Traffic Derivatives

  • Kim, Young-Beom;Jung Hur
    • Journal of Electrical Engineering and information Science
    • /
    • v.2 no.6
    • /
    • pp.56-63
    • /
    • 1997
  • Under most system assumptions, closed form solutions of performance measures for ATM switches with input queueing are not available. In this paper, we present expressions and bounds for the derivatives of cell loss probabilities with respect to the arrival rate evaluated at a zero arrival rate. These bounds are used to give an approximation by Taylor expansion, thereby providing an economical way to estimate cell loss probabilities in light traffic.

  • PDF

Queueing Analysis for an ATM Multiplexer Loader by CBR and ON/OFF Traffic Sources (CBR과 ON/OFF 트레픽원이 혼합된 ATM 다중화기에 대한 큐잉 분석)

  • 김승환;박진수
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.31A no.6
    • /
    • pp.9-17
    • /
    • 1994
  • ATM (Asynchronous Transfer Mode) has a fixed-length packet transport scheme. It is one of the promising proposals in B-ISDN.Since the packet length is fixed, it can be potentially to perform the various service to users. In this paper, a queueing model for an ATM multip`exer loaded by CBR and ON/OFF input sources is considered, and the two-queue system which each type of input sources has a queue with a finite capacity is analyzed. The cell loss probabilities for a performance measures of ATM multiplexer are derived, and are also evaluated through numerical examples. As a result, the cell loss probability of ON/OFF sources for the queue size is rapidly decreased when the multiplexed number and burstiness are increased. Since cells of the CBR source have lower priority than cells of the ON/OFF source, cell loss probabilities of CBR sources are accordingly high independently of CBR cell arrival rate when the number of CBR sources is large.

  • PDF

An Adaptive Rate Allocation to Source-Channel Coding for Internet Video

  • Kwon, Jae-Cheol;Kim, Jae-Kyoon
    • Proceedings of the IEEK Conference
    • /
    • 2003.07e
    • /
    • pp.1915-1919
    • /
    • 2003
  • A practical method of adaptive rate allocation to source and channel codings for an independent loss channel is proposed for Internet video. It is based on the observations that the values of residual loss probabilities at the optimal code rates for different packet loss probabilities are closely clustered to the average residual loss probability for a transmission frame size n in RS(n,k) code and for a total bit rate R. These observations aye then exploited to find the code rate for maximum PSNR. Simulation results demonstrate that the proposed method achieves a near-optimal bit-rate allocation in the joint source-channel coding of H.263 and RS(n,k) codings.

  • PDF

Analysis of a Wireless Transmitter Model Considering Retransmission for Real Time Traffic (재전송을 고려한 무선 전송 단에서 실시간 데이터 전송 모델의 분석)

  • Kim, Tae-Yong;Kim, Young-Yong
    • Proceedings of the KIEE Conference
    • /
    • 2005.05a
    • /
    • pp.215-217
    • /
    • 2005
  • There are two types of packet loss probabilities used in both the network layer and the physical layer within the wireless transmitter such as a queueing discard probability and transmission loss probability. We analyze these loss performances in order to guarantee Quality of Service (QoS) which is the basic of the future network. The queuing loss probability is caused by a maximum allowable delay time and the transmission loss probability is caused by a wireless channel error. These two types of packet loss probabilities are not easily analyzed due to recursive feedback which, originates as a result at a queueing delay and a number of retransmission attempts. We consider a wireless transmitter to a M/D/1 queueing model. We configurate the model to have a finite-size FIFO buffer in order to analyze the real-time traffic streams. Then we present the approaches used for evaluating the loss probabilities of this M/D/1/K queueing model. To analyze the two types of probabilities which have mutual feedbacks with each other, we drive the solutions recursively. The validity and accuracy of the analysis are confirmed by the computer simulation. From the following solutions, we suggest a minimum of 'a Maximum Allowable Delay Time' for real-time traffic in order to initially guarantee the QoS. Finally, we analyze the required service rate for each type utilizing real-time traffic and we apply our valuable analysis to a N-user's wireless network in order to get the fundamental information (types of supportable real-type traffics, types of supportable QoS, supportable maximum number of users) for network design.

  • PDF

An Analysis of Cell Loss Process in an ATM Network Under Partial Buffer Sharing Policy (ATM 전송망에서의 PBS를 이용한 셀 우선 순위 제어 방식의 연구)

  • 곽민곤;성수란;김종권
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.19 no.12
    • /
    • pp.2328-2339
    • /
    • 1994
  • The PBS(Partial Buffer Sharing) space priority mechanism is one of priority control methods which may improve the performance of a single server queueing system when mixed traffic with different performance requirements is applied to the system. This paper analyzes the cell loss behavior of PBS assuming loss sensitive traffic and delay sensitive traffic are applied to the system. To derive the successive cell loss probabilities. which are an important performance measure of realtime traffic, we develop a recursive algorithm. Performance results show the successive cell loss probabilities obtained by our method are lager than the probabilities derived from an independent cell loss assumption. These results may indicate the limitation of PBS for realtime traffic and the increase of the admissible load with the criterion of quality of service.

  • PDF

Performance Improvement of PFMIPv6 Using Signal Strength Prediction in Mobile Internet Environment (모바일 인터넷 환경에서 신호세기 예측을 이용한 PFMIPv6의 성능 개선)

  • Lee, Jun-Hui;Kim, Hyun-Woo;Choi, Yong-Hoon;Park, Su-Won;Rhee, Seung-Hyong
    • Journal of KIISE:Information Networking
    • /
    • v.37 no.4
    • /
    • pp.284-293
    • /
    • 2010
  • For the successful deployment of Mobile Internet, fast handover technologies are essential. For the past few years several handover mechanisms are suggested, and Fast Handover for Proxy Mobile IPv6 (PFMIPv6) is one of the promising schemes for this purpose. In this paper, we propose a novel L2/L3 cross layer handover scheme based on ARIMA prediction model to apply PFMIPv6 to Mobile Internet environment effectively. Performance gains are evaluated in terms of probabilities of predictive-mode operation, handover latencies, packet loss probabilities, and signaling costs. Three mobilities models are used for our simulation: Manhattan Model, Open Area Model, and Freeway Model. Simulation results show that the proposed scheme can increase probabilities of predictive-mode operation and reduce handover latency, packet loss probabilities, and signaling cost.

Markov Modeling of Multiclass Loss Systems (멀티클래스 손실시스템의 마코프 모델링)

  • Na, Seong-Ryong
    • The Korean Journal of Applied Statistics
    • /
    • v.23 no.4
    • /
    • pp.747-757
    • /
    • 2010
  • This paper studies the Markov modeling of multiclass loss systems supporting several kinds of customers. The concept of unit for loss systems is introduced and the method of equal probability allocation among units is especially considered. Equilibrium equations and limiting distribution of the loss systems are studied and loss probabilities are computed. We analyze an example of a simple system to gain an insight about general systems.

Performance analysis of a loss priority control scheme in an input and output queueing ATM switch (입출력 단에 버퍼를 가지는 ATM 교환기의 손실우선순위 제어의 성능 분석)

  • 이재용
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.6
    • /
    • pp.1148-1159
    • /
    • 1997
  • In the broadband integrated service digital networks (B-ISDN), ATM switches hould be abld to accommodate diverse types of applications ith different traffic characteristics and quality ddo services (QOS). Thus, in order to increase the utilization of switches and satisfy the QOS's of each traffic type, some types of priority control schemes are needed in ATM switches. In this paper, a nonblocking input and output queueing ATm switch with capacity C is considered in which two classes of traffics with different loss probability constraints are admitted. 'Partial push-out' algorithm is suggested as a loss priority control schemes, and the performance of this algorithm is analyzed when this is adopted in input buffers of the switch. The quque length distribution of input buffers and loss probabilities of each traffic are obtained using a matrix-geometric solution method. Numerical analysis and simulation indicate that the utilization of the switch with partial push-out algorithm satisfying the QOS's of each traffic is much higher than that of the switch without control. Also, the required buffer size is reduced while satisfying the same QOS's.

  • PDF

A Queueing Model with Loss and Time Priority for Optimal Buffer Control in ATM (손실 우선과 시간 우선이 공존하는 ATM에서의 최적 버퍼 제어를 위한 대기 행렬 모형)

  • Lee, H.W.;Kim, E.Y.
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.25 no.1
    • /
    • pp.130-140
    • /
    • 1999
  • This paper deals with a priority queueing model in an ATM system. Two types of customers are considered. Type-1 customers have push-put priority over type-2 customers. Type-1 customers can enter the service only when the number of type-2 customers is less than a threshold T. We derive the joint probability of the number of customers in the buffer, the mean waiting time, and the loss probabilities of each type. We also propose an optimal control policy that satisfies a given quality of service.

  • PDF

Multiclass loss systems with several server allocation methods (여러 서버배정방식의 멀티클래스 손실시스템 연구)

  • Na, Seongryong
    • The Korean Journal of Applied Statistics
    • /
    • v.29 no.4
    • /
    • pp.679-688
    • /
    • 2016
  • In this paper, we study multiclass loss systems with different server allocation methods. The Markovian states of the systems are defined and their effective representation is investigated. The limiting probabilities are derived based on the Markovian property to determine the performance measures of the systems. The effects of the assignment methods are compared using numerical solutions.