• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.3 s.345
• /
• pp.126-134
• /
• 2006

Traditional TCP implementations have the under-utilization problem in large bandwidth delay product networks especially during the startup phase. In this paper, we propose a delay-based congestion control(DCC) mechanism to solve the problem. DCC is subdivided into linear and exponential growth phases. When there is no queueing delay, the congestion window grows exponentially during the congestion avoidance period. Otherwise, it maintains linear increase of congestion window similar to the legacy TCP congestion avoidance algorithm. The exponential increase phase such as the slow-start period in the legacy TCP can cause serious performance degradation by packet losses in case the buffer size is insufficient for the bandwidth-delay product, even though there is sufficient bandwidth. Thus, the DCC uses the RTT(Round Trip Time) status and the estimated queue size to prevent packet losses due to excessive transmission during the exponential growth phase. The simulation results show that the DCC algorithm significantly improves the TCP startup time and the throughput performance of TCP in large bandwidth delay product networks.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.46 no.4
• /
• pp.294-303
• /
• 2023

During wartime, the operation of engineering equipment plays a pivotal role in bolstering the combat prowess of military units. To fully harness this combat potential, it is imperative to provide efficient support precisely when and where it is needed most. While previous research has predominantly focused on optimizing equipment combinations to expedite individual mission performance, our model considers routing challenges encompassing multiple missions and temporal constraints. We implement a comprehensive analysis of potential wartime missions and developed a routing model for the operation of engineering equipment that takes into account multiple missions and their respective time windows of required start and completion time. Our approach focused on two primary objectives: maximizing overall capability and minimizing mission duration, all while adhering to a diverse set of constraints, including mission requirements, equipment availability, geographical locations, and time constraints.

• Journal of the Korean Solar Energy Society
• /
• v.31 no.4
• /
• pp.1-8
• /
• 2011

In this paper, inverse building modeling was applied to building perimeter zones which have different window orientation. Two test zones of east-facing and west-facing zones in ERS(Energy Resource Station) building, which is representative of small commercial building, was used to test performance of cooling load calculation and peak cooling load reduction. The dynamic thermal load model for the east and west zone was validated using measured data for the zones and then it was used to investigate the effect of peak cooling load reduction by adjustment of indoor cooling temperature set points during on-peak time period. For the east zone, the peak load can be reduced to about 60% of the peak load for conventional control even without any precooling. For the west zone, PLR is nearly independent of the start of the on-peak period until a start time of 1pm. Furthermore, PLR has a small dependence on the precooling duration. Without any precooling, the peak cooling load can be reduced to about 35% of the peak load associated with conventional control.

• Journal of Korea Society of Industrial Information Systems
• /
• v.13 no.1
• /
• pp.46-56
• /
• 2008

Double Patching is a multicasting technique for a VoD system which has been proposed to provide a true VoD service by making clients share a long patching stream as well as a regular stream For subsequent short patching streams, the technique always makes the long patching stream have extra data that will be played back during a double period of a patching window. In this paper, we propose a technique, using the start time of the latest short patching stream, optimizes Double Patching by deleting the useless data included in the long patching stream when the patching window of the long patching stream closes. The mean requirement for the server's bandwidth to provide the true VoD service is used as a performance metric, and the effect of the request inter-arrival time, the size of the client's local buffer and the video length on the mean bandwidth requirement is evaluated. Performance evaluation result shows that the proposed technique optimizes Double Patching in all cases.

• IE interfaces
• /
• v.7 no.3
• /
• pp.171-180
• /
• 1994

Defined is a Multi-level Parallel Machine Flow-Shop (MPMFS) which reflects some real world manufacturing situations. Just-In-Time (JIT) philosophy is applied to the MPMFS scheduling in order to achieve lowering work-in-process inventory level as well as meeting due dates. A schedule generating simulator is developed. The latest start time of each operation is determined by a backward simulation followed by another forward simulation to analyze the schedule feasibility and actual inventory level. Reasonable schedules are available through adjusting some parameters for allowance factors such as set-up times of machines and other environmental changes. The SLAMSYSTEM under Window is employed for this processing with some input/output data handling processes devised under DOS.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.10
• /
• pp.556-568
• /
• 2003

This paper presents and analyzes the performance of a weighted-window based cache replacement policy for the efficient media caching in streaming media cache servers. The proposed policy makes, for each cached object, use of the reference count, reference time, amount of media delivered to clients and, in particular, the periodic patterns of user requests. Also, by giving weights to the recently referenced media contents, the replacement policy adequately and swiftly reflects the ever-changing characteristics of users preferences. The simulation studies show that the performance of the proposed policy has improved over the conventional policies such as LRU, LFU and SEG - in terms of hit ratio, byte hit ratio, delayed start and cache input.

• Journal of Korean Society for Quality Management
• /
• v.30 no.3
• /
• pp.111-119
• /
• 2002

Gears are essential elements for mechanical power transmission. Geometric precision is the main factor for characterizing gear grade and qualify. Gear pitch is one of the crucial measurements, which is defined as a distance between two adjacent gear teeth. It is well-known that variability in gear pitches may causes wear-out and vibration noise. Therefore maintaining pitch errors at a low level plays a key role in assuring the gear quality to customers. This paper is concerned with a case study, which presents a computerized system for Inspecting pitch errors in a gear machining process. This system consists of a PC and window-based programs. Although the start and stop is manually accomplished, the process of measuring and analyzing pitch data is automatically conducted in this system. Our purpose lies in reducing inspection cost and time as well as Increasing test reliability. Its operation is briefly illustrated by example. Sometimes a strong autocorrelation is observed from pitch data. We also discuss a process monitoring scheme taking account of autocorrelations.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.42 no.4
• /
• pp.16-22
• /
• 2019

After Dantzig and Rasmer introduced Vehicle Routing Problem in 1959, this field has been studied with numerous approaches so far. Classical Vehicle Routing Problem can be described as a problem of multiple number of homogeneous vehicles sharing a same starting node and having their own routes to meet the needs of demand nodes. After satisfying all the needs, they go back to the starting node. In order to apply the real world problem, this problem had been developed with additional constraints and pick up & delivery model is one of them. To enhance the effectiveness of pick up & delivery, hub became a popular concept, which often helps reducing the overall cost and improving the quality of service. Lots of studies have suggested heuristic methods to realize this problem because it often becomes a NP-hard problem. However, because of this characteristic, there are not many studies solving this problem optimally. If the problem can be solved in polynomial time, optimal solution is the best option. Therefore, this study proposes a new mathematical model to solve this problem optimally, verified by a real world problem. The main improvements of this study compared to real world case are firstly, make drivers visit every nodes once except hub, secondly, make drivers visit every nodes at the right time, and thirdly, make drivers start and end their journey at their own homes.

• Journal of Digital Contents Society
• /
• v.15 no.2
• /
• pp.147-154
• /
• 2014

There have been company researches for TCP-Westwood algorithms in wireless TCP environment with high packet loss rate. Because the TCP-Westwood algorithm adjusts the congestion window according to the ABE(Available Bandwidth Estimation), the algorithm has a problem which the accuracy of ABE decreases as the error rate increases. To solve such a problem, the proposed scheme in this paper adopts the existing packet pattern based algorithm that the ABE is ignored when the arriving interval time of ACK is longer than a given interval time and uses new algorithm that the ABE is reallocated to a given allowable ABE when the ABE is over the allowable range. The proposed scheme shows the simulation result that the ABE is closest to the setting bandwidth for simulation compared to the existing algorithms.

• Journal of Computing Science and Engineering
• /
• v.1 no.1
• /
• pp.56-73
• /
• 2007

Demands have been growing in safety-critical application fields for producing networked real-time embedded computing (NREC) systems together with acceptable assurances of tight service time bounds (STBs). Here a service time can be defined as the amount of time that the NREC system could take in accepting a request, executing an appropriate service method, and returning a valid result. Enabling systematic composition of large-scale NREC systems with STB certifications has been recognized as a highly desirable goal by the research community for many years. An appealing approach for pursuing such a goal is to establish a hard-real-time (HRT) component model that contains its own STB as an integral part. The TMO (Time-Triggered Message-Triggered Object) programming scheme is one HRT distributed computing (DC) component model established by the first co-author and his collaborators over the past 15 years. The TMO programming scheme has been intended to be an advanced high-level RT DC programming scheme that enables development of NREC systems and validation of tight STBs of such systems with efforts far smaller than those required when any existing lower-level RT DC programming scheme is used. An additional goal is to enable maximum exploitation of concurrency without damaging any major structuring and execution approaches adopted for meeting the first two goals. A number of previously untried program structuring approaches and execution rules were adopted from the early development stage of the TMO scheme. This paper presents new concrete justifications for those approaches and rules, and also discusses new extensions of the TMO scheme intended to enable further exploitation of concurrency in NREC system design and programming.