• Journal of Navigation and Port Research
• /
• v.29 no.8 s.104
• /
• pp.723-733
• /
• 2005

This paper presents a deadlock avoidance method for AGVs in automated container terminals. For a more efficient use of AGV traveling area, we divided the area into small-sized grids not enough to cover a whole AGV. Our deadlock avoidance method controls AGVs by identifying strongly connected components(SCCs) in a graph derived from the paths of AGVs on the grids. Also in this paper we suggest a route selection scheme which selects a route by predicting and comparing travel times of candidate routes by using a regression formula. Simulation experiments have shown that the proposed method can control AGVs for 48 hours without deadlocks and the count of AGV visits per QC is increased by $2\~10$ an hour.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.8A
• /
• pp.830-836
• /
• 2006

One of the seminal operation parameters of AODV is the node-to-node travel time of data, which is currently set to fixed value of 40 ms in the RFC3561 and widely used to compute other parameters such as the expected round-trip time of the connection setup message, etc. We have naturally thought the network performance could be improved by dynamically varying the node-to-node travel time with respect to the traffic condition in the networt rather than using the fixed value, which motivates this work. To this end, we apply the idea of using timestamp; every node places the current time in the message before sending it out, and the receiver node computes the node travel time based on the moving average algorithm by considering not only the current value but also the previous ones in an accumulated and exponentially decreasing fashion with time. We evaluate the performance of the proposed scheme in respect of the number of RREQ messages generated, throughput, and delay as a function of traffic load and node mobility, and compare the result with the original AODV scheme. The results show that the proposed scheme presents noticeable performance improvements, expecially under the condition of high node mobility and high traffic load.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.8C
• /
• pp.758-770
• /
• 2002

In this paper, we propose a novel resource allocation scheme which can maximize capacity for QoS guarantee of Assured Service in Differentiated Services. Performance of the proposed resource allocation scheme is analyzed with each buffer management scheme such as RIO and Adaptive RIO. To prevent an early random drop of the admitted In-profile packet, Adaptive RIO scheme updates parameters of RIO scheme every time interval according to the estimated numbers of maximum packet arrivals of In-profile traffic and Out-of-profile traffic during the next time interval. The numbers of maximum packet arrivals during the next time interval are estimated based on the buffer size determined by the network topology and the ratio of bandwidth allocated to each subclass. We can find from simulation results that proposed resource allocation scheme with Adaptive RIO can guarantee QoS and can maximize capacity for Assured Service.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.7
• /
• pp.425-432
• /
• 2014

This paper proposes a wear-leveling algorithm that exploits the properties of SSD memories with multi-channel and multi-way architecture. When a write request arrives, the proposed algorithm classifies the stored data in DRAM buffer into hot or cold according to logical address access frequency, and performs data allocation to reduce deviation of block erase counts. It lowers the chance of increasing erase count by allocating cold data to blocks which have high erase count. Effectiveness of the proposed algorithm is verified by executing various applications on a multi-channel, multi-way SSD simulator. Experimental results show that differences in erase count among blocks is reduced by an average of 9.3%, and total erase count decreases by 4.6%, when compared to previous wear-leveling algorithm.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.8 no.2
• /
• pp.1-13
• /
• 2009

Although enormous data have been collected in major cities (Korea) by APTS(Advanced Public Transit Systems), most of studies related to bus schedule management evaluation have confined to headway adherence and on-time performance. Therefore, bus operation management have been very lack of using APTS data. This study uses coefficient of correlation to evaluate bus company's schedule management level. However, direct application of coefficient of correlation has inequitable problem because of many limitation(number of vehicle, headway, etc). and so variable calibration method was developed and applied to cope with these problems. Thus, demand-elastic management evaluation index was developed. For verifying the equity of developed index, it is applied to Seoul bus routes. It is expected for the developed index to contribute into the demand-elastic management of bus schedule.

• Journal of the Korea Society for Simulation
• /
• v.23 no.4
• /
• pp.97-109
• /
• 2014

Personal rapid transit (PRT) is a new transportation system, which is energy efficient and brings high quality of customer service. Customers arrive dynamically at stations and request transportation service. In this paper, we propose a new online PRT dispatching algorithm for pickup and delivery of customers. We adopt the nearest neighbor dispatching rule, which is known as performing well in general. We extend the rule with bipartite matching in order to deal with multiple vehicles and customers at the same time. We suggest a systematic way for selecting vehicles that will be considered to be dispatched, since the scope with which vehicles are selected may affect the system performance. We regard the empty travel distance of vehicles and the customer waiting time as the performance measures. By using simulation experiments, it has been examined that the scope of dispatching affects the system performance. The proposed algorithm has been validated by comparing with other dispatching rules for transportation services. We have shown that our algorithm is more suitable for PRT operating environment than other dispatching rules.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.8 no.5
• /
• pp.187-195
• /
• 2008

In MANET, it is important to efficiently manage data objects and traffic to improve network throughput and response time. This paper proposes a connection-degree based data object search and replication scheme in mobile ad-hoc networks. In this method, information about the path data object providers is stored at the cache of a cluster header at which lots of queries arrive, so that, to reduce the load of the cluster header, replicas can be created at its neighboring nodes. The method proposes an algorithm that picks up a cluster header among mobile nodes and makes it possible to search for and utilize adaptive and up-to-date information in MANET. The method is expected to be effective since it enables access to data objects in spite of broken links among mobile nodes with an enhancement in network response time of searching and a decrease in communication costs. The efficiency of this system was verified via simulation.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.11_12
• /
• pp.717-721
• /
• 2005

With HTTP/1.0, a single request means a single HTTP connection so that the granular unit of dispatching is the same as real load. But with persistent HTTP connection, multiple requests may arrive on a single TCP connection. Therefore, a scheme that dispatches load at the granularity of individual requests constrains the feasible dispatching policies In this paper we propose a new connection dispatching polity for supporting HTTP/1.1 persistent connections in cluster-based Web servers. When the request of a base html file arrives, the dispatcher gets the subsequent load arriving on that connection using the embedded objects information. After the dispatcher stores the load information in Load Table, the dispatcher employs the connection aging strategy on live persistent connections on the passage of time. The results of simulation show about $1.7\%\~16.8\%$ improved average response time compared to existing WLC algorithm.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.5
• /
• pp.1320-1332
• /
• 1998

We propose Multiph which is a virtual topology for a reliable group communication platform on dynamic high speed network. We also define group communication primitives for transmission of messages and group management. Multiph consists of a set of nodes which are process groups and a set of edges which are the connection between nodes providing the route of messages. Processes can send and receive messages overlapped in a several multicast groups. Overlapped process organizes non-overlapped logical group, which called meta-group. Multiph guarantees ordering of messages that received at the destination group. It has no extra node that decreases system performance. Although the group has dynamic group change to leave and add process, it does not reconstruct the existing platform structure.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.11B
• /
• pp.1254-1260
• /
• 2009

This paper proposes history-aware random early detection (HRED), a modified version of RED, to lessen bandwidth monopoly by a few of stations employing multiple parallel TCP flows. Stations running peer-to-peer file sharing applications such as BitTorrent use multiple TCP flows. If those stations share a link with other stations with only a small number of TCP flows, the stations occupy most of link bandwidth leading to undesirable bandwidth monopoly. HRED like RED determines whether to drop incoming packets according to probability which changes based on queue length. However it adjusts the drop probability based on bandwidth occupying ratio of stations, thus able to impose harder drop penalty on monopoly stations. The results of simulations assuming various scenarios show that HRED is at least 60% more effective than RED in supporting the bandwidth fairness among stations and at least 4% in utilization.