• Title/Summary/Keyword: 최소 지연

Search Result 500, Processing Time 0.032 seconds

Autonomic Period Determination for Variable Rate Limiter of Virus Throttling (바이러스 감속기의 가변 비율 제한기를 위한 자율적 주기 결정)

  • Shim, Jae-Hong;Sohn, Jang-Wan
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.1C
    • /
    • pp.67-77
    • /
    • 2007
  • Virus throttling technique, one of many early worm detection techniques, detects Internet worm propagation by limiting connect requests within a certain ratio. The typical virus throttling controls the period of rate limiter autonomically by utilizing weighted average delay queue length to reduce connection delay time without hanving a large effect on worm detection time. In the existing virus throttling research, a minimum period of variable rate limiter is fired and a turning point which is a point that the period of rate limiter has been being decreased and starts to be increased is also fixed. However, these two performance factors have different effects on worm detection time and connection delay. In this paper, we analyze the effect of minimum period and turning point of variable rate limiter, and then propose an algorithm which determines values of performance factors by referencing current traffic pattern. Through deep experiments, it is verified that the proposed technique is more efficient in respect of reducing worm detection time and connection delay than the existing virus throttling which fixed the performance factors.

Measurement and Prediction of Autoignition Temperature of n-Hexanol+p-Xylene Mixture (노말헥산올과 파라자일렌 혼합물의 최소자연발화온도 측정 및 예측)

  • Ha, Dong-Myeong
    • Journal of Energy Engineering
    • /
    • v.25 no.1
    • /
    • pp.48-55
    • /
    • 2016
  • The autoignition temperature (AIT) of a material is the lowest temperature at which the material will spontaneously ignite. The AIT is important index for the safe handling of flammable liquids which constitute the solvent mixtures. This study measured the AITs of n-hexanol+p-xylene system by using ASTM E659 apparatus. The AITs of n-hexanol and p-xylene system which constituted binary system were $275^{\circ}C$ and $557^{\circ}C$, respectively. The experimental AITs of n-hexanol+p-xylene system system were a good agreement with the calculated AITs by the proposed equations with a few A.A.D.(average absolute deviation).

2마이크론의 설계치수를 갖는 ISL설계 및 제작

  • Lee, Yong-Jae;Lee, Jin-Hyo
    • ETRI Journal
    • /
    • v.8 no.3
    • /
    • pp.15-23
    • /
    • 1986
  • ISL(Integrated Schottky Logic)의 고집적화를 위하여 종래의 p-n 접합 격리 방법 대신에 산화막으로 격리시킨 2마이크론의 최소 설계치수를 갖는 소자를 설계, 제작하여 특성을 분석하였다. 접합 형성을 위한 불순물은 이온 주입법을 이용하여 고속소자가 필연적으로 갖추어야 하는 얕은 접합으로 형성을 시켰으며, 출력단의 쇼트키 다이오드는 백금 실리 사이드를 이용하였다. 링 발진기의 특성에서 최소 전달지연 시간은 한 게이트당 5.7ns의 속도 특성과 논리 진폭은 360mV의 현격한 특성을 나타내었다 .

  • PDF

A partitioning algorithm that apply pipeline architecture in codesign (통합설계에서 파이프라인을 지원하는 분할 알고리즘에 관한 연구)

  • Oh, Ju-Young;Park, Do-Soon
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2002.11a
    • /
    • pp.527-530
    • /
    • 2002
  • 본 논문에서는 하드웨어/소프트웨어 시스템의 파이프라인 실행을 지원하는 알고리즘을 제안한다. 파이프라인 실행을 지원하기 위해 시간제약과 면적제약조건을 만족하는 분한 결과를 찾는 기존의 방법은 하드웨어/소프트웨어 분할과 파이프라인 스케줄링을 독립적으로 실행하였으며 최소시간의 파이프라인 입력간격으로부터 최적의 분할 결과를 얻기 위해 점진적인 방법을 사용하기 때문에 많은 알고리즘 실행시간을 가진다. 본 논문에서는 분할 단계에서 스케줄링을 함께 고려하면서 최소 입력 간격을 갖는 파이프라인 실행을 지원하는 낮은 복잡도의 알고리즘을 제안한다. 이를 위해 최소입격간격에서의 파티션에 분포하는 노드와 종속성을 찾아서 하드웨어 구현과 프로세서에서의 분포 그래프를 생성하고, 상대적 스케줄 긴박도[8]를 구할 때는 노드 별 실행시간과 구현비용을 고려하며 분할 이후에 발생하는 통신 지연 시간을 힘 에 반영한다. 논문은 최소 입력 간격내에서 구성되는 파티션에 존재하는 노드의 파이프라인 스케줄과 시스템 제약시간을 만족하면서 구현비용을 저하시키기 위한 낮은 실행시간을 갖는 분한 알고리즘을 제안한다.

  • PDF

VLSI Design of HAS-160 Algorithm (HAS-160 해쉬 프로세서의 VLSI 설계)

  • 현주대;최병윤
    • Proceedings of the Korea Multimedia Society Conference
    • /
    • 2002.05c
    • /
    • pp.44-48
    • /
    • 2002
  • 본 논문에서는 한국형 디지털 서명 표준인 KCDSA에서 사용할 목적으로 개발된 국내 해쉬 함수 표준인 HAS-160 알고리즘을 VLSI 설계하였다. 하나의 단계연산을 하나의 클럭에 동작하고 단계연산의 핵심이 되는 4개의 직렬 2/sup 3/ 모듈러 가산기를 CSA(Carry Save Adder)로 구현하여 캐리 전파시간을 최소로 하고 HAS-160 해쉬 알고리즘의 특징인 메시지 추가생성을 사전에 계산하여 지연시간을 줄이는 설계를 하였다. 설계된 해쉬 프로세서를 0.25 urn CMOS 스탠다드 셀 라이브러리에서 합성한 결과 총 게이트 수는 약 21,000개이고 최대 지연 시간은 5.71 ns로 최대 동작주파수 약 175 MHz서 약 1,093 Mbps의 성능을 얻을 수 있었다.

  • PDF

Stochastic Timed Net and Its Minimum Cycle Time Analysis (확률적 시간 넷과 최소 순회 시간 분석)

  • Yim Jae-Geol;Shim Kyu-Bark
    • Journal of Korea Multimedia Society
    • /
    • v.9 no.5
    • /
    • pp.671-680
    • /
    • 2006
  • As a mathematical technique with which we can find the minimum duration time needed to fire all the transitions at least once and coming back to the initial marking in a timed net, the minimum cycle time method has been widely used in computer system analysis. A timed net is a modified version of a Petri net where a transition is associated with a delay time. A delay time used in a timed net is a constant even though the duration time associated with an event in the world is a stochastic number in general. In the consequence, the result of minimum cycle time analysis is not realistic. Therefore, we propose ‘Stochastic Timed Net' where a transition can be associated with a stochastic number and introduce a minimum cycle time analysis method for ‘Stochastic Timed Net’ As an example of the application of ‘Stochastic Timed Net’, we introduce a ‘Stochastic Timed Net' model of a Location Based Service Providing Multimedia System and the result of minimum cycle time analysis of it. Whereas the typical form of the result of the existing minimum cycle time analysis is 'It takes at least 10 time units', the typical form of the result of minimum cycle time analysis of a ‘Stochastic Timed Net' is in the probability form such as "The probability of the events in which it finishes its job within 10 time units is 85%."

  • PDF

Performance Analysis of Registration Delay Time by Varying Number of foreign Agent in Regional Registration (지역 등록 방법에서 외부 에이전트 수의 변화에 따른 등록 지연시간의 성능분석)

  • 이용덕;곽경섭
    • Journal of Korea Multimedia Society
    • /
    • v.7 no.1
    • /
    • pp.106-112
    • /
    • 2004
  • Mobile IP is a solution for mobility on the global Internet. However, it causes service delay incase of frequent movement of mobile node and mobile users. Mobile IP regional registration is Proposed to reduce the service delay. In this paper, we introduce an optimal regional location management mechanism for Mobile IP that reduces the registration delay. The movement of mobile node is described by a discrete analytical model. The proposed model explains analytically average packet rate and registration cost as the size of regional networks with mobility of mobile node.

  • PDF

Measurement of Autoignition Temperature of Propionic Acid and 3-Hexanone System (Propionic acid와 3-Hexanone 계의 최소자연발화온도의 측정)

  • Ha, Dong-Myeong
    • Fire Science and Engineering
    • /
    • v.28 no.4
    • /
    • pp.44-49
    • /
    • 2014
  • The autoignition temperaturs (AIT) of solvent mixture is important index for the safe handling of flammable liquids which constitute the solvent mixtures. This study measured the AIT and ignition delay time for Propionic acid and 3-Hexanone system by using ASTM E659 apparatus. The AITs of Propionic acid and 3-Hexanone which constituted binary system were $511^{\circ}C$ and $425^{\circ}C$, respectively. The experimental AIT of Propionic acid and 3-Hexanone system were a good agreement with the calculated AIT by the proposed equations with a few average absolute deviation (A.A.D.). And Propionic acid and 3-Hexanone system was shown the minimum autoignition temperature behavior (MAITB).

Dynamic Random Channel Allocation Algorithm by Limiting the Number of Minimum RCH in HIPERLAN/2 (HIPERLAN/2에서 최소 RCH 수를 제한한 동적 랜덤채널 할당 기법)

  • Kang, Jae-Eun;Lee, Jong-Kyu
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.1A
    • /
    • pp.58-64
    • /
    • 2009
  • In this paper, we propose an dynamic random channel allocation scheme increasing probability of channel acquisition and reducing delay by limiting the number of minimum RCHs(Random CHannels) as an optimal factor $\beta$. The MAC protocol of HIPERLAN/2 is based on TDMA/TDD and MT(Mobile Terminal) can obtain chance of traffic transmission through channel competition in RCH period. And AP(Access Point) can dynamically schedule the number of RCHs based on the number of the collision in each RCH of the previous frame. Therefore, the proposed scheme increases a probability of channel acquisition and reduces delay by means of guaranteeing the number of minimum RCHs. With a practical Internet traffic, it is concluded that by the proposed scheme the delay reduction of the order of 19% and slightly better throughput are obtained compared to the conventional algorithm.

RLSLTDE Algorithm for Bearing Estimation of the Underwater Acoustic Signal (수중음향신호 입사방위 추정을 위한 RLSLTDE 알고리즘)

  • Choi, Jae-Yong;Son, Kweon;Dho, Kyeong-Cheol
    • The Journal of the Acoustical Society of Korea
    • /
    • v.19 no.5
    • /
    • pp.84-90
    • /
    • 2000
  • The bearing detection of radiated target noise is very important at underwater acoustic measurement and passive detection. It differs the arrival tines of received signal at each sensor. Therefore, the bearing can be obtained from the time delay. This paper proposes a new algorithm using the RLSL adaptive filter for TDE. The proposed method is particularly attractive when there is a limitation of priori information about the received signal spectra and when the delay is subject to variation. As the simulation results, it is shown that the proposed algorithm has better convergence characteristics and TDE speed, and so that the usefulness of proposed algorithm is confirmed.

  • PDF