• Journal of the Semiconductor & Display Technology
• /
• 제7권2호
• /
• pp.39-43
• /
• 2008

Productivity is one of the performance indices of the semiconductor equipment in manufacturing viewpoint. Among many ways tried and adopted for improvement of the productivity of the FAB equipment, variation of equipment configuration was considered and its effect on the throughput was analyzed. Parallel machine cycle charts that were generated based on the equipment log were used in the analysis. Efficiency of the equipment due to change of the structure and the probability of the usage in the manufacturing process were examined. The results showed that the modification of the control algorithm in the equipment and the redistribution of the process time for each process and transfer module along to the change in the structure enhance the throughput of the equipment.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• 제44권9호
• /
• pp.17-24
• /
• 2007

In this paper, we propose the sub-cell reuse partitioning among relays as an efficient resource reuse scheme in the relay-based OFDMA systems. If the frequency resource is reused among relays aggressively, we can increase the cell throughput. However, the interferences due to the frequency reuse may cause the fairness decrease due to the SINR degradation especially at the edge of RS sub-cells. In this paper, to make the cell throughput and fairness performance improved at the same time, we propose a sub-cell reuse partitioning scheme that divides a relay sub-cell into inner zone for aggressive reuse and outer zone for sparse reuse. The performance of the proposed scheme has been analyzed by computer simulation. We also applied a scheduling algorithm that can work together with the proposed sub-cell reuse partitioning scheme. Simulation results show that the proposed scheme can improve both the throughput and the fairness performances. In particular, when the scheduling is applied for the improvement of fairness, it is shown that the throughput performance can be enhanced more efficiently by the proposed scheme.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• 제16권1호
• /
• pp.121-127
• /
• 2016

Satellite communication is a communication method using a satellite as a repeater communication on the air and have a communication range is wide and is possible to transmit high-speed data, so Satellite communication has been highlighted as the next generation communication. However, because the distance between the ground and the satellite is far away, there is a disadvantage that propagation delay time is very long and packet is damaged. Therefore, this study was applied to Link Relay H-ARQ system in order to complement the damage to the packet. Furthermore, we propose the Modified Link Relay H-ARQ scheme is a new scheme to supplementation the delay time. By applying the Markov channel for implementing a channel of satellite communications, the results of analyzing the performance, when applying the Link Relay HARQ scheme, BER and PER performance was improved, when applying the Modified Link Relay H-ARQ scheme, Throughput performance was confirmed improvement.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• 제49권8호
• /
• pp.19-24
• /
• 2012

In this paper, we analyze the maximum throughput of opportunistic routing along a long-haul multi-hop wireless network path for a single data stream, while considering link-level interference among the network nodes. Surprisingly, we find out that opportunistic routing does not provide much improvement in throughput for long-haul paths. The results of this research show that when we compare the extra cost for the complex implementation of the opportunistic routing scheme to the performance improvement obtained from it, opportunistic routing scheme needs to be applied to only short-haul multi-hop wireless network paths.

• Proceedings of the Korea Contents Association Conference
• /
• 한국콘텐츠학회 2007년도 추계 종합학술대회 논문집
• /
• pp.555-559
• /
• 2007

AMGA is a metadata catalogue service which offers access to metadata for files stored on the Grid. We evaluated the performance of AMGA and analyzed overhead in the current AMGA implementation. It had 700% poor throughput (read/insert per second) compared with the direct DB access. The biggest overhead was in managing GSI/SSL Connections, degrading throughput about 350%. We alsomeasured the throughput of load-balanced AMGA services, and it showed linear throughput improvement when we increased the number of AMGA server. In addition, we measured the throughputin the WAN environment, and it showed the number of the maximum connections that an AMGA server can handle is the most critical factor in the throughput.

• Journal of Communications and Networks
• /
• 제4권3호
• /
• pp.230-245
• /
• 2002

Usually the network-throughput maximization problem for constant-bit-rate (CBR) circuit-switched traffic is posed for a fixed offered load profile. Then choices of routes and of admission control policies are sought to achieve maximum throughput (usually under QoS constraints). However, similarly to the notion of channel “capacity,” it is also of interest to determine the “network capacity;” i.e., for a given network we would like to know the maximum throughput it can deliver (again subject to specified QoS constraints) if the appropriate traffic load is supplied. Thus, in addition to determining routes and admission controls, we would like to specify the vector of offered loads between each source/destination pair that “achieves capacity.” Since the combined problem of choosing all three parameters (i.e., offered load, admission control, and routing) is too complex to address, we consider here only the optimal determination of offered load for given routing and admission control policies. We provide an off-line algorithm, which is based on Lagrangian techniques that perform robustly in this rigorously formulated nonlinear optimization problem with nonlinear constraints. We demonstrate that significant improvement is obtained, as compared with simple uniform loading schemes, and that fairness mechanisms can be incorporated with little loss in overall throughput.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 한국통신학회 1988년도 추계학술발표회 논문집
• /
• pp.101-108
• /
• 1988

In this paper packet-swap Accptant Queveing system with synchronous single server and finite storage space is proposed for throughput improvement. Queueling systems are analyzed with Minisint Approximation reported by J.F CHANG and R.F Chang. Comparison between PSA. Queveing system and First-Come First Acceptant Queveing system via throughput and blocking probabilliy of test octet was performed The comparison showed that PAS Queweing system perfumes better than j.F ChANG’s Queveing system.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• 제13권5호
• /
• pp.249-258
• /
• 2013

In multi-hop ad hoc networks, multi-interface multi-channel architecture is being noticing as methodology to improve the effective bandwidth and end-to-end throughput, But since existing routing metrics designed for networks based on single-interface exactly can not reflects the nature of networks based on multi-interface multi-channel, we are not expected the effect of throughput improvement. there had been proposal of MCR that discover high throughput by using metrics such as channel diversity and interface switching cost. however, MCR have an problem that is degraded it's performance in congested networks, because it not reflects the impact of traffic load. in this paper, we propose MAMCR metric, which select high throughput paths under congested conditions by combination MCR with channel access time metric, and conform it's the effect of performance improvement by ns-2 simulation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• 제40권5호
• /
• pp.871-885
• /
• 2015

The improved DFSA for 2.4GHz multi-tags active RFID is suggested in 2 different ways: 1) simplified tag collection and Ack procedure using query command and 2) modified Schoute's method to control the number of slots in the frame. To evaluate the performance of the improved system we develop the simulation model. Varying the number of tags in the system we track the performance measures such as throughput, recognition time for multi-tags and tag recognition rate during a given time. The suggested method shows the best performance over all measures. Simplification of collection and Ack commands using query commands contributes to reducing tag recognition time. And the modified Schoute's method which controls the frame size using $k_1$ and $k_2$ contributes to throughput improvement and reduces target cognition time by reducing the number of collection rounds.

• Proceedings of the IEEK Conference
• /
• 대한전자공학회 2005년도 추계종합학술대회
• /
• pp.159-162
• /
• 2005

Random Early Detection (RED), one of the most well-known Active Queue Management (AQM), has been designed to substitute Tail Drop and is nowadays widely implemented in commercially available routers. RED algorithm provides high throughput and low delay as well as a solution of global synchronization. However RED is sensitive to parameters setting, so the performance of RED, significantly depends on the fixed parameters. To solve this problem, the Adaptive RED (ARED) algorithm is suggested by S. Floyd. But, ARED also uses fixed parameters like target-queue length; it is hard to respond to bursty traffic actively. In this paper, we proposed AQM algorithm based on the variation of current queue length in order to improve adaptability about burst traffic. We measured performance of proposed algorithm through a throughput, marking-drop rate and bias phenomenon. In experimentation, we raised a packet throughput as reduced packet drop rate, and we confirmed to reduce a bias phenomenon about bursty traffic.