• IE interfaces
• /
• v.13 no.3
• /
• pp.424-430
• /
• 2000

Supply chain management (SCM) is an area that has recently received a great deal of attention in the business community. While SCM is relatively new, the idea of coordinated planning is not. During the last decades, many researchers have investigated multi-stage inventory problems. However, only a few papers address the problem of cost-optimal coordination of multi-stage inventory control with respect to service measures. Even published approaches have a shortcoming in dealing with a delivery lead time consisted of a shipping time and a waiting time. Assumed that there is no waiting time, or that the delivery lead time is implicitly compounded of a shipping time and a waiting time, the problem is often simplified into a multi-stage buffer allocation and a single-stage stochastic buffer sizing problem at all installations. This paper presents a simulation-based heuristic algorithm and a comparison with others for the problem that cannot be decomposed into a multi-stage buffer allocation and a single-stage stochastic buffer sizing problem because the waiting time ties together all stages. The comparison shows that the simulation-based heuristic algorithm performs better than other approaches in saving average inventory cost for both Poisson and Normal demands.

• Journal of information and communication convergence engineering
• /
• v.9 no.5
• /
• pp.530-538
• /
• 2011

Performance of TCP can be severely degraded in Mobile IP-based wireless networks where packet losses not related to network congestion occur frequently during inter-subnetwork handoffs by user mobility. To solve such a problem in the networks using Mobile IP, the packet buffering method at a base station(BS) recovers those packets dropped during handoff by forwarding the buffered packets at the old BS to the mobile users. But, when the mobile user moves to a congested BS in a new foreign subnetwork, those buffered packets forwarded by the old BS are dropped and TCP transmission performance of a mobile user degrades severely. In this paper, we propose a Modified BLUE(MBLUE) buffer required at a BS to increase TCP throughput in Mobile IP-based networks. When a queue length exceed a threshold and congestion grows, MBLUE increases its packet drop probability. But, when a TCP connection is added at new BS by a handoff, the old BS marks the buffered packets. And new BS receives the marked packets without dropping. Simulation results show that MBLUE buffer reduces congestion during handoffs and increases TCP throughputs.

• The Journal of the Korea Contents Association
• /
• v.2 no.2
• /
• pp.73-84
• /
• 2002

In this paper, we propose a enhanced ERICA switch algorithm using the buffer management scheme which can reduce the queue length, support the efficiency link utilization and the fair share. It has three different buffer thresholds which are low threshold, congestion notification threshold and high threshold. According to the each buffer threshold status, switch announced congestion notification to the source differently. So, sources could know the congestion more quickly and fast remover from network congestion. As a experimental results, it is proved that proposed algorithm is the more efficient than ERICA. Especially, proposed switch algorithm provides congestion control mechanism to make the best use of with keeping fairness and reduce queue length.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.6
• /
• pp.1208-1216
• /
• 2015

In this paper, we use WiMedia WLP-based networks to meet the demand for IT services of a ship. If a mobile node moves to a congested base station of a new subnetwork, we will propose a scheme for improving performance of radio link of existing communicating mobile nodes. An old base station denotes packets stored during a handover. And, a proposed buffer management determines to discard the buffered packets in accordance with congestion degree at the congested new base station. Simulation results show that the proposed buffer management scheme improves link utilization in congested wireless links.

• 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.

• Journal of Korea Multimedia Society
• /
• v.6 no.5
• /
• pp.842-848
• /
• 2003

The Guaranteed Frame Rate(GFR) service has been designed to accomodate non-real-time applications, such as TCP/IP based traffic in ATM networks. One of the important factors is buffer management for guaranteeing QoS in GFR service. In this paper, we propose a buffer management scheme which can improve the fairness and the throughput through the traffic control in GFR service. For the evaluation of the proposed scheme, we compare proposed scheme with the existing scheme in the fairness and the throughput. Simulation results show that proposed scheme can improve the fairness and throughput than the existing scheme.

• Journal of Institute of Control, Robotics and Systems
• /
• v.16 no.10
• /
• pp.1013-1017
• /
• 2010

This paper proposes a systematic approach to the rate-based feedback control based on the supervisory control framework for discrete event systems. We design the supervisor to achieve the desired behavior for TCP wireless networks. From the analysis and simulation results, it is shown that the controlled networks guarantee the fair sharing of the available bandwidth and avoid the packet loss caused by the buffer overflow of TCP wireless networks.

• Journal of KIISE:Databases
• /
• v.34 no.5
• /
• pp.379-388
• /
• 2007

Disordered streams may cause inaccurate or delayed results in window-based queries. Existing approaches usually leverage buffers to hand]e the streams. However, most of the approaches estimate the buffer size simply based on the maximum network delay in the streams, which tends to over-estimate the buffer size and result in high latency. In this paper, we propose a probabilistic approach to estimate the buffer size adaptively according to the fluctuated network delays. We first assume that intervals of tuple generations follow an exponential distribution and network delays have a normal distribution. Then, we derive an estimation function from the assumptions. The function takes a drop ratio as an input parameter, which denotes a percentage of tuple drops permissible during query execution. By describing the drop ratio in a query specification, users can control the quality of query results such as accuracy or latency according to application requirements. Our experimental results show that the proposed function has better adaptivity than the existing function based on the maximum network delay.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.10a
• /
• pp.726-729
• /
• 2013

In this paper, low power and high slew rate CMOS rail to rail input/output opamp applicable for ouput buffer amp, in LCD source driver IC, is proposed. Proposed op-amp, is realized the characteristics of low power consumption and high slew rate adding the newly designed control stage of class-B to the conventional output stage of class-AB. From the simulation results, we know that the proposed opamp buffer can drive a 1000pF capacitive load with a 6.5V/us slew-rate, while drawing only the the power consumption of 1.19mW from 3.3V power supply.

• Proceedings of the Korean Information Science Society Conference
• /
• 2011.06a
• /
• pp.420-421
• /
• 2011

This paper derive an optimal distributed power control strategy under both the probability of dropping a packet due to buffer overflow constraints at the secondary users and the interference constraints to the primary users.