• 제목/요약/키워드: Multi-Threshold

검색결과 457건 처리시간 0.022초

GMPLS 기반의 동적 경로 설정을 위한 제어 및 관리 프로토콜 성능 평가 (Performance Evaluation of control and management protocol for Dynamic lightpath setup based GMPLS network)

  • 김경목;오영환
    • 대한전자공학회논문지TC
    • /
    • 제41권12호
    • /
    • pp.9-14
    • /
    • 2004
  • 최근 인터넷 트래픽의 종류 및 크기의 다양화로 인해 광 네트워크의 동적인 경로 설정을 위한 GMPLS(Generalized Multi-Protocol Label Switching) 기반의 트래픽 제어 및 관리 프로토콜이 지속적으로 제안되고 있다. 이에 본 논문에서는 광역정보를 이용한 프로토콜과 지역정보를 이용한 프로토콜을 기반으로 한 네트워크 성능평가를 통해 두 가지 프로토콜의 특성을 비교 분석하였다. 네트워크 성능평가를 위해 변화 정보에 대한 업데이트 주기 및 임계값을 평가 메트릭으로 사용하여 트래픽 발생 율에 따른 연결 설정 시간, 제어신호 요구 대역폭, 경로 설정 블록킹 확률을 산출하였다. 평가된 프로토콜은 미래의 IP네트워크를 위한 광대역 네트워크의 필요조건이며 이는 고속의 백본 네트워크를 만족시키는 솔루션이 될 것으로 사료된다.

부여파기를 이용한 ETBF의 다진 영역 표현에 대한 연구 (Multi-level Representations of ETBF Using Subfilters)

  • 송종관;정병장;이용훈
    • 전자공학회논문지B
    • /
    • 제33B권1호
    • /
    • pp.128-132
    • /
    • 1996
  • [1]에서 extended threshold Boolean filter(ETBF)의 부분 군인 self-dual ETBF가 중앙값 부여파기 출력의 가중 평균으로 표현되어짐을 보였다. 이 논문에서는 이 결과를 일반적인 ETBF로 확장한다. 특히, 모든 ETBF를 최솟값(또는 최댓값) 부여파기 출력의 가중 평균으로 표현할 수 있음을 보였다. 이 표현은 자연스럽게 윈도우(window)의 크기가 K보다 작거나 같은 부여파기만을 사용하는 K차 ETBF(K-ETBF)라 불리는 ETBF의 부분 군(subclass)을 제시한다. 여러 가지 K 값에 대하여 평균 제곱 오차(mean square error)를 최소화하는 K-ETBF를 설계한 후 이들을 오염된 신호의 복구에 적용함으로써 여파기의 성능과 복잡도간의 호환작용(tradeoff)을 고찰하였다.

  • PDF

간섭 다중 접속 채널에서의 기회적 간섭 관리 기술 (Opportunistic Interference Management for Interfering Multiple-Access Channels)

  • 신원용;박도형
    • 한국통신학회논문지
    • /
    • 제37B권10호
    • /
    • pp.929-937
    • /
    • 2012
  • 본 논문에서는 시불변 채널 계수를 가지는 다중 셀 상향링크 네트워크에서 세 가지 종류의 기회적 간섭 관리 기술을 소개한다. 첫째, 각 기지국에서 다른 기지국에게 최소한의 간섭을 발생시키는 사용자 집합을 기회적으로 선택하는 두 가지 기회적 간섭 관리 완화 기술을 제안하고, 자유도 측면에서 성능을 분석한다. 둘째, 각 기지국에서 두 개의 임계값을 기반으로 설계된 스케줄러로 사용자를 기회적으로 선택하는 분산 기회적 스케줄링을 제안하고, 용량 스케일링 측면에서 성능을 분석한다. 마지막으로, 모의실험을 통해 제안하는 기술을 검증한다.

네트워크 가상환경에서 경로예측에 의한 동적 데이터 공유 (Path Prediction-based Dynamic Data Sharing in Network Virtual Environment)

  • 송선희;나상동
    • 한국통신학회논문지
    • /
    • 제31권10C호
    • /
    • pp.956-963
    • /
    • 2006
  • 네트워크 가상 환경에서 다중 참여자 일관성 유지와 3D 장면의 동적데이터 공유를 연구한다. 클라이언트-서버구조의 분산 가상환경에서 일관성은 상태정보 교환으로 유지되며, 교환되는 동적데이터의 갱신메시지가 자주 브로드캐스트 되면 패킷 지연에 의한 jerk를 일으키므로 데드레커닝 알고리즘을 이용한 이동경로를 예측하여 네트워크 병목을 줄인다. 동적데이터 경로예측은 데드레커닝 수렴간격의 타당성을 실험하여 공유객체 위치를 근거로 예측값과 실제 상태 값과의 오차가 한계값 이상일 때 이전 위치를 보간하고, VRML EAI를 이용하여 3D 가상공간의 동적 데이터 공유를 구현한다.

국내 성과바탕의학교육에 대한 비판적 논의: 역량의 개념을 중심으로 (The Role of the Concept of Competence in Korean Outcome-based Medical Education)

  • 이요바
    • 의학교육논단
    • /
    • 제15권3호
    • /
    • pp.144-150
    • /
    • 2013
  • Before Outcome-based curriculum reform, medical graduate school and medical schools of korea need to understand limit or threshold of outcome-based education's point of view. This article examines the multi-dimensional concept of competence suggested by Stoof and colleagues and discusses about implication for outcomebased education in medical education of Korea. Because Stoof and colleagues's five dimensions of competence reveal various concepts and educational methods of competence. Therefore, It is possible to use to identify the strengths and weaknesses of outcome-based education of Korea as a reference standard. Five dimensions of competence suggested by Stoof and colleagues is consist of 'personal vs. task characteristics,' 'individual vs. distributed competence,' 'specific vs. general competence,' 'levels of competence vs. competence as a level,' and 'teachable vs. non-teachable.' Implication for outcome-based education in medical education of Korea is, first, that It should recognize to outcome-based education as a one of educational models approaching to competence. Second, discussion about competence should be expanded from pre-medical education to graduated medical education and continuing medical education.

OQMCAR: An enhanced network coding-aware routing algorithm based on queue state and local topology

  • Lu, Cunbo;Xiao, Song;Miao, Yinbin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제9권8호
    • /
    • pp.2875-2893
    • /
    • 2015
  • Existing coding aware routing algorithms focused on novel routing metric design that captures the characteristics of network coding. However, in packet coding algorithm, they use opportunistic coding scheme which didn't consider the queue state of the coding node and are equivalent to the conventional store-and-forward method in light traffic load condition because they never delay packets and there are no packets in the output queue of coding node, which results in no coding opportunity. In addition, most of the existing algorithms assume that all flows participating in the network have equal rate. This is unrealistic since multi-rate environments are often appeared. To overcome above problem and expand network coding to light traffic load scenarios, we present an enhanced coding-aware routing algorithm based on queue state and local topology (OQMCAR), which consider the queue state of coding node in packet coding algorithm where the control policy is of threshold-type. OQMCAR is a unified framework to merge single rate case and multiple rate case, including the light traffic load scenarios. Simulations results show that our scheme can achieve higher throughput and lower end-to-end delay than the current mechanisms using COPE-type opportunistic coding policy in different cases.

안전띠 착용 유무에 근거한 두 단계의 충돌 가혹도 수준을 갖는 충돌 판별 알고리즘 (Crash Discrimination Algorithm with Two Crash Severity Levels Based on Seat-belt Status)

  • 박서욱;이재협
    • 한국자동차공학회논문집
    • /
    • 제11권2호
    • /
    • pp.148-156
    • /
    • 2003
  • Many car manufacturers have frequently adopted an aggressive inflator and a lower threshold speed for airbag deployment in order to meet an injury requirement for unbolted occupant at high speed crash test. Consequently, today's occupant safety restraint system has a weakness due to an airbag induced injury at low speed crash event. This paper proposes a new crash algorithm to improve the weakness by suppressing airbag deployment at low speed crash event in case of belted condition. The proposed algorithm consists of two major blocks-crash severity algorithm and deployment logic block. The first block decides crash severity with two levels by means of velocity and crash energy calculation from acceleration signal. The second block implemented by simple AND/OR logic combines the crash severity level and seat belt status information to generate firing commands for airbag and belt pretensioner. Furthermore, it can be extended to adopt additional sensor information from passenger presence detection sensor and safing sensor. A simulation using real crash data for a 1,800cc passenger vehicle has been conducted to verify the performance of proposed algorithm.

A Dynamic Channel Switching Policy Through P-learning for Wireless Mesh Networks

  • Hossain, Md. Kamal;Tan, Chee Keong;Lee, Ching Kwang;Yeoh, Chun Yeow
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제10권2호
    • /
    • pp.608-627
    • /
    • 2016
  • Wireless mesh networks (WMNs) based on IEEE 802.11s have emerged as one of the prominent technologies in multi-hop communications. However, the deployment of WMNs suffers from serious interference problem which severely limits the system capacity. Using multiple radios for each mesh router over multiple channels, the interference can be reduced and improve system capacity. Nevertheless, interference cannot be completely eliminated due to the limited number of available channels. An effective approach to mitigate interference is to apply dynamic channel switching (DCS) in WMNs. Conventional DCS schemes trigger channel switching if interference is detected or exceeds a predefined threshold which might cause unnecessary channel switching and long protocol overheads. In this paper, a P-learning based dynamic switching algorithm known as learning automaton (LA)-based DCS algorithm is proposed. Initially, an optimal channel for communicating node pairs is determined through the learning process. Then, a novel switching metric is introduced in our LA-based DCS algorithm to avoid unnecessary initialization of channel switching. Hence, the proposed LA-based DCS algorithm enables each pair of communicating mesh nodes to communicate over the least loaded channels and consequently improve network performance.

Optimal Power Allocation for Wireless Uplink Transmissions Using Successive Interference Cancellation

  • Wu, Liaoyuan;Wang, Yamei;Han, Jianghong;Chen, Wenqiang;Wang, Lusheng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제10권5호
    • /
    • pp.2081-2101
    • /
    • 2016
  • Successive interference cancellation (SIC) is considered to be a promising technique to mitigate multi-user interference and achieve concurrent uplink transmissions, but the optimal power allocation (PA) issue for SIC users is not well addressed. In this article, we focus on the optimization of the PA ratio of users on an SIC channel and analytically obtain the optimal PA ratio with regard to the signal-to-interference-plus-noise ratio (SINR) threshold for successful demodulation and the sustainable demodulation error rate. Then, we design an efficient resource allocation (RA) scheme using the obtained optimal PA ratio. Finally, we compare the proposal with the near-optimum RA obtained by a simulated annealing search and the RA scheme with random PA. Simulation results show that our proposal achieves a performance close to the near-optimum and much higher performance than the random scheme in terms of total utility and Jain's fairness index. To demonstrate the applicability of our proposal, we also simulate the proposal in various network paradigms, including wireless local area network, body area network, and vehicular ad hoc network.

Galaxy overdensities at intermediate to high redshift

  • 강유진;임명신
    • 천문학회보
    • /
    • 제36권2호
    • /
    • pp.52.2-52.2
    • /
    • 2011
  • We searched and studied galaxy overdensities at 0.6 < z < 4.5 in the areas of two GOODS fields. These overdensities are identified by running top-hat filters on the two dimensional spatial distribution of two galaxy samples - a K-band limited, photometric redshift sample at 0.6 < z < 4.5, and BVz-color selected sample targeting overdensities at z ~ 3.7 and z ~ 4.0. Here photometric redshifts are derived from multi-wavelength data ranging from U-band through 8 micron band of the Spitzer. We find 52 overdensities with significances of 3.5-7 ${\sigma}$. The derived masses found to be a > $10^{13}\;M_{\odot}$ with the comoving number density of a few ${\times}10^{-6}\;Mpc^{-3}$ at z ~ 3. In order to understand the high number density of massive overdensities at high redshift, we carried out an analysis of galaxy overdensities using the mock galaxy catalog based on Millennium simulation selected in the same way as the analysis of the observational data. In the simulation, we find 650 galaxy overdensities with a 3.5 ${\sigma}$ detection threshold over $2^{{\circ}2}$ sky field. The number density of the very massive overdensities (M > $10^{14}\;M_{\odot}$) in simulation shows a similar trend with the observation. We further discuss implications of our results.

  • PDF