• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2008년도 한국컴퓨터종합학술대회논문집 Vol.35 No.1 (B)
• /
• pp.313-317
• /
• 2008

센서 네트워크는 여러 분야에서 활용할 수 있는 기술이다. 센서 노드가 외부에서 채취한 데이터를 실시간으로 사용자에게 전달하는 것은 매우 중요하다. UC 버클리에서 개발된 TinyOS는 센서 노드에서 동작하는 운영체제 중 가장 많이 사용되고 있다. TinyOS는 Event-driven 방식이며 Component 기반의 센서 네트워크 운영체제이다. 기본적으로 비선점 방식의 스케줄러를 사용함으로써 TinyOS의 실시간성을 보장하기 어렵다. 최근 연구에서 TinyOS의 빠른 반응성을 위해 Priority Level Scheduler라는 선점 기능이 제안되었다. 여기서 본 논문은 TinyOS의 실시간성의 보장을 위해 Priority Level Scheduler에 EDF(Earliest Deadline First)를 적용한 선점형 EDF 스케줄링 방식을 제안하고자 한다.

• 산업경영시스템학회지
• /
• 제27권3호
• /
• pp.26-30
• /
• 2004

We consider an AS/RS(Automated Storage/ Retrieval System) which performs both of single and dual commands. The service times of single and dual commands are assumed to be differently distributed. Steady-state probabilities at the service completion epochs are calculated. Then, we transform the arrival rates of storage and retrieval commands into those of single and dual commands. Using this, we propose a non-preemptive queueing model with priority for the performance analysis of an AS/RS, and obtain approximated means of queue lengths and waiting times.

• 경영과학
• /
• 제25권3호
• /
• pp.87-99
• /
• 2008

Besieged by needs for upgrading the current Internet, social pressures, and regulatory concerns, a network operator may be left with few options to Improve his services. Yet he can still consider a transition prioritizing network services. In this paper, we describe a transition from a non-priority system to a prioritized one, using non-preemptive M/G/1 model. After reviewing the constraints and theoretical results from past research, we describe steps making the transition Pareto-improving, which boils down to a multi-goal search for a Pareto-improving state. We use a genetic algorithm that captures actual transition costs along with incentive-compatible and Pareto-Improving constraints. Simulation results demonstrate that the initial post-transition solutions are typically Pareto-improving. for non Pareto-improving solutions, the heuristic quickly generates Pareto-improving and incentive-compatible solutions.

• 한국군사과학기술학회지
• /
• 제15권4호
• /
• pp.442-449
• /
• 2012

Cognitive Radio(CR) is the technology that allocates the frequency by using dynamic spectrum access. We proposed a model to calculate the optimal level of the cognitive radiotelegraph, where secondary users opportunistically share the spectrum with primary users through the spectrum sensing. When secondary user with cognitive radio detects the arrival of a primary user in its current channel, the secondary user moves to the idle channel or be placed in the virtual queue. We assume that the primary users have finite buffers and the population of secondary users is finite. Using a two-dimensional Makov model with preemptive priority queueing, we could derive the blocking and waiting probability as well as the optimal level of cognitive radiotelegraph under a various range of parameter circumstances.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2001년도 ICCAS
• /
• pp.60.3-60
• /
• 2001

Usually the static scheduling algorithms such as DMS(Deadline Monotonic Scheduling) or RMS(Rate Monotonic Scheduling) are used for CAN scheduling due to its ease with implementation. However, due to their inherently low utilization of network media, some dynamic scheduling approaches have been studied to enhance the utilization. In case of dynamic scheduling algorithms, two considerations are needed. The one is a priority inversion due to rough deadline encoding into stricted arbitration fields of CAN. The other is an arbitration delay due to the non-preemptive feature of CAN. In this paper, an extended algorithm is proposed from an existing EDS(Earliest Deadline Scheduling) approach of CAN scheduling algorithm having a solution to the priority inverstion ....

• 한국통신학회논문지
• /
• 제27권1B호
• /
• pp.1-12
• /
• 2002

멀티미디어 CDMA(code division multiple access) 이동통신 서비스는 음성, 동영상, 파일 전송, 전자 우편, 인터넷 접속 등과 같은 다양한 어플리케이션들을 이동중인 사용자들에게 각각의 요구 조건에 부합할 수 있는 QoS(quality of service)로 제공하여야 한다. 본 논문에서 고려한 시스템은 음성, 스트림 데이터 및 패킷 데이터의 혼합 트래픽 환경에서 실시간 전송을 요구하는 음성 서비스에게는 선점 우선권(preemptive priority)을 부여하고, 지연에 다소 민감하지 않은 스트림 데이터 서비스에 대해서는 버퍼를 부여하였다. 또한, 최선형(best-effort) 서비스를 받는 패킷 데이터 서비스에 대해서는 기지국의 방송 제어 신호에 의해 송신 허용 확률(transmission permission probability)을 결정함으로써 효율을 향상시킬 수 있는 접속 제어 시스템을 고려한다. 본 논문에서는 멀티미디어 CDMA 이동통신 시스템의 성능 분석을 위하여 음성 및 스트림 데이터 트래픽을 2차원-마르코프 체인으로 모델링하고 분석하였으며, 잔여 용량(residual capacity)을 기초로 하여 패킷 데이터 트래픽에 대한 수학적 분석을 수행하였다.

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

ATM was adopted as the switching and multiplexing technique for BISDN which aims at transmitting traffics with various characteristics in a unified network. To construct these ATM networks, the most important aspect is the design of the switching system with high performance and different service capabilities. In this paepr, we analyze the performance of an input and output queueing switch with preemptive priority which is considered to be most suitable for ATM networks. For the analysis of an input queue, we model each input queue as two separate virtual input queues for each priority class and we approximage them asindependent Geom/Geom/1 queues. And we model a virtual HOL queue which consists of HOL cells of all virtual input queues which have the same output address to obtain the mean service time at each virtual input queue. For the analysis of an output quque, we obtain approximately the arrival process into the output queue from the state of the virtual HOL queue. We use a Markov chain method to analyze these two models and obtain the maximum throughput of the switch and the mean queueing delay of cells. and analysis results are compared with simulation to verify that out model yields accurate results.

• 한국국방경영분석학회지
• /
• 제2권1호
• /
• pp.177-184
• /
• 1976

As the organizational size of a military service or business increases and its management becomes complex, the success in its management depends less on static type of management but more on careful, dynamic type of management. In this thesis, an operations research technique is applied to the problems of determining optimal air traffic control rule and of optimal capacity of air base for a military air base. An airport runway is regarded as the service facility in a queueing mechanism, used by landing, low approach, and departing aircraft. The usual order of service gives priority different classes of aircraft such as landings, departures, and low approaches; here service disciplines are considered assigning priorities to different classes of aricraft grouped according to required runway time. Several such priority rules are compared by means of a steady-state queueing model with non-preemptive priorities. From the survey conducted for the thesis development, it was found that the flight pattern such as departure, law approach, and landing within a control zone, follows a Poisson distribution and the service time follows an Erlang distribution. In the problem of choosing the optimal air traffic control rule, the control rule of giving service priority to the aircraft with a minimum average waiting cost, regardless of flight patterns, was found to be the optimal one. Through a simulation with data collected at K-O O Air Base, the optimal take-off interval and the optimal capacity of aircraft to be employed were determined.

• 전기전자학회논문지
• /
• 제2권1호
• /
• pp.114-121
• /
• 1998

본 논문은 기존의 이더넷 인터페이스를 통하여 ATM 셀을 전송하는 CIF(Cells in Frames)에서 네트워크 성능을 향상시키기 위한 충돌 회피(collision avoidance) 방안과 실시간 ATM 응용을 지원하기 위한 우선 제어 방안을 제안한다. 제안된 방안은 전형적인 CIF 네트워크인 두개 노드를 가진 이더넷에 적합하며, 기존 이더넷 인터페이스 카드에 대한 어떠한 하드웨어적인 수정을 필요로 하지 않는다. 충돌 회피 방안은 CIF 각 요소에 서로 다른 프레임간 간격(inter-frame gap)을 할당함으로써 출동을 최소화하면서 그 노드들로 공평한 액세스 기회를 제공한다. 우선 제어 방안은 두 노드간 큐잉 상태 정보를 교환하므로 써 매체로 실시간 프레임을 우선적으로 전송하는 것을 보장해준다. 그러므로 본 논문에서는 MAC 계층의 충돌 회피 방안과 CIF 계층의 우선 제어 방안을 모두 갖춘 CIF 네트워크가 향상된 네트워크 성능을 가지며 실 시간 ATM 응용을 효율적으로 지원한다는 것을 보여준다.

• ETRI Journal
• /
• 제29권3호
• /
• pp.259-269
• /
• 2007

The ubiquitous flexible operating system (UbiFOS) is a real-time operating system designed for cost-conscious, low-power, small to medium-sized embedded systems such as cellular phones, MP3 players, and wearable computers. It offers efficient real-time operating system services like multi-task scheduling, memory management, inter-task communication and synchronization, and timers while keeping the kernel size to just a few to tens of kilobytes. For flexibility, UbiFOS uses various task scheduling policies such as cyclic time-slice (round-robin), priority-based preemption with round-robin, priority-based preemptive, and bitmap. When there are less than 64 tasks, bitmap scheduling is the best policy. The scheduling overhead is under 9 ${\mu}s$ on the ARM926EJ processor. UbiFOS also provides the flexibility for user to select from several inter-task communication techniques according to their applications. We ported UbiFOS on the ARM9-based DVD player (20 kB), the Calm16-based MP3 player (under 7 kB), and the ATmega128-based ubiquitous sensor node (under 6 kB). Also, we adopted the dynamic power management (DPM) scheme. Comparative experimental results show that UbiFOS could save energy up to 30% using DPM.