• 한국정보통신학회논문지
• /
• 제20권5호
• /
• pp.1013-1019
• /
• 2016

본 논문에서는 Delay Tolerant Network(DTN)에서 Markov chain으로 노드의 속성 정보를 분석하여 노드의 이동경로를 예측하는 알고리즘을 제안한다. 기존 DTN에서의 예측기반 라우팅 기법은 노드가 미리 정해진 스케줄에 따라 이동하게 된다. 이러한 네트워크에서는 스케줄을 예측할 수 없는 환경에서 노드의 신뢰성이 낮아지는 문제가 있다. 본 논문에서는 이러한 문제를 극복하기 위해 노드의 속성 정보를 Markov chain을 적용하고 일정 구간에서 시간에 따른 노드의 이동 경로를 예측하는 CMCP(Context-awareness Markov-Chain Prediction)알고리즘을 제안한다. 제안하는 알고리즘은 노드의 속성 정보 중 노드의 속력과 방향성을 근사한 후 Markov chain을 이용하여 제한된 주기와 버퍼의 범위에서 확률전이 매트릭스를 생성하여 노드의 이동 경로를 예측하는 알고리즘이다. 주어진 모의실험 환경에서 노드의 이동 경로 예측을 통해 중계 노드를 선정하여 라우팅 함으로써 메시지 전송 지연 시간이 감소하고 전송률이 증가함 보여주고 있다.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2003년도 ICCAS
• /
• pp.2164-2168
• /
• 2003

Real time control system such as in factory automation fields, defense field, aerospace, railway industries, financial trading and so forth, includes multiple computers on multiple nodes, and share data to process various actions and functions. This is similar to multitasking in a multiprocessor computer system. The task processing efficiency of such system is proportionally increased by process speed of each process computer. And also it is greatly influenced by communication latencies of each node. To provide proper operation of such real time system, a network that can guarantee deterministic exchange of certain amount of data within a limited time is required. Such network is called as a real time network. As for modern distributed control system, the timeliness of data exchange gives important factor for the dynamics of entire control system. In a real time network system, exchanged data are determined by off-line design process to provide the timeliness of data. In other word, designer of network makes up a network data table that describes the specification of data exchanged between control equipments. And by this off-line design result, the network data are exchanged by predetermined schedule. First, this paper explains international standard real time network TCN (Train Communication Network) applied to the KHST (Korean High Speed Train) project. And then it explains the computer program developed for design tool of network data table of TCN.

• 한국정보통신학회논문지
• /
• 제4권5호
• /
• pp.1037-1050
• /
• 2000

오늘날의 통신서비스들은 음성이나 데이터 서비스와 같은 전통적인 서비스뿐만 아니라 비디오 서비스와 같은 대량의 데이터를 전송해야만 하는 멀티미디어 서비스를 포함한다. 이러한 요구를 수용하기 위해서 BISDN(Broadband Integated Services Digital Network)이 개발되었고 이의 기반 기술로 ATM이 채택되었다. 다양한 멀티미디어 응용들 중에서 VOD(Video On Demand), 화상회의등은 데이터를 동시에 여러 목적지로 보내는 멀티캐스트 특성이 있다. 그러므로 멀티캐스트 능력은 멀티미디어 통신에서 매우 중요하다. 본 논문에서는 링망을 이용한 병렬 멀티캐스트 패킷스위치(Parallel Multicast Packet Switch with Ring Network: PMRN)에서의 분리된 HOL을 이용한 멀티캐스트 셀 스케줄링 기법을 제안한다. 이 기법은 입력버퍼의 앞단 에 멀티캐스트 셀과 유니캐스트 셀을 위한 분리된 HOL을 두고 non-FIFO방식을 사용함으로서 입력버퍼 내에서 전송 가능한 멀티캐스트 셀과 유니캐스트 셀을 동시에 스케줄링할 수 있도록 하여 입력버퍼 내에서의 지연을 감소시키고 링망과 일대일 연결 네트워크의 이용율을 높이며 스위치의 처리율을 높일 수 있다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권8호
• /
• pp.3621-3640
• /
• 2016

In the process of k-coverage of the target node, there will be a lot of data redundancy forcing the phenomenon of congestion which reduces network communication capability and coverage, and accelerates network energy consumption. Therefore, this paper proposes a novel energy balanced k-coverage control algorithm based on probability model (EBKCCA). The algorithm constructs the coverage network model by using the positional relationship between the nodes. By analyzing the network model, the coverage expected value of nodes and the minimum number of nodes in the monitoring area are given. In terms of energy consumption, this paper gives the proportion of energy conversion functions between working nodes and neighboring nodes. By using the function proportional to schedule low energy nodes, we achieve the energy balance of the whole network and optimizing network resources. The last simulation experiments indicate that this algorithm can not only improve the quality of network coverage, but also completely inhibit the rapid energy consumption of node, and extend the network lifetime.

• 한국경영과학회지
• /
• 제20권1호
• /
• pp.85-99
• /
• 1995

Increasingly, risk analysis is becoming important ingredients in achieving the successful implementation and application in the area of the project management. The project management system is designed to manage or control the project resources on a given activity within time, cost and performance so called TPPM (Total Productive Project Management). In this research, a risk analysis model misproposed to identify potential problem areas, quantify the risks, and generated the chice of the action that can be taken to reduce the risk. In addition two analysis models are proposed : 1) risk factor model and 2) network simulation model using VERT (Venture Evaluation and Review Technique ). The objective of the remodels is to estimate the schedule, cost performance risks. These proposed quantitative models for project risk analysis are proving its value for the project managers who need to assess the risk of changes in cost, schedule, or performance. The proposed models will be used in the area of project selection, evaluation and the allocation of project resources.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권3호
• /
• pp.1071-1090
• /
• 2016

Most of scheduling methods in the Grid only consider one special attribute of the resource or one aspect of QoS (Quality of Service) of the job. In this paper, we focus on the problem that how to consider two aspects simultaneously. Based on the requirements of the jobs and the attributes of the resources, jobs are categorized into three kinds: CPU-overload, memory-overload, and bandwidth-overload jobs. One job may belong to different kinds according to different attributes. We schedule the jobs in different categories in different orders, and then propose a scheduling method-MTS (multiple attributes scheduling method) to schedule Grid resources. Based on the comparisons between our method, Min-min, ASJS (Adaptive Scoring Job Scheduling), and MRS (Multi-dimensional Scheduling) show: (1) MTS reduces the execution time more than 15% to other methods, (2) MTS improves the number of the finished jobs before the deadlines of the jobs, and (3) MTS enhances the file size of transmitted files (input files and output files) and improves the number of the instructions of the finished jobs.

• ETRI Journal
• /
• 제34권3호
• /
• pp.462-465
• /
• 2012

This letter proposes a new distributed scheduling scheme combined with routing to support the quality of service of real-time applications in wireless mesh networks. Next, this letter drives average end-to-end delay of the proposed scheduling scheme that sequentially schedules the slots on a path. Finally, this letter simulates the time division multiple access network for performance comparison. From the simulation results, when the average number of hops is 2.02, 2.66, 4.1, 4.75, and 6.3, the proposed sequential scheduling scheme reduces the average end-to-end delay by about 28%, 10%, 17%, 27%, and 30%, respectively, compared to the conventional random scheduling scheme.

• 국제학술발표논문집
• /
• The 1th International Conference on Construction Engineering and Project Management
• /
• pp.780-785
• /
• 2005

This paper aims to consider an overall benefit-duration optimization (OBDO) problem for the sake of maximizing owner's economic benefits, whilst considering influences of schedule compression incurred opportunity income on the profitability of a large-scale construction project. Unlike previous schedule optimization models and techniques that have focused on project duration or cost minimization, with greater weight on contractors' interests, OBDO facilitates owner's economic benefits through overall benefit-duration optimization. In this paper, the objective function of OBDO model is formulated. An example is illustrated to prove the feasibility and practicability of the overall benefit-duration optimization problem. The significance of employing OBDO model and future research work are also described.

• 국제학술발표논문집
• /
• The 4th International Conference on Construction Engineering and Project Management Organized by the University of New South Wales
• /
• pp.395-398
• /
• 2011

This paper introduces stochastic cash-flow modeling integrated with simulation based scheduling. The system makes use of CPM schedule data exported from commercial scheduling software, computes the best fit probability distribution functions (PDFs) of historical activity durations, assigns the PDFs identified to respective activities, simulates the schedule network, computes the deterministic and stochastic project cash-flows, plots the corresponding cash flow diagrams, and estimates the best fit PDFs of overdraft and net profit of a project. It analyzes the effect of different distributions of activity durations on the distribution of overdrafts and net profits, and improves reliability compared to deterministic cash flow analysis.

• 산업공학
• /
• 제14권4호
• /
• pp.348-355
• /
• 2001

This paper suggests a detailed design of APS(Advanced Planning & Scheduling) system using the DBR (Drum-Buffer-Rope) which is a finite capacity scheduling logic of TOC(Theory of Constraints). Our design is composed of four modules; Network, Buffer, Drum and Subordination. The Network module defines the Product Network which is built from BOM and routings. The Buffer module inserts the Buffers into the Product Network. The Drum module describes detail procedures to create Drum Schedule on the CCR(Capacity Constraint Resource). The Subordination module synchronizes all non-constraints to the constraints by determining the length of Rope. This design documented by ARIS.