• 전기전자학회논문지
• /
• 제28권1호
• /
• pp.1-5
• /
• 2024

DRAM의 성능 개선을 위해 센스앰프의 미스매치로 인한 센싱페일을 감소시켜야 한다. 플립페일과 달리 딜레이페일은 고속 동작이 요구될 때 더 심화될 수 있어 차세대 메모리 설계 시 면밀히 고려되어야 할 문제이다. Conventional SA는 증폭 시작 시 모든 트랜지스터가 동시에 동작하는 반면, SDSA는 BLB를 출력으로 하는 트랜지스터 2개만 먼저 동작시켜 오프셋을 완화할 수 있다. 본 논문에서는 SDSA의 딜레이페일에 대한 우수성을 시뮬레이션을 통해 검증하였다. Conventional SA에 비해 약 90%의 딜레이 페일 감소 효과를 갖고 있음을 확인했다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2006년도 하계종합학술대회
• /
• pp.53-54
• /
• 2006

In this paper, we analytically evaluate packet delay and energy consumption of S-MAC protocol with a modified Markov chain model. Although some models, based on IEEE 802.11 MAC protocol, to analyze the S-MAC protocol in wireless sensor network (WSN) have been proposed, they fail to consider the differences in architecture between the S-MAC and the 802.11 MAC. Therefore, by reflecting the significant features in the S-MAC function, we model the operation of S-MAC protocol, and derive its packet delay and energy consumption in single-hop WSN. Numerical results show the delay and the dissipated energy at various duty cycle values according to offered load, where a practical mote is used.

• 한국도로학회논문집
• /
• 제16권5호
• /
• pp.165-171
• /
• 2014

PURPOSES : The objective of this study is to find Percentile Speed($V_p$) for Appraisal of Road Section with Recurring Congestion. METHODS : Percentile Speed($V_p$) is determined by correlation analysis of CSI that proposed existing literature. and CSI(Consistency Service Index) is a index that subtract service fail frequency from 100 points, and service fail is defined as traffic situation is driving less than 80kph speed. In this study, We analyzed the highest correlation percentile speed associated with CSI. This speed is chosen as a delay decision speed. In order to verifying reliability, it performed a comparison with the previous method. RESULTS : As a result, 30 percentile speed($V_{30}$) was decided as index speed for judgement of recurring congestion section, and through comparison with existing methods, we demonstrated that 30 percentile speed can be useful for judgement of recurring congestion section. CONCLUSIONS : This method to Determine recurring congestion section using the percentile speed($V_{30}$) was proposed for the first time in this paper. This method can be applicated more quickly and easily than existing method for determining of recurring delay section.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권11호
• /
• pp.5200-5222
• /
• 2017

The separation of control plane and data plane in Software Defined Network (SDN) makes it flexible to control the network behavior, while also causes some inconveniences to the link failure recovery due to the delay between fail point and the controller. To avoid delay and packet loss, pre-defined backup paths are used to reroute the disrupted flows when failure occurs. However, it may introduce large overhead to build and maintain these backup paths and is hard to dynamically construct backup paths according to the network status so as to avoid congestion during rerouting process. In order to realize congestion aware fast link failure recovery, this paper proposes a novel method which installs multi backup paths for every link via source routing and per-hop-tags and spread flows into different paths at fail point to avoid congestion. We carry out experiments and simulations to evaluate the performance of the method and the results demonstrate that our method can achieve congestion aware fast link failure recovery in SDN with a very low overhead.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권8호
• /
• pp.1890-1910
• /
• 2013

Routing overlay offers an ideal methodology to improve the end-to-end communication performance by deriving a backup path for any node pair. This paper focuses on a challenging issue of selecting a proper backup path to bypass the failures on the default path with high probability for any node pair. For existing backup path selection approaches, our trace-driven evaluation results demonstrate that the backup and default paths for any node pair overlap with high probability and hence usually fail simultaneously. Consequently, such approaches fail to derive a robust backup path that can take over in the presence of failure on the default path. In this paper, we propose a three-phase RBPS approach to identify a proper and robust backup path. It utilizes the traceroute probing approach to obtain the fine-grained topology information, and systematically employs the grid quorum system and the Bloom filter to reduce the resulting communication overhead. Two criteria, delay and fault-tolerant ability on average, of the backup path are proposed to evaluate the performance of our RBPS approach. Extensive trace-driven evaluations show that the fault-tolerant ability of the backup path can be improved by about 60%, while the delay gain ratio concentrated at 14% after replacing existing approaches with ours. Consequently, our approach can derive a more robust and available backup path for any node pair than existing approaches. This is more important than finding a backup path with the lowest delay compared to the default path for any node pair.

• 산업기술연구
• /
• 제27권B호
• /
• pp.235-243
• /
• 2007

Sensor network is used to obtain sensing data in various area. The interval to sense the events depends on the type of target application and the amounts of data generated by sensor nodes are not constant. Many applications exploit long sensing interval to enhance the life time of network but there are specific applications that requires very short interval to obtain fine-grained, high-precision sensing data. If the number of nodes in the network is increased and the interval to sense data is shortened, the amounts of generated data are greatly increased and this leads to increased amount of packets to transfer to the network. To transfer large amount of packets fast, it is necessary that the delay between successive packet transmissions should be minimized as possible. In Sensor network, since the Operating Systems are worked on the event driven, the Timer Event is used to transfer packets successively. However, since the transferring time of packet completely is varies very much, it is very hard to set appropriate interval. The longer the interval, the higher the delay and the shorter the delay, the larger the fail of transfer request. In this paper, we propose ESTEO which reduces the delay between successive packet transmissions by using SendDone Event which informs that a packet transmission has been completed.In ESTEO, the delay between successive packet transmissions is shortened very much since the transmission of next packet starts at the time when the transmission of previous packet has completed, irrespective of the transmission timee. Therefore ESTEO could provide high packet transmission rate given large amount of packets.

• 한국통신학회논문지
• /
• 제28권9B호
• /
• pp.774-782
• /
• 2003

일반적으로 Mobile IP 기술에 있어 이동 노드에게 실시간 서비스를 제공하기 위한 방안으로 RSVP 사용이 제시되고 있다. 그러나 Mobile IP와 RSVP(Resource Reservation Protocol) 연동시 이동 노드의 핸드오프는 등록 지연, RSVP 예약 지연 및 시그널링 오버헤드를 증가시킨다. 특히 이동 노드와 대응 노드 사이의 경로에 대한 자원 예약은 핸드오프 이전과 이후 경로가 대부분 같기 때문에 중복 예약이며, 불필요한 시그널링의 생성과 자원 낭비를 초래한다. 만약 무선 인터페이스를 제공하는 셀의 반경이 작다면 이동 노드의 핸드오프는 증가할 것이며 따라서 시그널링 오버헤드와 자원 중복 예약이 크게 증가할 것이다. 본 논문은 RSVP proxy 방안의 Cellular IP와 RSVP 통합 모델을 제안한다. Cellular IP 프로토콜은 마이크로 셀 네트워크에서 핸드오프에 의한 등록 지연, 전송 지연 및 손실을 최소화하며, RSVP proxy는 자원 중복 예약을 최소화하는 방안으로 이동 노드의 예약 주소를 사용하여 Cellular IP 외부 네트워크에서의 RSVP 세션 경로 변경이 일어나지 않도록 한다. 제안 방안은 셀 반경과 핸드오프율에 대해 자원 예약 실패 확률을 이용 기존 Mobile IP와 RSVP 연동 방안과 비교 평가하였다.

• 한국정보통신학회논문지
• /
• 제12권1호
• /
• pp.205-214
• /
• 2008

수많은 센서 노드들을 이용하여 주변환경으로부터 정보를 수집하는 센서네트워크에서 많은 양의 패킷을 빠르게 전송하기 위해서는 패킷 전송간에 지연을 최소화하여 효율성을 높일 필요가 있다. 센서네트워크에서 이벤트에 기반하여 동작하는 운영 체제에서는 주로 주기적으로 발생하는 Timer Event를 이용하여 연속적으로 패킷을 전송한다. 하지만 무선 센서네트워크의 특성상 패킷을 전송하는데 소요되는 시간이 매우 가변적이기 때문에 적합한 주기를 설정하기가 매우 어렵다. Timer Event의 발생주기에 따라 패킷 전송간에 지연이 증가하거나 전송요청이 실패 할 수 있다. 본 논문에서는 패킷 전송 작업이 완료되었음을 알려 주는 SendDone Event를 이용하여 연속적인 패킷전송 시 지연을 줄여 주는 ESTEO기법을 제안한다. ESTEO에서는 패킷 전송이 완료된 시점에 즉시 다음 패킷을 전송하기 때문에 패킷을 전송하는데 소요되는 시간에 상관없이 패킷 전송간에 지연이 발생하지 않는다. 따라서 연속적으로 대량의 패킷을 전송할 때 높은 전송율을 제공할 수 있다.

• 한국소음진동공학회:학술대회논문집
• /
• 한국소음진동공학회 2007년도 추계학술대회논문집
• /
• pp.23-27
• /
• 2007

Many trials have been used to model room impulse responses, all attempting to provide efficient representations of room acoustics. The traditional model designs for room impulse response seem to fail in accuracy, controllability, or computational efficiency. In time domain, a room impulse response is generally considered as the combination of three parts having different acoustic characteristics, initial time delay, early reflection, and late reverberation. This paper introduces new learning hybrid model for the room impulse response. In this proposed model, those three parts are modeled using different models with learning algorithms that determine the length or boundary of each model in the hybrid model. By the simulation with measured room impulse responses, it was examined that the performance of proposed model shows the best efficiency in views of both the parameter numbers and modeling error.

• 한국소음진동공학회논문집
• /
• 제18권3호
• /
• pp.361-367
• /
• 2008

Many trials have been used to model room impulse responses, all attempting to provide efficient representations of room acoustics. The traditional model designs for room impulse response seem to fail in accuracy, controllability, or computational efficiency. In the time domain, room impulse responses are generally considered as combination of the three Parts having different acoustic characteristics, initial time delay, early reflection, and late reverberation. This paper introduces new learning hybrid model for room impulse responses. In this proposed model, those three parts are modeled using different models with learning algorithms that determine the boundary of each model in the hybrid model. By the simulation with measured room impulse responses, the performance of proposed model shows the best efficiency in views of computational burden and modeling error.