• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.41 no.5
• /
• pp.9-16
• /
• 2004

The data link layer of the PCI Express must have the transmitting buffer that contains the packets to transmit next time. Also it must have the retry buffer that contains the packets which were already transmitted but have not been acknowledged by the corresponding target device. In the separated buffer architecture, the data link layer can not transmit the packets in the transmitting buffer if the reiry buffer space is not enough. In this paper, we propose an efficient buffer architecture which merges the transmitting buffer and the retry buffer to a single buffer. Since the proposed buffer can dynamically assign the size of the transmitting buffer and the retry buffer, it can improve the buffer usage efficiency and the data transfer efficiency. The simulation result shows that the proposed buffer has the higher data transfer efficiency than the separated buffer architecture about 39% when the total buffer size is 8K byte.

• Journal of KIISE:Information Networking
• /
• v.35 no.2
• /
• pp.99-111
• /
• 2008

In recent years, the needs for WLANs(Wireless Local Area Networks) technology which can access to Internet anywhere have been dramatically increased particularly in SOHO(Small Office Home Office) and Hot Spot. However, unlike wired networks, there are some unique characteristics of wireless networks. These characteristics include the burst packet losses due to unreliable wireless channel. Note that burst packet losses, which occur when the distance between the wireless station and the AP(Access Point) increase or when obstacles move temporarily between the station and AP, are very frequent in 802.11 networks. Conversely, due to burst packet losses, the performance of 802.11 networks are not always as sufficient as the current application require, particularly when they use TCP at the transport layer. The high packet loss rate over wireless links can trigger unnecessary execution of TCP congestion control algorithm, resulting in performance degradation. In order to overcome the limitations of WLANs environment, MAC-layer LDA(Loss Differentiation Algorithm)has been proposed. MAC-layer LDA prevents TCP's timeout by increasing CRD(Consecutive Retry Duration) higher than burst packet loss duration. However, in the wireless channel with high packet loss rate, MAC-layer LDA does not work well because of two reason: (a) If the CRD is lower than burst packet loss duration due to the limited increase of retry limit, end-to-end performance is degraded. (b) energy of mobile device and bandwidth utilization in the wireless link are wasted unnecessarily by Reducing the drainage speed of the network buffer due to the increase of CRD. In this paper, we propose a new retransmission module based on Cross-layer approach, called BLD(Burst Loss Detection) module, to solve the limitation of previous link layer retransmission schemes. BLD module's algorithm is retransmission mechanism at IEEE 802.11 networks and performs retransmission based on the interaction between retransmission mechanisms of the MAC layer and TCP. From the simulation by using ns-2(Network Simulator), we could see more improved TCP throughput and energy efficiency with the proposed scheme than previous mechanisms.

• Journal of Digital Contents Society
• /
• v.12 no.3
• /
• pp.299-307
• /
• 2011

The MAC of IEEE 802.11 WLAN to control data transmission uses two control methods called DCF and PCF. The DCF controls the transmission based on CSMA/CA The BEB backoff algorithm of DCF shows relatively excellent performance in situation that the number of competing station is less, but has a problem that performance of throughput and delay is degraded in situation that the number of competing station is increased. This paper mathematically analyzes an MIMD backoff algorithm considering retry limit that increases the CW to doubled after collision and decreases smoothly the CW to halves after successful transmission in order to reduce the collision probability. To prove efficiency of the MIMD backoff algorithm, lots of simulations are conducted and analyzed.

• Bulletin of the Korean Mathematical Society
• /
• v.53 no.4
• /
• pp.985-1004
• /
• 2016

We consider the MAP/PH/c/K queue in which blocked customers retry to get service and servers may take vacations. The time interval between retrials and vacation times are of phase type (PH) distributions. Using the method of mean drift, a sufficient condition of ergodicity is provided. A condition for the system to be unstable is also given by the stochastic comparison method.

• KIISE Transactions on Computing Practices
• /
• v.23 no.8
• /
• pp.466-472
• /
• 2017

Hardware Transactional Memory (HTM) has greatly changed the parallel programming paradigm for transaction processing. Since Intel has recently proposed Transactional Synchronization Extension (TSX), a number of studies based on HTM have been conducted. However, the existing studies support conflict prediction for a single cause of the transaction processing and provide a standardized TSX environment for all workloads. To solve the problems, we propose an efficient hardware transactional memory scheme for processing transactions in multi-core in-memory environment. First, the proposed scheme determines whether to use Software Transactional Memory (STM) or the serial execution as a fallback path of HTM by using a prediction matrix to collect the information of previously executed transactions. Second, the proposed scheme performs efficient transaction processing according to the characteristic of a given workload by providing a retry policy based on machine learning algorithms. Finally, through the experimental performance evaluation using Stanford transactional applications for multi-processing (STAMP), the proposed scheme shows 10~20% better performance than the existing schemes.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.9
• /
• pp.1582-1589
• /
• 2006

A lock mechanism is essential for synchronization on the multiprocessor systems. The conventional queuing lock has two bus traffics that are the initial and retry of the lock-read. %is paper proposes the new locking protocol, called WPV (Waiting Processor Variable) lock mechanism, which has only one lock-read bus traffic command. The WPV mechanism accesses the shared data in the initial lock-read phase that is held in the pipelined protocol until the shared data is transferred. The nv mechanism also uses the cache state lock mechanism to reduce the locking overhead and guarantees the FIFO lock operations in the multiple lock contentions. In this paper, we also derive the analytical model of WPV lock mechanism as well as conventional memory and cache queuing lock mechanisms. The simulation results on the WPV lock mechanism show that about 50% of access time is reduced comparing with the conventional queuing lock mechanism.

• Journal of Astronomy and Space Sciences
• /
• v.16 no.2
• /
• pp.199-208
• /
• 1999

In this paper, KOMPSAT satellite launch and deployment operations are discussed. The U.S. Taurus launch vehicle delivers KOMPSAT satellite into the mission orbit directly. Launch and deployment operations is monitored and controlled by several international ground stations including Korean Ground Station (KGS). After separation from launch vehicle, KOMPSAT spacecraft deploys solar array by on-board autonomous stored commands without ground inter-vention and stabilizes the satellite such that solar arrays point to the sun. Autonomous ground communication is designed for KOMPSAT for the early orbit ground contact. KOMPSAT space-craft has capability of handing contingency situation by on-board fault management design to retry deployment sequence.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.34C no.5
• /
• pp.82-92
• /
• 1997

In this paper, we propose post-rpocessing method that corrects a misrecognized character by generated a characater recognizer using morphological analyzer and spelling corrector. The proposed post-processing consists of sthree phases : First, our method pass through morhological analyzer which only outputted necessary information for spelling correcting, doesn't analyze a bundle of phrases, and detects the location of misrecognized character. Second, tagging the generated candidate character using the information of character substitution table and grapheme substitution/separating table. Then we retry analysis after the misrecognition character has been substituted. Finally we select table, we investigate misrecognized charcters in CORPUS. Reliability analysis used to frequency of randomly selected about 100,000 words in CORPUS. A korean character recognizer demonstrates 93% correction rate without a post-processing. The entire recognition rate of our system with a post-processing exceeds 97% correction rate.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.2
• /
• pp.664-682
• /
• 2012

To improve the accuracy and enhance the applicability of existing models, this paper proposes a generalized Markov chain model for IEEE 802.11 Distributed Coordination Function (DCF) under the widely adopted assumption of ideal transmission channel. The IEEE 802.11 DCF is modeled by a two dimensional Markov chain, which takes into account unsaturated traffic, backoff freezing, retry limits, the difference between maximum retransmission count and maximum backoff exponent, and limited buffer size based on the M/G/1/K queuing model. We show that existing models can be treated as special cases of the proposed generalized model. Furthermore, simulation results validate the accuracy of the proposed model.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.19 no.4
• /
• pp.443-457
• /
• 2015

We consider the M/M/c/c queues in which the customers blocked to enter the service facility retry after a random amount of time and some of idle servers can leave the vacation. The vacation time and retrial time are assumed to be of phase type distribution. Approximation formulae for the distribution of the number of customers in service facility and the mean number of customers in orbit are presented. We provide an approximation for M/M/c/c queue with general retrial time and general vacation time by approximating the general distribution with phase type distribution. Some numerical results are presented.