• Journal of IKEEE
• /
• v.28 no.1
• /
• pp.1-5
• /
• 2024

To improve the performance of DRAM, it is essential to reduce sensing failures caused by mismatch in SA. Unlike flip failures, delay failures can be degraded, especially when high-speed operation is required, making it a critical consideration in the design of next-generation memory. While conventional SA operates with all transistors starting amplification simultaneously, SDSA selectively activates only two transistors that output BLB, thus alleviating offset. In this paper, we validate the superior performance of SDSA in mitigating delay failures through simulations. It was confirmed that SDSA exhibits approximately a 90 % reduction in delay failures compared to conventional SA.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• 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.

• International Journal of Highway Engineering
• /
• v.16 no.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)
• /
• v.11 no.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)
• /
• v.7 no.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.

• Journal of Industrial Technology
• /
• v.27 no.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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.9B
• /
• pp.774-782
• /
• 2003

Generally, in the Mobile IP technologies, the use of RSVP(Resource ReSerVation Protocol) is recommended in order to provide a mobile node real-time service. However, the handoff of a mobile node increases the registration delay, RSVP reservation delay and signalling overhead in the Mobile IP and RSVP interworking. Specially, the resource reservation on the path between a mobile node and a correspondent node is the duplicated reservation and then causes unnecessary creation of the signalling overhead and waste of the resource, since the majority of the path before handoff and after handoff is same. If the radius of a cell providing a wireless interface to a mobile node is small, the number of handoff will increase and also signalling overhead and duplicated resource reservation will increase. In this paper, we proposed the integration model of Cellular IP and RSVP with RSVP proxy scheme. Here, Cellular IP protocol minimizes registration delay, transfer delay, and loss by handoff in micro cell network, the RS VP proxy that minimizes the duplication of resource reservation prevents the path for RSVP session from change using the address for reservation of a mobile node. Proposed scheme was evaluated in comparison with the existing Mobile IP and RSVP interworking scheme using the probability of resource reservation fail to the radius of a cell and the handoff rate.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.1
• /
• pp.205-214
• /
• 2008

To transfer large amount of packets fast in sensor network, 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. If interval is too long, delay also becomes too long but if interval is too short, the fail of transfer request would increase. 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 time. Therefore ESTEO could provide high packet transmission rate given large amount of packets.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2007.11a
• /
• 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.

• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.18 no.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.