• Journal of Korean Port Research
• /
• v.11 no.2
• /
• pp.321-337
• /
• 1997

Rapid change in the technological environment of marine transportation and the development of the ocean shipping industry have fostered a revolution in the port system. This in turn has caused major changes in the function and use of port in Korea. Aside from this. Mokpo Port, however continues to decline, because the existing port facilities and related subsystem are already obsolete with no chance of regaining operational effectiveness and treatment for proper implementation. Although a few studies have been done on the Mokpo Port, has not been found, any reseach for the analytical approach to the transportation system of it. This paper aims to make an extensive analysis of the physical distribution system in Mokpo Port focusing on the coordination of subsystems such as navigational aids system, quay handling and transfer system, storage system and inland transport system. The base of introduced simulation tool here is the queueing theory. The overall findings are as follows; 1. Among those vessels called at Mokpo Port in 1994, the average size of oceangoing vessels is 4,922.1 G/T, and the domestic is 317.8 G/T. The average arrival interval and service time of the domestic vessels are 6.0 hours and 24.1 hours respectively marking the berth occupation rate over 100%. Those for oceangoing vessels are 34.5 hours, 120.0 hours and 37.2%. In order to maintainin the berth occupation rate to 70% the capacity considering the 1994 of domestic piers must be extended to 145% and oceangoing vessels must be increased to 165% year called. 2. The capacity of approaching channel is enough to handle the total traffic volume. 3. Tugs are sufficiently being provided to handle all ships requiring their services 4. The capacity of storage and inland transportation systems are sufficient to handle the throughput and the yard stroage utilization rate of No.1 $\cdots$ No.5 is 4.5% and No.6 1S 30% of 1993's. 5. The utilization rate of LLc(Level Looping Crane) and PNT(PNeumaTic) are 2.7% and 18.8%, respectively. Practical solution and proposal for improvement of Transportation System in Mokpo Port are as follows; 1. To avoid the congestion in domestic pier introduction of a new port operation system is necessary allowing the domestic vessel to use the oceangoing pier. 2. To establish the port management information system to improve the efficiency of port operation. 3. To build a new storage system for high valued cargos including modernization of the present storage and handling system. 4. To insure the safety of navigation in approaching channel, The Vessel Traffic System including separation scheme is introduced. 5. To interest enormously on public relation to ship owner's association, shippers and consignees by showing that they can save cost and ship turnaround time in order to promote the call to Mokpo Port. At last, to be strategically change the function of Mokpo Port to the Leisure, Fishing & Ferry as well as Maritime port.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.8A
• /
• pp.1134-1143
• /
• 2000

We propose a scheduling algorithm, Bandwidth Allocation Scheme (BAS), that guarantees bounded delay in a switching node. It is based on the notion of the GPS (Generalized Processor Sharing) mechanism, which has clarified the concept of fair queueing with a fluid-flow hypothesis of traffic modeling. The main objective of this paper is to determine the session-level weights that define the GPS sewer. The way of introducing and derivation of the so-called system equation' implies the approach we take. With multiple classes of traffic, we define a set of service curves:one for each class. Constrained to the required profiles of individual service curves for delay satisfaction, the sets of weights are determined as a function of both the delay requirements and the traffic parameters. The schedulability test conditions, which are necessary to implement the call admission control, are also derived to ensure the proposed bandwidth allocation scheme' be able to support delay guarantees for all accepted classes of traffic. It is noticeable that the values of weights are tunable rather than fixed in accordance with the varying system status. This feature of adaptability is beneficial towards the enhanced efficiency of bandwidth sharing.

• Journal of Korea Multimedia Society
• /
• v.2 no.3
• /
• pp.329-338
• /
• 1999

In this paper we propose a WATM MAC protocol called DTDD/PS (Dynamic Time Division Duplex using Poll/Select scheme). The idea of the DTDD/PS protocol is based that a radio cell is considered as queueing system. The MAC controller in base station is charged in coordinating terminals for the QoS requirement from each terminal. For that reason, terminals send it's own dynamic parameter represented its status, and controller controls the access of terminals and assigns time slots dynamically using received parameters. Therefore this system can satisfy the QoS of real-time service in wireless environments. To evaluate DTDD/PS protocol simulations are executed. In 25Mbps channel capacity, the voice and data coexist traffic situation, as the total number of terminal is increased, the delay of data terminals is increased rapidly. But the case of only increasing data terminals, the number of supported voice terminals is not varying. Therefore we can expect that DTDD/PS protocol can applied to multimedia traffic effectively.

• International Journal of Contents
• /
• v.13 no.2
• /
• pp.29-34
• /
• 2017

Cloud computing is becoming an effective and efficient way of computing resources and computing service integration. Through centralized management of resources and services, cloud computing delivers hosted services over the internet, such that access to shared hardware, software, applications, information, and all resources is elastically provided to the consumer on-demand. The main enabling technology for cloud computing is virtualization. Virtualization software creates a temporarily simulated or extended version of computing and network resources. The objectives of virtualization are as follows: first, to fully utilize the shared resources by applying partitioning and time-sharing; second, to centralize resource management; third, to enhance cloud data center agility and provide the required scalability and elasticity for on-demand capabilities; fourth, to improve testing and running software diagnostics on different operating platforms; and fifth, to improve the portability of applications and workload migration capabilities. One of the key features of cloud computing is elasticity. It enables users to create and remove virtual computing resources dynamically according to the changing demand, but it is not easy to make a decision regarding the right amount of resources. Indeed, proper provisioning of the resources to applications is an important issue in IaaS cloud computing. Most web applications encounter large and fluctuating task requests. In predictable situations, the resources can be provisioned in advance through capacity planning techniques. But in case of unplanned and spike requests, it would be desirable to automatically scale the resources, called auto-scaling, which adjusts the resources allocated to applications based on its need at any given time. This would free the user from the burden of deciding how many resources are necessary each time. In this work, we propose an analytical and efficient VM-level scaling scheme by modeling each VM in a data center as an M/M/1 processor sharing queue. Our proposed VM-level scaling scheme is validated via a numerical experiment.

• The Journal of the Korea Contents Association
• /
• v.10 no.6
• /
• pp.80-90
• /
• 2010

In this paper, we introduce some issues to implement an agent system to support service mobility in home network environment, and describe detailed design method in terminal as well as server agent. Specifically, we describe user recognition module, signaling message receiving/parsing module of terminal agent and signaling message receiving/parsing module, multimedia switching module, memory management module of server agent. We define several parameters managed in IP sharing device and design binding table structure to support mobility. And we utilize M/M/1/K queueing theory to obtain relations between memory size, blocking probability and memory utilization. From the obtained results, we show that memory size can be predicted in server agent mounted on IP sharing device.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.10C
• /
• pp.1469-1483
• /
• 2004

We propose a packet scheduling algorithms for streaming media. We assume that the receiver periodically reports back the channel throughput. From the original video data, the importance level of a video packet is determined by its relative position within its group of pictures, taking into account the motion-texture discrimination and temporal scalability. Thus, we generate a number of nested substreams. Using feedback information from the receiver and statistical characteristics of the video, we model the streaming system as a queueing system, compute the run-time decoding failure probability of a Same in each substream based on effective bandwidth approach, and determine the optimum substream to be sent at that moment in time. Since the optimum substream is updated periodically, the resulting sending order is different from the original playback order. From experiments with real video data, we show that our proposed scheduling scheme outperforms the conventional sequential sending scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.4
• /
• pp.750-760
• /
• 1994

In this paper we proposed a multiplexing scheme of real time and non-real traffics in which a congestion control is embedded. Real time traffics are assumed to be nonqueuable and have preemptive priority over non-real time traffics in seizing the common output link, whereas the non-real time traffics wait in the common buffer if the output link is not available for transmission. Real time traffics are encoded according to the bandwidth reduction strategy, paticularly when congestion occurs among non-real time traffics. This scheme provides us an efficient way for utilizing the costly bandwidth resources, by accommodation as many real time traffics as possible with gauranteeing its mimimum bandwidth requirements, and also resloving the congestion encountered among non-real time traffics. We describe the system as a Markov queueing system, provide the analysis by exploiting the matrix geometric method, and present the performance for various performance measures of interest. Some numerical results are also provided.

• 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 Korean Society of Transportation
• /
• v.15 no.1
• /
• pp.175-192
• /
• 1997

첨단 교통정보 시스템(ATIS)의 핵심요소라고 할 수 있는 동적경로안내 시스템 (Dynamic Route Guidance System)은 운전자가 목적지에 도착하기까지 실시간 교통정보를 토대로 최적경로를 안내해줌으로써 날로 심화되고 있는 교통혼잡을 최소화 할 수 있으리라 기대를 모으고 있다. 특히 교통사고나 긴급 도로공사 등으로 인해 발생하는 돌발적 교통혼잡하에서는 DRGS의 역할이 더욱 커질 것으로 예상되고 있다. 본 논문은 돌발적 교통혼잡하에서 보다 효과적인 DRGS의 경로안내 전략을 수립하고 평가하는데 그 목적이 있다. 이를 위해 우선 하부구조기반 DRGS와 개인차량기반 DRGS의 장단점을 비교하고 시스템 아키텍쳐와 경로안내전략의 관계를 규명하였다. 또한 효율적인 경로안내를 위해 사용자평형 (User Equilibrium) 경로안내전략과 시스템 최적화(System Optimal) 경로안내 전략을 이상형교통망 (Idealized Network)을 통해 비교 분석하였다. 그리고 돌발적 교통 혼잡하에서 사용자평형 경로 안내를 사용할 경우 야기될 수 있는 Braess Paradox 문제와 시스템 최적경로안내를 사용할 경우 일어날 수 있는 사용자 호응도(User Compliance) 문제를 동시에 감안한 적응 형 경로안내 전략을 개발하였다. 이 방법은 위의 경로 안내 전략들이 가지고 있는 장단점을 상황에 따라 평가하여 경로안내 전략을 선택하는 과정을 수행시간을 절약하지 못할 것으로 평가되면 사용자 호응도를 고려하여 사용자 평형 전략을 선택하도록 하였다. 돌발적 교통 혼잡하에서 통행 시간을 동적으로 예측하기 위해서는 이산 확정적 대기행렬모형 (Discrete Deterministic Queueing Model)이 적용되었다. 한편, 적응형 전략의 효율성을 평가하기 위 해 이상형교통망과 실제 미국 Virginia 주의 Fairfax Country에 소재한 주간 고속도로 66번 과 인접 교통망을 대상으로 각종 돌발교통혼잡상황을 전제로 한 Traffic Simulation과 정보 제공 시나리오를 INTEGRATION Model을 사용하여 실행하였다. 그 결과 적응형전략이 단지 사용자평형 경로안내전략만 사용하는 경우에 비해 교통 혼잡도와 유고상황의 체류정도에 따라 3%에서 10%정도까지 전체통행시간을 절약할 수 있다는 결론을 얻었다.

• Journal of the Korea Society for Simulation
• /
• v.25 no.3
• /
• pp.117-123
• /
• 2016

This paper presents inference methods for inner operations of a multi-server queue when historical data are limited or system observation is restricted. In a queueing system analysis, autocorrelated arrival and service processes increase the complexity of modeling. Accordingly, numerous analysis methods have been developed. In this paper, we introduce an inference method for specific situations when external observations exhibit autocorrelated structure and and observations of internal operations are difficult. We release an assumption of the previous method and provide lemma and theorem to guarantee the correctness of our proposed inference method. Using only external observations, our proposed method deduces the internal operation of a multi-server queue via non-parametric approach even when the service times are autocorrelated. The main internal inference measures are waiting times and service times of respective customers. We provide some numerical results to verify that our method performs as intended.