• Title/Summary/Keyword: 비 지연

Search Result 3,720, Processing Time 0.032 seconds

Delay-Power Aware Routing Protocol for Multimedia Ad hoc Networks (멀티미디어 Ad hoc 네트워크에서 전달지연-전력인지 라우팅 프로토콜)

  • Huh, Jun-Ho;Kim, Yoon-Do;Seo, Kyung-Ryong
    • Journal of Korea Multimedia Society
    • /
    • v.15 no.3
    • /
    • pp.356-363
    • /
    • 2012
  • Power Aware Routing Protocol of MANET(Mobile Ad-hoc Network) minimized the power consumption of each node and helped to extend the lifetime of the network. But due to the nature of the protocol, it tends to increase the transmission delay, so multimedia transmissions were difficult to be applied. In this paper, a delay-power aware routing protocol is proposed considering the delay transmission delay that can be applied to ad hoc network. The proposed protocol consider two conflicting index, transmission delay and power consumption at the same time, maintaining a certain level of delay transmission delay while minimizes the power consumption. It is observed from the simulation results compared to not-considering delay transmission delay that the proposed protocol decrease transmission delay by 30% while the power consumption less than 10% increase.

On Unicast Routing Algorithm Based on Estimated Path for Delay Constrained Least Cost (경로 추정 기반의 지연시간을 고려한 저비용 유니캐스트 라우팅 알고리즘)

  • Kim, Moon-Seong;Bang, Young-Cheol;Choo, Hyun-Seung
    • Journal of Internet Computing and Services
    • /
    • v.8 no.1
    • /
    • pp.25-31
    • /
    • 2007
  • The development of efficient Quality of Service (QoS) routing algorithms in high speed networks is very difficult since divergent services require various quality conditions, If the QoS parameter we concern is to measure the delay on that link, then the routing algorithm obtains the Least Delay (LD) path, Meanwhile, if the parameter is to measure of the link cast, then it calculates the Least Cost (LC) path. The Delay Constrained Least Cast (DCLC) path problem of the mixed issues on LD and LC has been shown to be NP-hard. The path cost of LD path is relatively mere expensive than that of LC path, and the path delay of LC path is relatively higher than that of LD path in DCLC problem. In this paper. we propose the algorithm based on estimated path for the DCLC problem and investigate its performance, It employs a new parameter which is probabilistic combination of cost and delay, We have performed empirical evaluation that compares our proposed algorithm with the DCUR in various network situations.

  • PDF

A study on Green Roof System and Stormwater Reduction Effectiveness based on SWMM Model (SWMM 모델을 이용한 옥상녹화면에 따른 유출저감효과분석)

  • Kim, Jae Moon;Kim, Sae Bom;Kim, Byung Sung;Park, Kwang Hee;Shin, Hyun Suk
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2018.05a
    • /
    • pp.383-383
    • /
    • 2018
  • 최근 기후변화와 도시화로 인해 국지성 집중호우 및 불투수면적이 증가하고 있는 실정이며, 도시 지역 내의 첨두유량, 도달시간, 지체시간 등과 같은 수문학적 인자가 변화함에 따라 재산피해, 인명피해가 발생하고 있다. 저영향개발(Low Impact Development, LID) 기법은 수리수문학적 및 환경생태학적 문제를 저감하는 방안 중 하나로써 도시지역에서 수환경을 자연상태로 복원하는 대안으로 제시되고 있다. LID 기법 중 하나인 옥상녹화는 도시 내의 불투수면 증가로 인한 초과 지표면유출을 저감시켜 물관리를 하는 기술이다. 본 연구는 경남 양산시 부산대학교 제 2 캠퍼스에 조성된 옥상녹화 장치를 이용하여 정량적으로 유출량을 분석하였다. 비식생구와 식생구를 설치하고 실험의 시나리오는 강우강도를 25, 50, 75, 100 mm/hr로 설정하여 측정된 데이터 값을 바탕으로 SWMM(Storm Water Management Model) 모델링을 수행하였다. 유출량 값은 SWMM 5의 매개변수 추정지원 시스템인 SWMM-SCE를 이용하여 모형을 자동보정하였다. 보정된 모의유량은 실측유량과 0.28~3.81% 만큼의 오차를 보였고 각 시나리오에 따라 검증한 결과 상관계수가 0.82 이상으로서 실측값과 높은 상관성을 나타내었다. 옥상녹화 실험의 경우, 강우강도 75mm/hr일 때 첨두유출저감율과 지연시간은 각각 15.45% 감소, 15초 지연으로 최적의 효율이 나타났으며 강우강도 25mm/hr일 때 첨두유출저감율과 지연시간은 각각 1.36% 감소, 4초 지연으로 최저의 효율이 나타났다. SWMM 모의 결과는 강우강도 75mm/hr일 때 첨두유출저감율과 지연시간은 각각 15.45% 감소, 16초 지연으로 최적의 효율이 나타났으며 강우강도 25mm/hr일 때 첨두유출저감율과 지연시간은 각각 2.73% 감소, 4초 지연으로 최저의 효율이 나타났다.

  • PDF

Adaptive Delay Differentiation in Next-Generation Networks (차세대 네트워크에서의 적응형 지연 차별화 방식)

  • Paik Jung-Hoon;Park Jae-Woo;Lee Yoo-Kyung
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.43 no.6 s.348
    • /
    • pp.30-38
    • /
    • 2006
  • In this paper, an algerian that provisions absolute and proportional differentiation of packet delays is proposed with an objective for enhancing quality of service (QoS) in future packet networks. It features a scheme that compensates the deviation for prediction on the traffic to be arrived continuously It predicts the traffic to be arrived at the beginning of a time slot and measures the actual arrived traffic at the end of the time slot and derives the difference between them. The deviation is utilized to the delay control operation for the next time slot to offset it. As it compensates the prediction error continuously, it shows superior adaptability to the bursty traffic as well as the exponential traffic. It is demonstrated through simulation that the algorithm meets the quantitative delay bounds and shows superiority to the traffic fluctuation in comparison with the conventional non-adaptive mechanism.

A Priority Allocation Scheme Considering Virtual Machine Scheduling Delays in Xen Environments (Xen 환경에서 스케줄링 지연을 고려한 가상머신 우선순위 할당 기법)

  • Yang, Eun-Ji;Choi, Hyun-Sik;Han, Sae-Young;Park, Sung-Yong
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.37 no.4
    • /
    • pp.246-255
    • /
    • 2010
  • There exist virtual machine scheduling delays in virtualized environment in which virtual machines share physical resources. Many resource management systems have been proposed to provide better application QoS through monitoring and analyzing application performance and resource utilization of virtual machines. However, those management systems don't consider virtual machine scheduling delays, result in incorrect application performance evaluation and QoS violations In this paper, we propose an application behavior analysis considering the scheduling delays, and a virtual machine priority allocation scheme based on the analysis to improve the application response time by minimizing the overall virtual machine scheduling delays.

Adaptive Delay Threshold-based Priority Queueing Scheme for Packet Scheduling in Mobile Broadband Wireless Access System (광대역 이동 액세스 시스템에서의 실시간 및 비실시간 통합 서비스 지원을 위한 적응적 임계값 기반 패킷 스케줄링 기법)

  • Ku, Jin-Mo;Kim, Sung-Kyung;Kim, Tae-Wan;Kim, Jae-Hoon;Kang, Chung-G.
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.3A
    • /
    • pp.261-270
    • /
    • 2007
  • The Delay Threshold-based Priority Queueing (DTPQ) scheme has been shown useful for scheduling both real-time (RT) and non-real-time (NRT) service traffic in mobile broadband wireless access (MBWA) systems. The overall system capacity can be maximized subject to their QoS requirement by the DTPQ scheme, which takes the urgency of the RT service into account only when their head-of-line (HOL) packet delays exceed a given delay threshold. In practice, the optimum delay threshold must be configured under the varying service scenarios and a corresponding traffic load, e.g., the number of RT and NRTusers in the system. In this paper, we propose an adaptive version of DTPQ scheme, which updates the delay threshold by taking the urgency and channel conditions of RT service users into account. By evaluating the proposed approach in an orthogonal frequency division multiple access/time division duplex (OFDM/TDD)-based broadband mobile access system, it has been found that our adaptive scheme significantly improves the system capacity as compared to the existing DTPQ scheme with a fixed delay threshold.

Delay Optimization Algorithm for the High Speed Operation of FPGAs (FPGA를 고속으로 동작시키기 위한 지연시간 최적화 알고리듬)

  • Choi, Ick-Sung;Lee, Jeong-Hee;Lee, Bhum-Cheol;Kim, Nam-U
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.37 no.7
    • /
    • pp.50-57
    • /
    • 2000
  • We propose a logic synthesis algorithm for the design of FPGAs operating at high speed. FPGA is a novel technology that provides programmability in the field. Because of short turnaround time and low manufacturing cost, FPGA has been noticed as an ideal device for system prototyping. Despite these merits, FPGA has drawbacks, namely low integration and long delay time comparing to ASIC. The proposed algorithm partitions a given circuit into subcircuits utilizing a kernel divisor such that the subcircuits can be performed at the same time, hence reducing the delay of the circuit. Experimental results on the MCNC benchmark show that the proposed algorithm is effective by generating circuits having 19.1% les delay on average, when compared to the FlowMap algorithm.

  • PDF

Sensitivity of Feedback Channel Delay on Transmit Adaptive Array (적응형 송신 빔 성형을 적용한 CDMA 시스템의 귀환 채널 지연에 따른 성능)

  • 안철용;한진규;김동구
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.6B
    • /
    • pp.579-585
    • /
    • 2002
  • The investigation into the effect of various feedback errors on system performance can help the robust feedback channel design and transmission of exact feedback channel information as well. In this paper, we address the algorithm that determines space combining weight vector maximizing received signal power at mobile on frequency flat fading channel and investigate the performance degradation by feedback channel delay in the FDD/CDMA systems employing transmit beamforming. We observe the effect of feedback channel delay corresponding to the number of transmit antennas and the temporal/spatial correlation of channel. The results show that performance is more sensitive to feedback delay with the larger number of antennas when fadings at transmit antennas are not spatially correlated.