• 한국전자거래학회지
• /
• 제12권4호
• /
• pp.71-84
• /
• 2007

본 논문에서는 RFID를 기반으로 하는 지능형 홈 네트워크의 아키텍처를 제시하고, 이러한 홈 네트워크를 효율적으로 관리하기 위한 지능형 에이전트를 제시한다. 이 에이전트는, 에이전트 내의 각 모듈이 수행하는 작업을 총괄하여 관리하는 에이전트 관리자, RFID 리더기를 통하여 홈 가전기가로부터 데이터를 수집하는 데이터 수집기, 홈 네트워크의 상황에 따른 오퍼레이션을 결정하고, 결정된 오퍼레이션을 해당 가전기기로 전달하는 실행 제어기, 에이전트가 오퍼레이션을 수행하는데 필요한 데이터를 저장하는 데이터 저장소, 홈 가전기기로부터 수집한 데이터를 임시적으로 저장하는 데이터 큐, 사용자가 에이전트를 통하여 홈 네트워크를 직접 제어하거나 모니터링 할 수 있도록 하는 사용자 인터페이스의 여섯 개의 모듈로 구성된다. 이 에이전트는 홈 네트워크 내의 가전기기에 대한 상태 정보를 분석하여 자율적으로 홈 네트워크 내의 상황을 학습하고, 사용자의 성향에 맞도록 가전기기를 제어한다. 따라서 지능형 에이전트를 통하여 홈 네트워킹을 수행한다며 사용자는 직접 모든 가전기기를 제어하지 않더라도 자신의 성향에 맞는 홈 환경에서 생활할 수 있다.

• 한국경영과학회지
• /
• 제20권2호
• /
• pp.159-178
• /
• 1995

Supervisory control is an approach based on formal language. it is used to model and control discrete event systems in which each discrete event process is represented as an automation. A supervisor is a generator that switches control patterns in such a way that a given discrete evenet process behaves in obedience to various constraints. A flexible manufacturing cell (FMC) is one of discrete evenet systems. Functions necessary for the operation of an FMC are characterized by operational components and informational compoments. The operational components can be modeled using the finite state machines and the informational components can be modeled using the abstract formalism which describes supporting operations of the cell controller. In this paper, we addressed function required for FMC control specification, software engineering aspects on FMC control based on supervisory control, a concept of event queue for resolving synchronization problem, and complexity reduction. Based on the mathematical model of an FMC. we synthesized the controller by integrating a supervisor for FMC with control specification that specifies event-driven operation of the cell controller. The proposed control scheme is stable mathematically so that the system always behaves on a controlled way even under the existence of uncontrollable events. Furthermore, using an event queue concept, we can solve a synchronization problem caused by the violation of instantaneity assumption of supervisory control theory in real life situation. And also, we can propotype a control software rapidly due to the modularity of the proposed control scheme.

• 대한산업공학회지
• /
• 제20권4호
• /
• pp.73-84
• /
• 1994

Output analysis is one of the most important fields of simulation to achieve the accurate simulation results. This study shows how to analyze simulation output data in the steady state using Procrustes analysis technique which has not been used in the field of simulation yet. In this paper Procrustes analysis method is used to perform the analysis of simulation output efficiently and effectively by applying the improved version of the method. The experiments are conducted using M/M/1 queueing simulation model. The results obtained by Procrustes analysis method show better estimates for average waiting times and average queue lengths which are closer to true values and narrower confidence intervals than when replication-deletion method is used. Also it requires the smaller number of simulation runs.

• ETRI Journal
• /
• 제30권2호
• /
• pp.301-307
• /
• 2008

As broadband access is evolving from digital subscriber lines to optical access networks, Ethernet passive optical networks (EPONs) are considered a promising solution for next generation broadband access. The point-to-multipoint topology of EPONs requires a time-division multiple access MAC protocol for upstream transmission. In this paper, we propose a new enhanced dynamic bandwidth allocation algorithm with fairness called EFDBA for multiple services over EPONs. The proposed algorithm is composed of a fairness counter controller and a fairness system buffer in the optical line terminal. The EFDBA algorithm with fairness can provide increased capability and efficient resource allocation in an EPON system. In the proposed EFDBA algorithm, the optical line termination allocates bandwidth to the optical network units in proportion to the fairness weighting counter number associated with their class and queue length. The proposed algorithm provides efficient resource utilization by reducing the unused remaining bandwidth made by idle state optical network units.

• 한국경영과학회지
• /
• 제24권4호
• /
• pp.111-122
• /
• 1999

In this paper, we consider a queueing network model. where the population constraint within each subnetwork is controlled by a semaphore queue. The total number of customers that may be present in the subnetwork can not exceed a given value. Each node has a constant service time and the arrival process to the queueing network is an arbitrary distribution. A major characteristics of this model is that the lower layer flow is halted by the state of higher layer. We present some properties that the inter-change of nodes does not make any difference to customer's waiting time in the queueing network under a certain condition. The queueing network can be transformed into a simplified queueing network. A dramatic simplification of the queueing network is shown. It is interesting to see how the simplification developed for sliding window flow control, can be applied to multi-layered queueing network.

• 한국콘텐츠학회:학술대회논문집
• /
• 한국콘텐츠학회 2007년도 추계 종합학술대회 논문집
• /
• pp.197-200
• /
• 2007

동적 전력 관리는 서로 다른 전력소모를 갖는 전력상태들을 시스템 구성 요소에 할당하고 상황별로 전력상태를 관리함으로써 시스템의 전력 소모를 현저하게 줄여줄 수 있다. 전력관리의 주 기능은 구성요소의 상태천이를 언제 수행하느냐 이며 이를 위하여 추계적 프로세스에 기반한 동적 전력관리 모델을 개발한다. 동적 모델은 시스템 큐와 다양한 모델링 기능을 표현할 수 있는 페트리 네트의 확장형인 SRN(Stochastic Reward Nets)을 이용하여 개발되며 성능분석을 함께 수행한다.

• 한국통신학회논문지
• /
• 제30권9A호
• /
• pp.762-771
• /
• 2005

In this paper, an efficient Adaptive quality-of-service (QoS) traffic control scheme with priority scheduling is proposed for the multimedia traffic transmission over wireless access networks. The objective of the proposed adaptive QoS control (AQC) scheme is to realize end-to-end QoS, to be scalable without the excess signaling process, and to adapt dynamically to the network traffic state according to traffic flow characteristics. Here, the reservation scheme can be used over the wireless access network in order to get the per-flow guarantees necessary for implementation of some kinds of multimedia applications. The AQC model is based on both differentiated service model with different lier hop behaviors and priority scheduling one. It consists of several various routers, access points, and bandwidth broker and adopts the IEEE 802.1 le wireless radio technique for wireless access interface. The AQC scheme includes queue management and packet scheduler to transmit class-based packets with different per hop behaviors (PHBs). Simulation results demonstrate effectiveness of the proposed AQC scheme.

• 한국통신학회논문지
• /
• 제35권8A호
• /
• pp.828-834
• /
• 2010

In this paper, an adaptive cross-layer resource allocation algorithm for the downlink multi-user OFDM system is proposed. The proposed algorithm does not only concern the wireless characteristics of physical (PHY) layer, but also pays attention to the user's quality of service (QoS) requirement, fairness, and packet queue state information of medium access control (MAC) layer. The algorithm is composed of two parts: one is to decide the priority of the user, and the other is to assign the radio resource according to its priority. Simulation results show that the proposed algorithm has both steady QoS and low computation complexity, even though the mobile users have different receiving signal to noise ratio (SNR).

• 산업경영시스템학회지
• /
• 제26권2호
• /
• pp.62-67
• /
• 2003

This paper deals with a First-Come, First-Served queueing model to analyze the behavior of heterogeneous finite source system with a single server Each sources and the processor are assumed to operate in independently Markovian environments, respectively. Each request is characterized by its own exponentially distributed source and service time with parameter depending on the state of the corresponding environment, that is, the arrival and service rates are subject to random fluctuations. Our aim is to get the usual stationary performance measures of the system, such as, utilizations, mean number of requests staying at the server, mean queue lengths, average waiting and sojourn times. In the case of fast arrivals or fast service asymptotic methods can be applied. In the intermediate situations stochastic simulation Is used. As applications of this model some problems in the field of telecommunications are treated.

• East Asian mathematical journal
• /
• 제24권1호
• /
• pp.45-55
• /
• 2008

We consider an M/G/1 queue with $P^M_{\lambda}$-service policy, which is a two-stage service policy. The server starts to serve with rate 1 if a job arrives to the sever in idle state. If the workload of the system upcrosses $\lambda$, then the service rate is changed to M and this rate continues until the system is empty. It costs to change the service rate to M and maintaining the rate. When the expectation of the stationary workload is supposed to be less than a given value, we derive the optimal value of M.