• 대한공업교육학회지
• /
• v.32 no.2
• /
• pp.199-216
• /
• 2007

Stream Control Transmission Protocol(SCTP) is a transport layer protocol to support the data transmission. SCTP is similar to Transmission Control Protocol(TCP) in a variety of aspects. However, several features of SCTP including multi-homing and multi-streaming incur the performance difference from TCP. This paper highlights the data transfer during the initial slow start phase in SCTP congestion control composed of slow start phase and congestion avoidance phase. In order to compare the mean transfer time between SCTP and TCP, we experiment with different performance parameters including bandwidth, round trip time, and data length. By varying data length, we also measure the corresponding initial window size, which is one of factors affecting the mean transfer time. For the experiment, we have written server and client applications by C language using SCTP socket API and have measured the transfer time by ethereal program. We transferred data between client and server using round-robin method. Analysis of these experimental results from the testbed implementation shows that larger initial window size of SCTP than that of TCP brings the reduction in the mean transfer time of SCTP compared with TCP by 15 % on average during the initial slow start phase.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.34 no.1
• /
• pp.153-165
• /
• 2009

This paper apollos an ant colony system (ACS) for the vehicle routing problem with time window (VRPTW). The VRPTW is a generalization of the VRP where the service of a customer can begin within the time windows defined by the earliest and latest times when the customer will permit the start of service. The ACS has been applied effectively in geographical environment such as TSP or VRP by meta-heuristic that imitate an ant's biologic special duality in route construction, 3 saving based ACS (SB-ACS) is introduced and its solution is improved by local search. Through iterative precesses, the SB-ACS is shown to drive the best solution. The algorithm has been tested on 56 Solomon benchmarking problems and compared to the best-known solutions on literature. Experimental results shows that SB-ACS algorithm could obtain food solution in total travel distance minimization.

• Investigative Magnetic Resonance Imaging
• /
• v.26 no.2
• /
• pp.125-134
• /
• 2022

Purpose: The aim of this study was to investigate the change in signal sensitivity over different acquisition start times and optimize the scanning window to provide the maximal signal sensitivity of [1-¹³C]pyruvate and its metabolic products, lactate and alanine, using spatially localized hyperpolarized 3D ¹³C magnetic resonance spectroscopic imaging (MRSI). Materials and Methods: We acquired 3D ¹³C MRSI data from the brain (n = 3), kidney (n = 3), and liver (n = 3) of rats using a 3T clinical scanner and a custom RF coil after the injection of hyperpolarized [1-¹³C]pyruvate. For each organ, we obtained three consecutive 3D ¹³C MRSI datasets with different acquisition start times per animal from a total of three animals. The mean signal-to-noise ratios (SNRs) of pyruvate, lactate, and alanine were calculated and compared between different acquisition start times. Based on the SNRs of lactate and alanine, we identified the optimal acquisition start timing for each organ. Results: For the brain, the acquisition start time of 18 s provided the highest mean SNR of lactate. At 18 s, however, the lactate signal predominantly originated from not the brain, but the blood vessels; therefore, the acquisition start time of 22 s was recommended for 3D ¹³C MRSI of the rat brain. For the kidney, all three metabolites demonstrated the highest mean SNR at the acquisition start time of 32 s. Similarly, the acquisition start time of 22 s provided the highest SNRs for all three metabolites in the liver. Conclusion: In this study, the acquisition start timing was optimized in an attempt to maximize metabolic signals in hyperpolarized 3D ¹³C MRSI examination with [1-¹³C] pyruvate as a substrate. We investigated the changes in metabolic signal sensitivity in the brain, kidney, and liver of rats to establish the optimal acquisition start time for each organ. We expect the results from this study to be of help in future studies.

• Journal of Korean Institute of Industrial Engineers
• /
• v.27 no.1
• /
• pp.18-24
• /
• 2001

This paper presents a model and a heuristic algorithm for the Traveling Salesman Problem with Time Windows(TSPTW). The main difference of our model compared with the previous ones lies in that the time windows we are concerned are more flexible and realistic than the previous ones. In the typical TSPTW, the service at a node must begin within the time grid called the time window that is defined by the earliest and the latest time to start the service at each node. But, in real business practice, a lateness cost is usually penalized rather than the service is prohibited at all when a vehicle arrives after the latest time. Considering this situation, we develop a model with a new time window that allows an arrival after the latest time and penalizes the late arrival by charging a lateness cost. A two-phased heuristic algorithm is proposed for the model and is extensively tested to verify the accuracy and efficiency of the algorithm.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.22 no.53
• /
• pp.13-22
• /
• 1999

This paper presents a model and dynamic programming based algorithm for the Traveling Salesperson Problem with Time Windows (TSPTW). The main difference of our model compared with the previous ones lies in that the time windows we are concerned are far more flexible and realistic. In the typical TSPTW, the service at a node must begin within the time grid called the time window that is defined by the earliest and the latest time to start the service at the node. But, in real business practices, a lateness cost is usually penalized rather than the service is prohibited at all when a vehicle arrives after the latest time. Considering this situation, we propose a model with a new time window that allows an arrival after the latest time and penalizes the late arrival by charging a lateness cost. An algorithm introduced for the model is extensively tested to verify the accuracy and efficiency.

• Journal of Information Display
• /
• v.11 no.2
• /
• pp.39-44
• /
• 2010

The time dependences of the luminance properties of 55-inch CCFL and LED backlights and 32-inch FFL backlights with LCD panels were investigated during the warm-up time from the cold start. The long-term luminance maintenance curve of a standard CCFL was examined in a time window up to 5000 hours. These two time dependences are important characteristics from the viewpoint of initial picture quality and lifetime reliability, respectively. Empirical equations were suggested for the analysis of the time dependence of these luminance data. These approaches are expected to be helpful in predicting the luminance properties of backlights based on the luminance data obtained in a limited time window.

• Journal of KIISE
• /
• v.42 no.9
• /
• pp.1162-1174
• /
• 2015

These days, the networks have exhibited HBDP (High Bandwidth Delay Product) characteristics. The legacy TCP slowly increases the size of the congestion window and drastically decreases the size of a congestion window. The legacy TCP has been found to be unsuitable for HBDP networks. TCP mechanisms for solving the problems of the legacy TCP can be categorized into the loss-based TCP and the delay-based TCP. Most of the TCP mechanisms use the standard slow start phase, which leads to a heavy packet loss event caused by the overshoot. Also, in the case of congestion avoidance, the loss-based TCP has shown problems of wastage in terms of the bandwidth and RTT (Round Trip Time) fairness. The delay-based TCP has shown a slow increase in speed and low occupancy of the bandwidth. In this paper, we propose a new scheme for improving the over shoot, increasing the speed of the bandwidth and overcoming the bandwidth occupancy and RTT fairness issues. By monitoring the buffer condition in the bottleneck link, the proposed scheme does congestion control and solves problems of slow start and congestion avoidance. By evaluating performance, we prove that our proposed scheme offers better performance in HBDP networks compared to the previous TCP mechanisms.

• Journal of Internet of Things and Convergence
• /
• v.1 no.1
• /
• pp.1-4
• /
• 2015

This paper aims to present the mathematical model to find the mean web object transfer latency in the slow-start phase of TCP congestion control mechanism, which is one of the main control techniques of Internet. Mean latency is an important service quality measure of end-user in the network. The application area of the proposed latency model is the narrowband environment including multi-hop wireless network and Internet of Things(IoT), where packet loss occurs in the slow-start phase only due to small window. The model finds the latency considering initial window size and the packet loss rate. Our model shows that for a given packet loss rate, round trip time and initial window size mainly affect the mean web object transfer latency. The proposed model can be applied to estimate the mean response time that end user requires in the IoT service applications.

• 대한공업교육학회지
• /
• v.33 no.2
• /
• pp.248-258
• /
• 2008

Current Internet uses HTTP (Hyper Text Transfer Protocol) as an application layer protocol and TCP (Transmission Control Protocol) as a transport layer protocol to provide web service. SCTP (Stream Control Transmission Protocol) is a recently proposed transport protocol with very similar congestion control mechanisms as TCP, except the initial congestion window during the slow start phase. In this paper, we present a mathematical model of object transfer latency during the slow start phase for HTTP over SCTP and compare with the latency of HTTP over TCP. Validation of the model using experimental result shows that the mean object transfer latency for HTTP over SCTP during the slow start phase is less than that for HTTP over TCP by 11%.

• The KIPS Transactions:PartC
• /
• v.14C no.6
• /
• pp.475-480
• /
• 2007

Recently, wireless networking devices that depend on the limited Battery and power-saving of wireless hosts became important issue. Batteries can provide a finite amount of energy, therefore, to increase battery lifetime, it is important to design techniques to reduce energy consumption by wireless hosts. This paper improved power saying mechanism in Distributed Coordination Function(DCF) of IEEE 802.11. In the IEEE 802.11 power saving mechanism specified for DCF, time is divided into so-called beacon intervals. At the start of each beacon interval, each node in the power saving mode periodically wakes up during duration called the ATIM Window. The nodes are required to be synchronized to ensure that all nodes wake up at the same time. During the ATIM window, the nodes exchange control packets to determine whether they need to stay awake for the rest of the beacon interval. The size of the ATIM window has considerably affected power-saving. This paper can provide more power-saving than IEEE 802.11 power saving mode because ATIM window size is efficiently increased or decreased.