• Title/Summary/Keyword: probability of switch

Search Result 94, Processing Time 0.024 seconds

A CICQ Switch Architecture Using Blocking Avoidance & Virtual Threshold Scheme for QoS Guaranteed Multicast Service (QoS가 보장된 멀티캐스트 서버스를 위한 Blocking Avoidance 셀 할당 기법과 Virtual Threshold 기법을 이용한 CICQ 스위치 구조)

  • Kim, Kyung-Min;Jung, Hyun-Duk;Lee, Jai-Yong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.2B
    • /
    • pp.120-130
    • /
    • 2011
  • Recently the multicast based contents transmission is rapidly increasing due to the various multimedia services and the importance of switching technology to handle it is increasing as a consequence. Though the CICQ architecture has advantages that reduction of HoL blocking probability and simple scheduling using cross point buffer, it has disadvantage that the processing rate of multicast traffic can be significantly degraded corresponds to the traffic load increment. Several schemes have been proposed to solve this problem however they still can't provide enough processing ratio for multicast traffic. Therefore this paper proposes the BA cell assignment scheme and the VT scheme, and the processing rate of multicast traffic can be guaranteed by reducing the HoL blocking probability of multicast traffic and reservation of cross point buffer. Also simulation results verify that using the proposed scheme, the QoS of multicast service can be improved.

Function Embedding and Projective Measurement of Quantum Gate by Probability Amplitude Switch (확률진폭 스위치에 의한 양자게이트의 함수 임베딩과 투사측정)

  • Park, Dong-Young
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.12 no.6
    • /
    • pp.1027-1034
    • /
    • 2017
  • In this paper, we propose a new function embedding method that can measure mathematical projections of probability amplitude, probability, average expectation and matrix elements of stationary-state unit matrix at all control operation points of quantum gates. The function embedding method in this paper is to embed orthogonal normalization condition of probability amplitude for each control operating point into a binary scalar operator by using Dirac symbol and Kronecker delta symbol. Such a function embedding method is a very effective means of controlling the arithmetic power function of a unitary gate in a unitary transformation which expresses a quantum gate function as a tensor product of a single quantum. We present the results of evolutionary operation and projective measurement when we apply the proposed function embedding method to the ternary 2-qutrit cNOT gate and compare it with the existing methods.

Delay analysis for a discretionary-priority packet-switching system

  • Hong, Sung-Jo;Takagi, Hideaki
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 1995.04a
    • /
    • pp.729-738
    • /
    • 1995
  • We consider a priority-based packet-switching system with three phases of the packet transmission time. Each packet belongs to one of several priority classes, and the packets of each class arrive at a switch in a Poison process. The switch transmits queued packets on a priority basis with three phases of preemption mechanism. Namely, the transmission time of each packet consists of a preemptive-repeat part for the header, a preemptive-resume part for the information field, and a nonpreemptive part for the trailer. By an exact analysis of the associated queueing model, we obtain the Laplace-Stieltjes transform of the distribution function for the delay, i.e., the time from arrival to transmission completion, of a packet for each class. We derive a set of equations that calculates the mean response time for each class recursively. Based on this result, we plot the numerical values of the mean response times for several parameter settings. The probability generating function and the mean for the number of packets of each class present in the system at an arbitrary time are also given.

  • PDF

The Strategies of Manufacturers and Retailers for Customer Acquisition and Retention Using Scanner Panel Data (스캐너 패널 데이터를 이용한 유통업체와 제조업체간의 고객확보 및 유지 전략에 관한 연구)

  • Lee, Seung-yon;Son, Jungmin
    • Knowledge Management Research
    • /
    • v.12 no.3
    • /
    • pp.73-96
    • /
    • 2011
  • Recent market saturation makes the local retailers consider an attempt to innovate the market with the retailer's brand. This is the retailers' efforts to expand the market control through the enhancement of private brands. As the competition among manufacturers extends to the competition between manufacturers and retailers, the marketing knowledges of manufacturers need to be diversified to the ones that can be applied to the manufacturers and retailers due to their bilateral competition. This research concentrates on the customer acquisition strategy (attack strategy) and customer retention strategy (defense strategy) in the place of both sides of manufacturers and retailers. Also this research targets to develop the differential marketing strategies for target market's National Brand(NB)/Private Brand(PB) purchase by analyzing individual customer's purchase probability on repurchase and switch-purchase of NB and PB. This study is based on the data of frequently consumed product, tomato ketchup on scanner panel from the ERIM data of University of Chicago, USA. This study compares and analyzes the NB and PB repurchases and switch-purchase of 4 types. The comparisons provide the informations that which factors should be managed for the attack strategy, the defense strategy, and the differential marketing strategies both for manufacturers and retailers. This research is expected to contribute on cumulating the industrial knowledges of retailers' and manufacturers' survival strategy, expecially focusing on the effect of marketing factors and consumer-characteristic factors.

  • PDF

Proposal of optical subscriber access network using optical CDMA method with optical switches (광 스위치를 이용한 광 CDMA 방식에 의한 광 가입자 액세스 망의 제안)

  • Park, Sang-Jo;Kim, Bong-Kyu
    • The KIPS Transactions:PartC
    • /
    • v.10C no.3
    • /
    • pp.317-324
    • /
    • 2003
  • In this paper, we propose the ATM based Passive Optical Network (PON) using the optical CDMA scheme with optical switches and PN codes in time domain. We also propose the bipolar optical receiving correlator for PN codes. As optical CDMA is performed by driving directly an optical switch on-off switching with PN codes, the number of distinct code sequences can be increased and the flexibility in assigning PN codes can be improved. Finally we theoretically analyze the signal-to-interference -plus-noise ratio and the bit error probability of regenerated signal and compare the performance of proposed scheme compared with ATM based PON using conventional optical CDMA with optical delay lines.

A Study on Connections of Resources in Data Centers (데이터센터 자원 연결 방안 연구)

  • Ki, Jang-Geun;Kwon, Kee-Young
    • Journal of Software Assessment and Valuation
    • /
    • v.15 no.2
    • /
    • pp.67-72
    • /
    • 2019
  • The recent explosion of data traffic, including cloud services, coupled with the Internet penetration has led to a surge in the need for ultra-fast optical networks that can efficiently connect the data center's reconfiguable resources. In this paper, the algorithms for controlling switching cell operation in the optical switch connection structure are proposed, and the resulting performance is compared and analyzed through simulation. Performance analysis results showed that the algorithm proposed in this paper has improved the probability of successful multi-connection setup by about 3 to 7% compared to the existing algorithm.

Performance Analysis of ATM Switch with Priority Control Mechanisms (우선순위제어기능을 가진 ATM스위치의 성능 분석)

  • 장재신;신병철;박권철
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.18 no.8
    • /
    • pp.1190-1200
    • /
    • 1993
  • In this work, the performance of both delay sensitive traffics and loss sensitive traffics of the output buffered ATM switch with priority control mechanisms has been evaluated. We choose the partial buffer sharing mechanism as the loss priority control mechanism and the HOL(Head Of Line) priority control mechanism as the time priority control mechanism. We model loss sensitive traffics with Poisson process and delay sensitive traffics with MMPP. With loss priority control, it is confirmed that loss probability of loss sensitive traffice decreases when the loss priority control mechanism is chosen. With time priority control, it has also been confirmed that mean cell delay of delay sensitive traffics decreases when the HOL priority control mechanism is used. From this analysis, It has been confirmed that the requirements of QOS for both loss sensitive and delay sensitive traffics can be satisfied in the ATM switch by combining both the loss priority control mechanism and the HOL priority control mechanism.

  • PDF

A Proposal for Matrix Shape Security Keypad for the Nintendo Switch (향상된 보안의 닌텐도 스위치 행렬 형태 보안 키패드 제안)

  • Kwon, Hyeok-dong;Kwon, Yong-bin;Choi, Seung-ju;Seo, Hwa-jeong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.23 no.9
    • /
    • pp.1152-1159
    • /
    • 2019
  • The Nintendo Switch(NSW), which appeared as an 8th generation console, has succeeded worldwide as a hybrid gaming console. The NSW has E-shop itself, users can sign in to their account and purchase games. The keypad built in the NSW is similar to QWERTY keyboard. In the password input field the input information is hidden, but it's possible to get the value entered from the keypad with shoulder surfing attack. Because of the NSW with many party or family games, there is a high probability that someone else is watching the screen nearby, which acts as a vulnerability in account security. Thus we designed the new keypad which improve from this issue. In this paper, we check the problem about the keypad which built in the NSW, we present the proposed keypad and the compared to the built in keypad by showing the test result of unspecified individuals use.

Construction Methods of Switching Network for a Small and a Large Capacity AMT Switching System (소용량 및 대용량의 ATM시스템에 적합한 스위칭 망의 구성 방안)

  • Yang, Chung-Ryeol;Kim, Jin-Tae
    • The Transactions of the Korea Information Processing Society
    • /
    • v.3 no.4
    • /
    • pp.947-960
    • /
    • 1996
  • The primary goal for developing high performance ATM switching systems is to minimized the probability of cell loss, cell delay and deterioration of throughput. ATM switching element that is the most suitable for this purpose is the shared buffer memory switch executed by common random access memory and control logic. Since it is difficult to manufacture VLIS(Very Large Scale Integrated circuit) as the number of input ports increased, the used of switching module method the realizes 32$\times$32, 150 Mb/s switch utilizing 8$\times$8, 600Mb/s os 16$\times$16, 150Mb/s unit switch is latest ATM switching technology for small and large scale. In this paper, buffer capacity satisfying total-memory-reduction effect by buffer sharing in a shared buffer memory switch are analytically evalu ated and simulated by computer with cell loss level at traffic conditions, and also features of switching network utilizing the switching module methods in small and large-capacity ATM switching system is analized. Based on this results, the structure in outline of 32$\times$32(4.9Gb/s throughput), 150Mb/s switches under research in many countries is proposed, and eventually, switching-network structure for ATM switching system of small and large and capacity satisfying with above primary goals is suggested.

  • PDF

A Study on the DRF Multipath Multistage Interconnection Network (DRF 다단상호접속망에 관한 연구)

  • Lee, Eun-Seol;Lim, Chae-Tak
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.27 no.10
    • /
    • pp.130-137
    • /
    • 1990
  • The multipath multistage interconnection network is proposed which has the capability of dynamic rerouting. Construction of the network gets simpler, and the number of stages is reduced to $LOG_{2}$(N), so hardware complexity is reduced. This proposed algorithm makes it possible that destination adresses are used as routing tags, and it is easy to set up the path. Because this proposed network has a dynamic rerouting, backtracking is not necessary to set up another path when conflicts of switch faults are occurred. To estimate a performance, analytic methods are used and it is proved that probability of acceptance is improved in this Multipath MIN.

  • PDF