• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.11
• /
• pp.2828-2835
• /
• 1996

In this paper we propose a new shaping algorithm which can control the shaping delay and the output buffer size based on the leaky bucket counter with a threshold value. This paper assumes that input traffic of the proposed shaping algorithm is the worst case traffic tolerated by the continuous leaky bucket algorithm and claracterizes traffic patterns that can depart from our shaping algorithm. We also compare shaping delay and output buffer size of the proposed algorithm with the existing shaping algorithm without a threshold value. Our results show that the proposed shaping algorithm can easily manage the shaping delay and output buffer size than any other mechanism.

• Proceedings of the KIEE Conference
• /
• 1997.11a
• /
• pp.101-105
• /
• 1997

This paper presents the worst-case time-delay in CAN(Controller Area Network) system through the mathematical model. Time-delay in the CAN system is devided into a generation delay, a transmission delay and a delivery delay. This paper also measures the performance represented in terms of the number of station, transmission speed, data size etc. by using the computer simulation.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.18 no.10
• /
• pp.1196-1202
• /
• 2007

In this paper, the effects of performance improvement far the OFDM based satellite communications are analyzed with applying the CI(Carrier Interferometry)-OFDM and channel coding scheme considering the group delay and gain ripple characteristic as well as the nonlinear characteristic of the transponder. Comparing the BER between traditional OFDM and CI-OFDM, the degree of performance improvement is presented in AWGN channel environments for specified backoff condition of HPA. The simulations are performed with the 36 MHz bandwidth of transponder channel, 120 Mbps transmission rate, and 16 QAM modulation scheme between ideal and worst case condition. It is shown that the improvement measure by the CI-OFDM and channel coding for the group delay and nonlinear characteristic outperforms that for the gain ripple in terms of performance degradation presented by the individual characteristics. And the simulation results show that the effects of improvement by the CI-OFDM outperforms the effect by the applied channel coding, particularly in worst case condition.

• Journal of Communications and Networks
• /
• v.1 no.3
• /
• pp.189-200
• /
• 1999

For admitting a hard real-time connection to an ATM network, it is required that the end-새둥 delays of cells belong-ing to the connection meet their deadlines without violating the guarantees already provided to the currently active connections. There are two kinds of methods to analyze the end-to-end delay in an ATM network. A decomposed method analyzes the worst case delay for each switch and then computes the total delay as the sum of the delays at individual switches. On the other hand, an integrated method analyzes all the switches involved in an inte-grated manner and derives the total delay directly. In this paper, we present an efficient and effecitive integrated method to compute the end-to-end delay. We evaluate the network performance under different system parameters and we compare the performance of the proposed method with the conventional decomposed and other integrated methods [1], [3], [5]-[9].

• ETRI Journal
• /
• v.22 no.3
• /
• pp.1-9
• /
• 2000

Self-Clocked Fair Queueing (SCFQ) algorithm has been considered as an attractive packet scheduling algorithm because of its implementation simplicity, but it has unbounded delay property in some input traffic conditions. In this paper, we propose a Rate Proportional SCFQ (RP-SCFQ) algorithm which is a rate proportional version of SCFQ. If any fair queueing algorithm can be categorized into the rate proportional class and input is constrained by a leaky bucket, its delay is bounded and the same as that of Weighted Fair Queueing (WFQ) which is known as an optimal fair queueing algorithm. RP-SCFQ calculates the timestamps of packets arriving during the transmission of a packet using the current value of system potential updated at every packet departing instant and uses a starting potential when it updates the system potential. By doing so, RP-SCFQ can have the rate proportional property. RP-SCFQ is appropriate for high-speed packet-switched networks since its implementation complexity is low while it guarantees the bounded delay even in the worst-case input traffic conditions.

• 전자공학회논문지 IE
• /
• v.45 no.1
• /
• pp.44-49
• /
• 2008

In this paper, the performance for the non-linear satellite channel including the characteristics of group delay and gain ripple of transponder is analyzed with multi-level QAM-OFDM schemes. Comparing the BER performances between general OFDM and CI(Carrier Interferometry)-OFDM for various QAM schemes, the degree of performance improvement is presented in AWGN environments for specified nonlinear characteristics. The simulations are performed with the 36MHz bandwidth of transponder channel and 120Mbps transmission rate for QPSK, 8QAM, 16QAM, 32QAM, 64QAM schemes between normal and worst case condition. It is shown that the improvement measure by the CI-OFDM for the group delay of channel and nonlinear characteristic of HPA outperforms that for the gain ripple in the case of higher level QAM scheme in normal condition. And the simulation results show that the additional techniques like the channel coding and compensation scheme against the nonlinear characteristic are required for 32QAM and higher level QAM in worst case condition.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.1141-1144
• /
• 1998

A new design methodology for the shortchannel CMOS IC-package is presented. It is developed by representing the package inductance with an effective lumpedinductance. The worst case maximum-simultaneous-switching noise (SSN) and gate propagation delay due to the package are modeled in terms of driver geometry, the maximum number of simultaneous switching drivers, and the effective inductance. The SSN variations according to load capacitances are investigated with this model. The package design techniques based on the proposed guidelines are verified by performing HSPICE simulations with the $0.35\mu\textrm{m}$ CMOS model parameters.

• Journal of Communications and Networks
• /
• v.8 no.1
• /
• pp.21-27
• /
• 2006

We present and analyze a class of limited sensing random access algorithms with powerful properties. The algorithms are implementable in wireless mobile environments and their operational properties are simple. Their throughput in the worst case of the limit Poisson user model is 0.4297, while this throughput degrades gracefully in the presence of channel feedback errors.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.24 no.4
• /
• pp.708-712
• /
• 1987

This paper deals with minimizing layout area of VLSI design. A long wire in a VLSI layout causes delay which can be reduced by using a driver. There can be significant area increase when many drivers are introduced in a layout. This paper describes a method to obtain tight bound on the worst-case increase in area when drivers are introduced along many long wires in a layout. The area occupied by minimum-area embedding for a circuit can depend on the aspect ratio of the bounding rectangle of the layout. This paper presents a separator-based area optimal embeddings for VLSI graphs in rectangles of several aspect ratios.

• Journal of Astronomy and Space Sciences
• /
• v.34 no.4
• /
• pp.281-288
• /
• 2017

The first Korea lunar orbiter, Korea Pathfinder Lunar Orbiter (KPLO), has been in development since 2016. After launch, the KPLO will execute several maneuvers to enter into the lunar mission orbit, and will then perform lunar science missions for one year. Among these maneuvers, the lunar orbit insertion (LOI) is the most critical maneuver because the KPLO will experience an extreme velocity change in the presence of the Moon's gravitational pull. However, the lunar orbiter may have a delayed LOI burn during operation due to hardware limitations and telemetry delays. This delayed burn could occur in different captured lunar orbits; in the worst case, the KPLO could fly away from the Moon. Therefore, in this study, the burn delay for the first LOI maneuver is analyzed to successfully enter the desired lunar orbit. Numerical simulations are performed to evaluate the difference between the desired and delayed lunar orbits due to a burn delay in the LOI maneuver. Based on this analysis, critical factors in the LOI maneuver, the periselene altitude and orbit period, are significantly changed and an additional delta-V in the second LOI maneuver is required as the delay burn interval increases to 10 min from the planned maneuver epoch.