• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1995년도 추계학술대회 논문집 학회본부
• /
• pp.566-568
• /
• 1995

An optimal routing method using hysteresis binary neurons with link failure probability is proposed in this paper. The link failures in computer networks can degrade the performance of the entire networks. We assume the time between successive link failures is exponentially distributed with parameter ${\lambda}$ and the failures are independent. The link failure probability is used for neural networks to find the shortest paths of given source-destination pairs. By using the probability of link failures and hysteresis binary neurons we implement an optimal routing method that can takes routes by coping with link failures.

• 한국콘텐츠학회:학술대회논문집
• /
• 한국콘텐츠학회 2004년도 추계 종합학술대회 논문집
• /
• pp.384-388
• /
• 2004

본 논문은 항공통신 전술링크 LINK16에서 무선 키 갱신을 위해 사용되는 동기신호가 주어진 통신환경에서 심볼오류율에 대해 전송속도를 기준으로 동기검출 확률, 오검출확률 측면에서 전송성능을 분석하였다.

• 한국지능시스템학회논문지
• /
• 제23권3호
• /
• pp.191-195
• /
• 2013

본 논문에서는 방대한 웹 자원의 연결성을 더욱 증가시키기 위해 영어 위키피디아 문서로부터 한국어 위키피디아 문서로의 교차언어 링크를 자동으로 탐색하는 방법을 제안한다. 어구의 링크확률을 대략 추정하여 사용하던 기존의 방법에 비해, 본 연구에서는 위키피디아 문서 집합으로부터 추출한 제목 목록과 링크 확률과 같은 다양한 정보들과 개체명 인식 결과를 함께 사용하여 링크가 걸릴 앵커 후보를 선택한다. 앵커 후보를 한국어 대역어로 번역한 후, 대역어에 가장 적합한 한국어 웹문서를 찾아 교차언어 링크로 설정하게 된다. 실험한 결과 MAP 수치로 0.375를 얻었다.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2004년도 ICCAS
• /
• pp.1346-1349
• /
• 2004

In this paper, we have proposed the new link-weight calculating function using for routing decision in WDM networks. The proposed link-weight calculating functions includes following factors those are available wavelengths per link, distance loss, total wavelengths, and limited wavelength conversion. The calculated link-weight is applied into the algorithm of routing decision in order to determine the available lightpath that qualifies user requests. The objective is to improve the performance of wavelengths assignment with fast determining the suitable lightpath by using the proposed link-weights calculating function. The analytical model of WDM switching networks is introduced for numerical analysis. The link-weight calculating function is performed. Finally, the performance of proposed algorithm is displayed with numerical results in term of the blocking probability, the probability that connection requests from users are rejected due to there are no available lightpath to be assigned for them. It is also shown that the blocking probability is varied in depending on the number of available wavelengths and the degree of wavelength conversion. The numerical results also show that the proposed link-weight calculating function is more cost-effective choice for the routing decision in WDM switching networks.

• 한국통신학회논문지
• /
• 제21권6호
• /
• pp.1501-1509
• /
• 1996

Mobile stations can be classified by the transmission power level in CDMA system. Different performance parameters will be given to each class of mobile stations so that the appropriate quality ofservices can be provided. In this paper, it is assumed that there are two clsses of mobile stations. with the classification of mobile stations, analytical models are presented for the estimates of the reverse link capacity and the blocking probability. From the model for the reverse link capacity, the maximum number of each class of mobile stations to be served is derived. It is shown that $E_{b/}$I reduction of 1 dB allows the capacity to be increased by 25% and the data transmission rate and the power control accuracy have a significant effect on the reverse link capacity and the blocking probability. Simulation results are provided for validating the anlaytical estimates of the blocking probability.ocking probability.y.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2005년도 ICCAS
• /
• pp.1846-1850
• /
• 2005

This paper presents a constrained-based routing (CBR) algorithm called, Dynamic Possible Path per Link (D-PPL) routing algorithm, for MultiProtocol Label Switching (MPLS) networks. In MPLS on-line routing, future traffics are unknown and network resource is limited. Therefore many routing algorithms such as Minimum Hop Algorithm (MHA), Widest Shortest Path (WSP), Dynamic Link Weight (DLW), Minimum Interference Routing Algorithm (MIRA), Profiled-Based Routing (PBR), Possible Path per Link (PPL) and Residual bandwidth integrated - Possible Path per Link (R-PPL) are proposed in order to improve network throughput and reduce rejection probability. MIRA is the first algorithm that introduces interference level avoidance between source-destination node pairs by integrating topology information or address of source-destination node pairs into the routing calculation. From its results, MIRA improves lower rejection probability performance. Nevertheless, MIRA suffer from its high routing complexity which could be considered as NP-Complete problem. In PBR, complexity of on-line routing is reduced comparing to those of MIRA, because link weights are off-line calculated by statistical profile of history traffics. However, because of dynamic of traffic nature, PBR maybe unsuitable for MPLS on-line routing. Also, both PPL and R-PPL routing algorithm we formerly proposed, are algorithms that achieve reduction of interference level among source-destination node pairs, rejection probability and routing complexity. Again, those previously proposed algorithms do not take into account the dynamic nature of traffic load. In fact, future traffics are unknown, but, amount of previous traffic over link can be measured. Therefore, this is the motivation of our proposed algorithm, the D-PPL. The D-PPL algorithm is improved based on the R-PPL routing algorithm by integrating traffic-per-link parameters. The parameters are periodically updated and are dynamically changed depended on current incoming traffic. The D-PPL tries to reserve residual bandwidth to service future request by avoid routing through those high traffic-per-link parameters. We have developed extensive MATLAB simulator to evaluate performance of the D-PPL. From simulation results, the D-PPL improves performance of MPLS on-line routing in terms of rejection probability and total throughput.

• 한국멀티미디어학회논문지
• /
• 제14권6호
• /
• pp.752-758
• /
• 2011

본 논문의 연구내용은 차량간 통신에 응용이 가능한 조명용 LED 광통신 링크의 링크전송성공율 분석에 관한 연구로서, 가시광통신에 기반한 차량간 메시지 전달 시스템을 모델링 하고, 광수신 파워를 통해 신호대 잡음비 (signal-to-noise ratio)를 계산하고, 이에 따른 링크 전송성공확률을 계산함으로써, 가시광통신에 기반한 차량간 무선통신이 가능함을 검증하는 것이다. 저속이동 또는 정지 중인 차량의 후미등을 광송신기로 사용하고 후방차량의 전방에 장착된 광수신기를 이용하는 메시지 전달시스템에 있어, 각 차량의 위치가 정규확률분포를 따를 때, 광송신기 및 광수신기의 물리적 특성에 따른 링크전송성공확률을 계산한다. 먼저, 정규확률분포에 따라 차량의 위치를 랜덤하게 생성한 후, 각각의 광링크에 해당하는 BER을 계산하였다. 이를 통해, 전체 링크 중 $BER{\leq}10^{-6}$을 만족하는 링크의 비율을 링크전송성공율로 정의한 결과, 송신 광파워가 400mW이고 광송신기의 semi-angle at half power가 30도인 최적화되지 않은 차량간 광링크의 경우, 링크 전송성공율 90% 이상이 가능함을 확인하였다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 ITC-CSCC -1
• /
• pp.125-128
• /
• 2000

In this paper, we derive forward link Erlang capacity reflecting both outage probability and blocking probability of each traffic type in mixed traffics environment. We firstly determine the number of available virtual trunks of the forward link from a circuit switching perspective. Then, capacity sharing model and generalized Erlang model are employed to derive joint Erlang capacity of various traffics types.

• ETRI Journal
• /
• 제20권1호
• /
• pp.16-27
• /
• 1998

In this paper, we consider the acquisition performance of an IS-95 reverse link access channel slot as a function of system design parameters such as postdetection integration length and the number of access channel message block repetitons. The uncertainty region of the reverse link spreading codes compared to that of forward link is very small, since the uncertainty region of the reverse link is determined by a cell radius. Thus, the parallel acquisiton technique in the reverse link is more efficient than a serial acquisition technique in terms of implementation and of acquisition time. The parallel acquisition is achieved by a bank of N parallel I/Q noncoherent correlator are analyzed for band-limited noise and the Rayleigh fast fading channel. The detection probability is derived for multiple correct code-phase offsets and multipath fading. The probability of no message error is derived when rake combining, access channel message block combining, and Viterbi decoding are applied. Numerical results provide the acquisition performance for system design parameters such as postdetection integration length and number of access channel message block repetitions in case of a random access on a mobile station.

• 한국컴퓨터정보학회논문지
• /
• 제1권1호
• /
• pp.25-36
• /
• 1996

본 논문은 격자 구조 회선 교환 망에서 발생할 수 있는 호 차단 확률 및 failure model을 설정하여 신뢰도를 분석하였다 특히 failure model에서는 link failure 모델을 고려하였다. 대상 모델은.flooding search routing 방식을 사용하여 패킷을 통화 대상자 노드에 전송하였다. 이때. 각 링크failure는 독립적이라고 가정하였다. 이와 같은 failure모델의 성능을 평가하기 위한 방법으로서 joint probability를 이용하여 소규모 격자 구조 회선 교환망의 신뢰도를 분석해 보았으며. 이를 시뮬레이션 한 값과 비교해 보았다 또한. 통신망에서 주요한 성능 지표중 하나8! 호 차단 확률을 구하여 회선망의 신뢰도를 평가하였다.