• 한국멀티미디어학회논문지
• /
• 제22권12호
• /
• pp.1438-1446
• /
• 2019

Recently, the number of mobile users as well as high-speed Internet user has been increasing rapidly. Moreover, traffic is growing fast as services that provide real-time content such as Youtube and Netflix become popular. The problem of traffic control in real-time content services is important because many people use cell phones to receive real-time content. In this regard, the field of CCN is currently being studied. We studied the mobility of nodes among CCN research fields. Node mobility can be divided into three categories : consumer mobility, intermediate node, and provide mobility. In this paper, we propose Mobility Node Support(MD-INS) to support the intermediate-node mobility in CCN real-time services. Experimental results show that the proposed scheme shows better performance than CCN in terms of service disconnection time and packet loss.

• 한국콘텐츠학회논문지
• /
• 제17권10호
• /
• pp.587-597
• /
• 2017

최근 하드웨어의 발전으로 모바일 환경에서 리눅스나 안드로이드 같은 범용 운영체제 환경에서 실시간성의 요구가 증가하고 있으나, 범용운영체제의 경우 실시간성을 제공하지 못하는 단점이 있다. 이를 해결하기 위해 리눅스에 부가적으로 설계된 RTiK(Real-Time implanted Kernel)을 통해 실시간성을 제공할 수 있으나, 기존 RTiK의 경우 x86 아키텍처만을 제공하는 단점이 있으며, 실시간성 지원을 위해서는 CPU 플랫폼에 종속되는 한계가 있다. 본 논문에서는 CPU 플랫폼 이식을 위해 ARM 아키텍쳐를 위한 실시간 확장커널인 RTiKA(Real-Time implant Kernel for ARMLinux)을 설계 및 구현한다. 실시간성 제공을 위해 독립적인 Local APIC Timer를 대체하는 MCT 타이머를 이용하였으며, 성능 검증 및 평가를 위해 생성된 실시간 태스크의 주기를 측정하였고, 1ms 단위의 주기를 바탕으로 여러 개의 실시간 태스크에 대한 동작을 보장할 수 있었다.

• 제어로봇시스템학회논문지
• /
• 제17권1호
• /
• pp.38-46
• /
• 2011

The OPRoS (Open Platform for Robotic Service) framework provides uniform operating environment for service robots. As an OPRoS-based service robot has to support real-time as well as non-real-time applications, application of Windows NT kernel based operating system can be restrictive. On the other hand, various benefits such as rich library and device support and abundant developer pool can be enjoyed when service robots are built on Windows NT. The paper presents a user-mode component scheduler of OPRoS, which can provide near real-time scheduling service on Windows NT based on the restricted real-time features of Windows NT kernel. The component scheduler thread with the highest real-time priority in Windows NT system acquires CPU control. And then the component scheduler suspends and resumes each periodic component executors based on its priority and precedence dependency so that the component executors are scheduled in the preemptive manner. We show experiment analysis on the performance limitations of the proposed scheduling technique. The analysis and experimental results show that the proposed scheduler guarantees highly reliable timing down to the resolution of 10ms.

• 전자공학회논문지S
• /
• 제35S권1호
• /
• pp.1-13
• /
• 1998

The next generation of wireless network will be problably developed as a mobile communications which will support ATM-based multiMedium traffic. We need to develop an dffective MAC protocol in order to support multimedia traffic having variety of QoS characteristics on wireless neteworks. In this paper, we propose a MAC protocol a MAC protocol where mobile terminals having cells to transmit, request slots to base station through requested slot then the base station analyze parameters from mobile and allocate slots to mobile according to priority. The multimedia slot allocation(MSA) protocol divides multimedias applications into real-time/ variant and non real-time services. Entire slots of the frameare partitioned proportionallyby sizeof bandwidth according to types of services, so that related services can use allocated-slots in priority. The proposed algorithm guarantees real time operation since real-time service share slots allocated for non real-real services. The algorithm whih divides slots of the frame is called as an Algorithm A, otherwise as an Algorithm B. The simulation compares by average delay time and cell loss probability between Algorithm and Algorithm B by increasing number of mobile terminal using the proposed MAC protocol. the simulation result for real-time services shows that average delay time and cell loss probability of Algorithm A is better than those of Algorithm B.

• 한국멀티미디어학회논문지
• /
• 제24권1호
• /
• pp.95-105
• /
• 2021

In the case of laptops and tablet PC's that replace desktop, it uses the Windows operating system to provide various functions depending on operating system dependency, the Windows operating system does not support real-time processing because it uses multi-level feedback queue scheduling that extends round-robin scheduling. Also, since the initial value of Local APIC Counter can not be obtained from the Windows 8, the real-time processing function provided through the existing RTiK does not work. In this paper, we calculate Local APIC Counter value by using MSR_FSB_FREQ register to support real-time processing function on tablet PC's. We designed and implemented RTiK+, which provides real-time processing function to guarantee the periodicity by calculating the operation time of accurate timer. In order to verify and evaluate the performance of the implemented the RTiK+, the period was measured by using the Read Time-Stamp Counter(RDTSC) instruction and it was confirmed that it operates normally at 1ms and 0.1ms period.

• Geomechanics and Engineering
• /
• 제8권2호
• /
• pp.153-171
• /
• 2015

The observational method in tunnel engineering allows the evaluation in real time of the actual conditions of the ground and to take measures if its behavior deviates considerably from predictions. However, it lacks a consistent and structured methodology to use the monitoring data to adapt the support system in real time. The definition of limit criteria above which adaptation is required are not defined and complex inverse analysis procedures (Rechea et al. 2008, Levasseur et al. 2010, Zentar et al. 2001, Lecampion et al. 2002, Finno and Calvello 2005, Goh 1999, Cui and Pan 2012, Deng et al. 2010, Mathew and Lehane 2013, Sharifzadeh et al. 2012, 2013) may be needed to consistently analyze the problem. In this paper a methodology for the real time adaptation of the support systems during tunneling is presented. In a first step limit criteria for displacements and stresses are proposed. The methodology uses graphics that are constructed during the project stage based on parametric calculations to assist in the process and when these graphics are not available, since it is not possible to predict every possible scenario, inverse analysis calculations are carried out. The methodology is applied to the "Bois de Peu" tunnel which is composed by two tubes with over 500 m long. High uncertainty levels existed concerning the heterogeneity of the soil and consequently in the geomechanical design parameters. The methodology was applied in four sections and the results focus on two of them. It is shown that the methodology has potential to be applied in real cases contributing for a consistent approach of a real time adaptation of the support system and highlight the importance of the existence of good quality and specific monitoring data to improve the inverse analysis procedure.

• 한국콘텐츠학회:학술대회논문집
• /
• 한국콘텐츠학회 2009년도 춘계 종합학술대회 논문집
• /
• pp.845-850
• /
• 2009

분산 환경에서 이기종 시스템 간의 독립적이고 표준화된 환경을 지원하기 위해 RT-CORBA(Real-Time Common Object Request Broker Architecture) 기반의 오픈소스 TAO(The ACE ORB) 통신 미들웨어에 대한 연구가 활발해지고 있다. 실시간성 측면에서 TAO는 Windows나 Linux와 같은 범용 운영체제에서는 실시간성을 지원하지 않으며, VxWorks, LynxOS 등과 같은 실시간 운영체제에 의존하여 실시간성을 지원한다. 이에 본 논문에서는 실시간 운영체제인 VxWorks에 TAO 통신 미들웨어를 이식함으로써 TAO가 쓰레드 레벨의 실시간성을 지원할 수 있는 환경을 구축한다. 또한 TAO를 탑재한 범용 운영체제 Windows 및 Linux와의 통신을 통해 VxWorks로의 TAO 이식을 검증한다.

• Journal of information and communication convergence engineering
• /
• 제10권2호
• /
• pp.129-134
• /
• 2012

As application-specific requirements for wireless sensor networks emerge, both real-time and reliable communications become major research challenges in wireless sensor networks due to the many constraints on nodes and wireless links. To support these services, several protocols have been proposed. However, since most of them were designed as well as developed for general purpose applications, it is not recommended that they be directly adapted to applications with special requirements. In this paper, we propose a way to extend the current reliable transport protocol to cover a special real-time service, the (m,k)-firm deadline stream, in wireless sensor networks. While the proposed scheme is basically built on the PSFQ protocol for reliability, some features have been newly developed to support the (m,k)-firm stream efficiently. Finally, simulation results are given to demonstrate the feasibility of the proposed scheme in high traffic and with failed links.

• International Journal of Internet, Broadcasting and Communication
• /
• 제9권1호
• /
• pp.9-17
• /
• 2017

This paper describes a process of developing commercial real time image recognition system with company. In this paper we will make a system that is combining an empirical kernel map method and conjugate least squares support vector machine in order to represent images in a low-dimensional subspace for real time image recognition. In the traditional approach calculating these eigenspace models, known as traditional PCA method, model must capture all the images needed to build the internal representation. Updating of the existing eigenspace is only possible when all the images must be kept in order to update the eigenspace, requiring a lot of storage capability. Proposed method allows discarding the acquired images immediately after the update. By experimental results we can show that empirical kernel map has similar accuracy compare to traditional batch way eigenspace method and more efficient in memory requirement than traditional one. This experimental result shows that proposed model is suitable for commercial real time image recognition system.

• 정보기술과데이타베이스저널
• /
• 제8권2호
• /
• pp.103-114
• /
• 2001

In this paper, we propose an efficient index mechanism for real-time main memory database systems. Existing main memory index structures based on the tree can effectively support range searches. However, it doesn't guarantee the real-time characteristic because difference between the access time of a node and an average access time can be high. The index structures based on the hash have always a regular random access time on the simple searches and that speed is very fast. However they do not support range searches. To solve such problems, we propose a new index mechanism called Hyper Tree-Hash (Hyper-TH) that combines ECBH (Extendible Chained Bucket Hashing) and T＊-tree. ECBH can be dynamically extended and has a very fast access time. T＊-tree effectively supports the range searches. We show through our experiments that the proposed mechanism outperforms existing other index structures.