• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 1999.10a
• /
• pp.91-99
• /
• 1999

In Pusan Harbour, new port development projects are implemented such as the Extended Terminal adjacent to the Gamman Terminal, Pusan New Port, the Nary $\infty$ piers, etc. which will require new marine traffic environments in the Passage I of Pusan Harbour Specially, the turning basin of the Extended Terminal adjacent to the Gamman Terminal gas been designed to overlay the Passage I of Pusan Harbour, Which will interrupt the inbound traffic flow and the results will be worried to decrease the efficiency of port operation. Therefore, this paper will be aimed to evaluate the traffic congestion in the Pusan Passage I due to the opening of new ports within Pusan Harbour in 2006 and 2011 by using computer simulation based the queueing theory.

• The KIPS Transactions:PartD
• /
• v.10D no.6
• /
• pp.961-970
• /
• 2003

In data broadcasting environments, the server periodically broadcasts data items in the broadcast channel. When each client wants to access any data item, it should monitor the broadcast channel and wait for the desired item to arrive. Client data caching is a very effective technique for reducing the time spent waiting for the desired item to be broadcastted. This paper proposes a new client cache management scheme, named LRU-CFP, to reduce this waiting time ans evaluates its performance on the basis of a simulation model. The performance results indicate that LRU-CFP scheme shows superior performance over LRU, GRAY and CF in the average response time.

• The Journal of Information Technology
• /
• v.5 no.4
• /
• pp.9-21
• /
• 2002

In data broadcasting environments, the server periodically broadcasts data items in the database through the broadcast channel. When each client wants to access any data item, it should monitor the broadcast channel and wait for the desired item to arrive. Client data caching is a very effective technique for reducing the time spent waiting for the desired item to be broadcasted. This paper proposes a new client cache management scheme, named 2Q-CF, to reduce this waiting time and evaluate its performance on the basis of a simulation model. The performance results indicate that 2Q-CF scheme shows superior performances over LRU-CF and CF in the average response time.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.05a
• /
• pp.120-122
• /
• 2015

In this paper, we proposed an algorithm of the unnecessary copied message inhibition using dynamic density what is called DDIM(Dynamic Density-based Inhibited Message diffusion) in DTNs(Delay Tolerant Networks). Existing DTN routing algorithms as Epidemic and Spray and Wait have some problems that occur large overhead in dense network due to the thoughtless message diffusion. Our proposed method, the DDIM, determines adjusted number of copied message through dynamic node density that is calculated using node's radio coverage and neighbor nodes in period time to solve message diffusion problem. It decrease overhead without losing message delivery ratio and increased latency through reducing message diffusion. In this paper, we compare delivery ratio, average latency and overhead of proposed algorithm, DDIM, and existing DTN routing algorithm and prove enhanced performance through simulation results.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.1
• /
• pp.17-27
• /
• 2012

Broadcast-based data dissemination has become a widely accepted approach of communication in the mobile computing environment. However, with a large set of data items, the expected delay of receiving a desired data increases due to the sequential nature of the broadcast channel. This paper explores the issue of designing proper data allocation on multiple broadcast channels to reduce this wait time, and proposes a new data allocation scheme named near optimal data allocation(NODA). The proposed scheme first partitions all data items in K group based on the theoretical lower-bound of the average expected delay to determine data items which each broadcast channel has to broadcast. Then, NODA further partitions each group of data items in B groups using extended dynamic programming algorithm to broadcast data items allocated on the same broadcast channel in different frequencies. The proposed scheme is capable of minimizing the average expected delay time since it can broadcast data items allocated on the same channel reflecting their popularities.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.2
• /
• pp.385-395
• /
• 1999

Video-On-demand system provides electronic video rental services from remote video servers on a broadband communication networks. When we assume some situation that serve the same video stream by batching, each time single video stream became available at server-end side, we face the problem that what video stream to be scheduled at what time instant. Hence, in order to manage the resource bandwidth which is different at each stream, the policy of channel allocation became important factor. In this work, we proposed three type of scheduling policies with queueing, as are cumulative Waiting Time(CWT), Mean Waiting Time(MWT) and Predictable Popular Factor(PPF). While CWT policy is good for popular video, MWT policy was good for non-popular video. Also, we know that PPT policy has some fairness for average wait time and reneging rate of user requests.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.2
• /
• pp.111-118
• /
• 2008

In this paper a novel medium access control mechanism is investigated as a means to support real-time services. The primary goal is to provide constant-bit-rate voice call services to pairs of autonomous mobile nodes operating in ad hoc networks. Here, a time-slot reservation based MAC is considered to provide real-time voice calls and a new MAC called the time-slot reservation coordination function(TRCF) is presented. In addition to this isochronous type MAC protocol development, the proposed protocol is modeled using a Markov chain in order to predict its behavior. The performance of TRCF is analytically derived and the performance measures such as average wait time taken for a call connection and throughput are obtained.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.10
• /
• pp.3945-3964
• /
• 2015

Since the decentralized structure and the blindness of a large-scale wireless network make it difficult to collect the real-time channel state or other information from random distributed relays, a fundamental question is whether it is feasible to perform the relay selection without this knowledge. In this paper, a Slotted ALOHA based Greedy Relay Selection (SAGRS) scheme is presented. The proposed scheme allows the relays satisfying the user's minimum transmission request to compete for selection by randomly accessing the channel through the slotted ALOHA protocol without the need for the information collection procedure. Moreover, a greedy selection mechanism is introduced with which a user can wait for an even better relay when a suitable one is successfully stored. The optimal access probability of a relay is determined through the utilization of the available relay region, a geographical region consisting of all the relays that satisfy the minimum transmission demand of the user. The average number of the selection slots and the failure probability of the scheme are analyzed in this paper. By simulations, the validation and the effectiveness of the SAGRS scheme are confirmed. With a balance between the selection slots and the instantaneous rate of the selected relay, the proposed scheme outperforms other random access selection schemes.

• Journal of Korean Port Research
• /
• v.5 no.2
• /
• pp.19-37
• /
• 1991

This work aims to : establish a model of the container physical distribution system of Pusan port comprising 4 sub-systems of a navigational system, on-dock cargo handling/transfer/storage system, off-dock CY system and an in-land transport system : examine the system regarding the cargo handling capability of the port and analyse the cost of the physical distribution system. The overall findings are as follows : Firstly in the navigational system, average tonnage of the ships visiting the Busan container terminal was 33,055 GRT in 1990. The distribution of the arrival intervals of the ships' arriving at BCTOC was exponential distribution of $Y=e^{-x/5.52}$ with 95% confidence, whereas that of the ships service time was Erlangian distribution(K=4) with 95% confidence, Ships' arrival and service pattern at the terminal, therefore, was Poisson Input Erlangian Service, and ships' average waiting times was 28.55 hours In this case 8berths were required for the arriving ships to wait less than one hour. Secondly an annual container through put that can be handled by the 9cranes at the terminal was found to be 683,000 TEU in case ships waiting time is one hour and 806,000 TEU in case ships waiting is 2 hours in-port transfer capability was 913,000 TEU when berth occupancy rate(9) was 0.5. This means that there was heavy congestion in the port when considering the fact that a total amount of 1,300,000 TEU was handled in the terminal in 1990. Thirdly when the cost of port congestion was not considered optimum cargo volume to be handled by a ship at a time was 235.7 VAN. When the ships' waiting time was set at 1 hour, optimum annual cargo handling capacity at the terminal was calculated to be 386,070 VAN(609,990 TEU), whereas when the ships' waiting time was set at 2 hours, it was calculated to be 467,738 VAN(739,027 TEU). Fourthly, when the cost of port congestion was considered optimum cargo volume to be handled by a ship at a time was 314.5 VAN. When the ships' waiting time was set at I hour optimum annual cargo handling capacity at the terminal was calculated to be 388.416(613.697 TEU), whereas when the ships' waiting time was set 2 hours, it was calculated to be 462,381 VAN(730,562 TEU).

• Archives of Reconstructive Microsurgery
• /
• v.5 no.1
• /
• pp.137-146
• /
• 1996

There has been no general agreement about optimal time for nerve surgery in the closed brachial plexus injury(BPI). From our early experiences, we knew by chance that spontaneous recovery in BPI patients may begin even later than 8 months after injury. Authors' strategy, which was based on our early experiences, for the treatment of closed fresh injury was 'wait and see' unlit 8 months after injury. From 1985 to 1994, we observed 103 patients with BPI. All of them did not have any operation until 8 months after injury. There were 95 men and 8 women with a mean age of 29 years. Motorcycle injury(31%) and vehicle accident(28%) were main causes of injury. Whole plexus types were observed in 56 patients(54%), upper plexus types in 29(28%), lower plexus types in 3(3%), and infraclavicular types in 15(15%). Electromyography was performed in all patients. This was repeated every three months to detect the recovery. Results were evaluated by authors' criteria, in which AMA system of brachial plexus impairment was modified. Duration of follow up was average 25 months. 47 patients(46%) showed spontaneous improvement, which was initially detected at average 7.8 months(range,3 months-16 months) after trauma by electromyography. The average score of these 47 patients improved from 14.8 points to 39.8 points.31 patients(30%) had nerve surgery such as nerve graft, neurotization or neurolysis. Average duration from injury to nerve surgery, was 10 months. Among 31 patients who had nerve surgery, 16 patients improved from preoperative 21.5 points to postoperative 36.3 points in average. Because spontaneous recovery began in average 7.8 months after injury, we think that it would be better to 'wait and see' for at least one year in patients with closed BPI expecting spontaneous recovery.