• Proceedings of the Korean Society of Computational and Applied Mathematics Conference
• /
• 2003.09a
• /
• pp.13.1-13
• /
• 2003

The Markovian arrival process with marked transitions (MMAP) is useful in modeling input processes of stochastic system with several types. Especially, the MMAP can be used to model the phenomena where the correlation of different types is considered. In this talk we discuss modeling issues for the queue with three types of customers; ordinary customers, negative customers and disasters which are correlated by using MMAP. We also present the recent results and further studies.

• Bulletin of the Korean Mathematical Society
• /
• v.43 no.2
• /
• pp.277-292
• /
• 2006

We consider a single-server queue with service time distribution of phase type where positive customers, negative customers and disasters arrive according to a Markovian arrival process with marked transitions (MMAP). We derive simple formulae for the stationary queue length distributions. The Laplace-Stieltjes transforms (LST's) of the sojourn time distributions under the combinations of removal policies and service disciplines are also obtained by using the absorption time distribution of a Markov chain.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2012.11a
• /
• pp.264-267
• /
• 2012

늘어가는 자원의 사용과 데이터의 양에 따라 클라우드 시스템의 사용이 대두되고 있는 가운데, 클라우드 환경에서 가상 머신을 효율적으로 사용하는 방법에 대한 많은 기법이 제시되고 있다. 이 중 하나가 호스트 머신 메모리 사용의 오버커밋먼트를 방지하는 것인데 가상 머신들끼리 되도록 같은 파일을 메모리 사상해서 사용하자는 것이다. 이 때 사용한 mmap() 함수는 스토리지 스택을 사용하지 않고 I/O를 할 수 있는 등의 장점을 가지고 있지만 확장성이 떨어진다는 단점이 있다. 본 논문에서는 가상머신들이 mmap()을 사용해서 호스트 메모리를 접근할 때 발생하는 문제점을 짚어보고 이것을 해결할 수 있도록 새로운 mmap() I/O path를 제안한다. 개선된 mmap() I/O path는 수행시간을 40% 가량 향상 시켰다.

• Proceedings of the Korean Society for Quality Management Conference
• /
• 2004.04a
• /
• pp.499-502
• /
• 2004

Multi-server Markovian retrial model with heterogeneous servers is analyzed. Arriving customers constitute the MMAP(Marked Markovian Arrival Process). Distribution of the primary customers among the servers is performed randomly depending on the type of a customer and the number of the server. Customers from the orbit have the exponential service time distribution with a parameter depending on the server only. The choice of the server for a retrial is made randomly as well. Multidimensional continuous time Markov chain describing operation of the model is investigated by means of reducing to asymptotically quasi-toeplitz Markov chaius.

• Journal of Internet Computing and Services
• /
• v.16 no.2
• /
• pp.1-6
• /
• 2015

In this paper, we designed an embedded audio video bridging (AVB) platform based on IEEE 802.1BA for real-time multimedia transmission in smart-car, smart-home, smart-theater, and then evaluated a performance of the implemented platform by analysis of IEEE 802.1AS (time synchronization protocol) and IEEE 802.1Qat (stream reservation protocol). Especially, the AVB Layer-2 protocol of MRP(Multiple Registration Protocol), MMAP(Multicast Address Acquisition Protocol), IEEE 1722, 1722.1 etc. was and implemented by linux based operating system. It is shown by interoperability tests with commercial products that the implemented platform transmits real-time multichannel AV data over AVB networks for Multichannel Multimedia Transmission.

• Journal of the Korea Society for Simulation
• /
• v.13 no.3
• /
• pp.1-10
• /
• 2004

The cell loss probability required in the ATM network is in the range of 10$^{-9}$ ∼10$^{-12}$ . If Monte Carlo simulation is used to analyze the performance of the ATM node, an enormous amount of computer time is required. To obtain large speed-up factors, importance sampling may be used. Since the Markov-modulated processes have been used to model various high-speed network traffic sources, we consider discrete time single server queueing systems with Markov-modulated arrival processes which can be used to model an ATM node. We apply importance sampling based on the Large Deviation Theory for the performance evaluation of, MMBP/D/1/K, ∑MMBP/D/1/K, and two stage tandem queueing networks with Markov-modulated arrival processes and deterministic service times. The simulation results show that the buffer overflow probabilities obtained by the importance sampling are very close to those obtained by the Monte Carlo simulation and the computer time can be reduced drastically.

• The Journal of Korea Robotics Society
• /
• v.16 no.4
• /
• pp.327-335
• /
• 2021

In this paper, we propose an embedded robot system based on "ROS2 on Yocto" that can support various robots. We developed a lightweight OS based on the Yocto Project as a next-generation robot platform targeting cloud robotics. Yocto Project was adopted for portability and scalability in both software and hardware, and ROS2 was adopted and optimized considering a low specification embedded hardware system. We developed SLAM, navigation, path planning, and motion for the proposed robot system validation. For verification of software packages, we applied it to home cleaning robot and indoor delivery robot that were already commercialized by LG Electronics and verified they can do autonomous driving, obstacle recognition, and avoidance driving. Memory usage and network I/O have been improved by applying the binary launch method based on shell and mmap application as opposed to the conventional Python method. Finally, we verified the possibility of mass production and commercialization of the proposed system through performance evaluation from CPU and memory perspective.