• Title/Summary/Keyword: Dynamic Scheduling Algorithm

Search Result 218, Processing Time 0.024 seconds

A Study on the Design Method of dynamic gateway system for MOST GATEWAY Performance Analysis in MOST25 and MOST150 Networks (MOST25와 MOST150 네트워크에서 효율적인 데이터 전송을 위한 MOST GATEWAY 성능분석을 위한 설계 방안)

  • Jang, Seong-Jin;Jang, Jong-Yug
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2010.05a
    • /
    • pp.712-715
    • /
    • 2010
  • In recent years, the driver needs the convenience of their vehicles and that there is an increasing requirement. Many researches have been mainly focused on MOST Networks to provide quality of multimedia service. The MOST network to support different bandwidth(MOST 25, MOST 50, MOST 150) should consist of a heterogeneous network. So the networks to used different protocols required gateway for receive and transmit information. The method to used gateway has problems occured loss of a packet by a lot of delay. In our previous research, we proposed a MOST GATEWAY system for organically connected to the network MOST150 and MOST 25. Therefore in this paper, we propose a simulation design Method of dynamic gateway system for MOST GATEWAY Performance Analysis in MOST25 and MOST150 Networks.

  • PDF

Dynamic Routing and Priority-based Data Transmission Schemes in Avionic Ethernet for Improving Network QoS (항공전자 이더넷의 네트워크 성능 향상을 위한 동적 라우팅 기법 및 우선순위기반 데이터 전송 기법)

  • Lee, Won Jin;Kim, Yong Min
    • Journal of Advanced Navigation Technology
    • /
    • v.23 no.4
    • /
    • pp.302-308
    • /
    • 2019
  • Aircraft data network (ADN) is a data networking for signal transmission among avionic systems in aircraft, and it mostly has been applied MIL-STD-1553B that guarantees high reliability considering its application environments. However, commercial Ethernet has been widely applied for ADN recently, and its range of applications have increased. Ethernet provides high speed of data transmission, however, it could not guarantee quality of service (QoS) so high as MIL-STD-1553B. In this paper, we propose dynamic routing and priority based data transmission schemes in order to improve the QoS of legacy Ethernet. Our propose schemes can be applied to Ethernet switch, and it is able to manage network traffic efficiently, and reduce the time for data transmission. We analyze the packet transmission time for both legacy and proposed schemes in Ethernet environments using simulation, and we show that our proposed scheme can reduce the time for data transmission compare to legacy spanning tree protocol.

Energy-aware Dynamic Frequency Scaling Algorithm for Polling based Communication Systems (폴링기반 통신 시스템을 위한 에너지 인지적인 동적 주파수 조절 알고리즘)

  • Cho, Mingi;Park, Daejin
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.26 no.9
    • /
    • pp.1405-1411
    • /
    • 2022
  • Power management is still an important issue in embedded environments as hardware advances like high-performance processors. Power management methods such as DVFS control CPU frequencies in an adaptive manner for efficient power management in polling-based I/O programs such as network communication. This paper presents the problems of the existing power management method and proposes a new power management method. Through this, it is possible to reduce electric consumption by increasing the polling cycle in situations where the frequency of data reception is low, and on the contrary, in situations where data reception is frequent, it can operate at the maximum frequency without performance degradation. After implementing this as a code layer on the embedded board and observing it through Atmel's Power Debugger, the proposed method showed a performance improvement of up to 30% in energy consumption compared to the existing power management method.

An Adaptive Neighbor Discovery for Tactical Airborne Networks with Directional Antenna (지향성 안테나 기반 공중전술네트워크를 위한 적응적 이웃노드 탐색기법)

  • Lee, Sung-Won;Yoon, Sun-Joong;Ko, Young-Bae
    • Journal of KIISE:Information Networking
    • /
    • v.37 no.1
    • /
    • pp.1-7
    • /
    • 2010
  • Network Centric Warfare(NCW) is becoming a prominent concept in the current trend of warfare. To support high quality communication between strategic/tactical units in the concept of NCW, Tactical Airborne Networks are likely to be constructed in the near future to take part in the NCW. In these Tactical Airborne Networks with dynamic topology variations due to very high mobility of participants nodes, more efficient and reliable neighbor discovery protocols are needed. This paper presents the adaptive HELLO message scheduling algorithm for Tactical Airborne Network using directional antennas. The purposed algorithm can reduce the overhead of periodic HELLO message transfer, while guaranteeing successful data transmission. We concluded a mathematical analysis and simulation studies using Qualnet 4.5 for evaluation the performance and efficiency of the proposed scheme.

Scheduling System using CSP leer Effective Assignment of Repair Warrant Job (효율적인 A/S작업 배정을 위한 CSP기반의 스케줄링 시스템)

  • 심명수;조근식
    • Proceedings of the Korea Inteligent Information System Society Conference
    • /
    • 2000.11a
    • /
    • pp.247-256
    • /
    • 2000
  • 오늘날의 기업은 상품을 판매하는 것 뿐만 아니라 기업의 신용과 이미지를 위해 그 상품에 대한 사후처리(After Service) 업무에 많은 투자를 하고 있다. 이러한 양질의 사후서비스를 고객에게 공급하기 위해서는 많은 인력을 합리적으로 관리해야 하고 요청되는 고장수리 서비스 업무를 빠르게 해결하기 위해서는 업무를 인력들에게 합리적으로 배정을 하고 회사의 비용을 최소화하면서 정해진 시간에 요청된 작업을 처리하기 위해서는 인력들에게 작업을 배정하고 스케줄링하는 문제가 발생된다. 본 논문에서는 이러한 문제를 해결하기 위해 화학계기의 A/S 작업을 인력에게 합리적으로 배정하는 스케줄링 시스템에 관한 연구이다. 먼저 스케줄링 모델을 HP 사의 화학분석 및 시스템을 판매, 유지보수 해 주는 "영진과학(주)"회사의 작업 스케줄을 분석하여 필요한 도메인과 고객서비스전략과 인력관리전략에서 제약조건을 추출하였고 여기에 스케줄링 문제를 해결하기 위한 방법으로 제약만족문제(CSP) 해결기법인 도메인 여과기법을 적용하였다. 도메인 여과기법은 제약조건에 의해 변수가 갖는 도메인의 불필요한 부분을 여과하는 것으로 제약조건과 관련되어 있는 변수의 도메인이 축소되는 것이다. 또한, 스케줄링을 하는데에 있어서 비용적인 측면에서의 스케줄링방법과 고객 만족도에서의 스케줄링 방법을 비교하여 가장 이상적인 해를 찾는데 트래이드오프(Trade-off)를 이용하여 최적의 해를 구했으며 실험을 통해 인력에게 더욱 효율적으로 작업들을 배정 할 수 있었고 또한, 정해진 시간에 많은 작업을 처리 할 수 있었으며 작업을 처리하는데 있어 소요되는 비용을 감소하는 결과를 얻을 수 있었다. 검증하였다.를, 지지도(support), 신뢰도(confidence), 리프트(lift), 컨빅션(conviction)등의 관계를 통해 다양한 방법으로 모색해본다. 이 연구에서 제안하는 이러한 개념계층상의 흥미로운 부분의 탐색은, 전자 상거래에서의 CRM(Customer Relationship Management)나 틈새시장(niche market) 마케팅 등에 적용가능하리라 여겨진다.선의 효과가 나타났다. 표본기업들을 훈련과 시험용으로 구분하여 분석한 결과는 전체적으로 재무/비재무적 지표를 고려한 인공신경망기법의 예측적중률이 높은 것으로 나타났다. 즉, 로지스틱회귀 분석의 재무적 지표모형은 훈련, 시험용이 84.45%, 85.10%인 반면, 재무/비재무적 지표모형은 84.45%, 85.08%로서 거의 동일한 예측적중률을 가졌으나 인공신경망기법 분석에서는 재무적 지표모형이 92.23%, 85.10%인 반면, 재무/비재무적 지표모형에서는 91.12%, 88.06%로서 향상된 예측적중률을 나타내었다.ting LMS according to increasing the step-size parameter $\mu$ in the experimentally computed. learning curve. Also we find that convergence speed of proposed algorithm is increased by (B+1) time proportional to B which B is the number of recycled data buffer without complexity

  • PDF

Development of Part Sales Agent Coupled with Virtual Manufacturing in Internet Environment (인터넷상의 가상생산 기반 부품판매 에이전트 개발)

  • Choi, Hyung-Rim;Kim, Hyun-Soo;Park, Young-Jae;Park, Byoung-Joo;Lee, Kyoung-Jun
    • Asia pacific journal of information systems
    • /
    • v.12 no.4
    • /
    • pp.193-213
    • /
    • 2002
  • The sales activity of most of small manufacturing companies is based on orders of buyers. The process of promotion, negotiation, receipt and selection of orders of the manufacturers is closely coupled with the load status of the production lines. The decision on whether to accept an order or not, or the selection of optimal order set among excessive orders is entirely dependent on the schedule of production lines. However, in the real world, since the production scheduling activity is mainly performed by human experts, most of small manufacturers are suffer from being unable to meet due dates, lack of rapid decision on the acceptance of new order. Recently, Internet based Electronic Commerce is recognized as one of the alternatives for strengthening sales power of small and medium companies. However, small and medium manufacturers can't adjust properly to the new environment because they are in short of money, personnel, and technology. To cope with this problem, this paper deals with development of part sales agent coupled with virtual manufacturing in Internet environment that consist of selection agent, advertisement agent, selection agent, negotiation agent, and virtual manufacturing system. This paper develops a time-bounded negotiation mechanism for small and medium manufacturers in agent-based automated negotiation between customers and negotiation agents. Furthermore, to select optimal order set maximized profit, we first formulate the order selection problem with mixed integer programming, but the computation time of IP is not acceptable for real world scale problem. To overcome this problem and dynamic nature of virtual manufacturing, we suggest a genetic algorithm approach, which shows a reasonable computation time for real world case and good incremental problem solving capability.

Positioning using ZigBee and Ultrasound

  • Park, Chan-Sik;Kim, Seung-Beom;Kang, Dong-Youn;Yun, Hee-Hak;Cha, En-Jong;Lee, Sang-Jeong
    • Proceedings of the Korean Institute of Navigation and Port Research Conference
    • /
    • v.2
    • /
    • pp.217-222
    • /
    • 2006
  • To find a location, GPS has been wildly used. But, it is hard to use in indoor because of very weak signal level. To meet indoor requirements, there have been many studies applying wireless communication networks such as WLAN, UWB and ZigBee. Among these, ZigBee is widely adopted in many WSN applications because it has an advantage of low-power and low-cost. In ZigBee, the RSSI is used as range measurement for ad-hoc network. The RSSI are converted to ranges using the signal attenuation model and these ranges become inputs of positioning methods. The obtained position with RSSI has large error because of its poor accuracy. To overcome this problem, ultrasonic sensors are added in many researches. By measuring the arrival time difference of ZigBee and ultrasound as a range measurement, the precise position can be found. However, there are still many problems: scheduling of beacons to transmit signals in a correct order, addition and synchronization of beacons and low-rate positioning rate. At this paper, an efficient method to solve these problems is proposed. In the proposed method, a node transmits ZigBee and ultrasound signal simultaneously. And beacons find the range with the received signals and send it back to a node with ZigBee. The position is computed in a node with the received ranges. In addition, a new positioning algorithm to solve the risk of the divergence in the linearization method and the singularity problem in the Savarese method is presented. Both static and dynamic experimental results show 0.02m RMS errors with high output rate.

  • PDF

Development of Intelligent ATP System Using Genetic Algorithm (유전 알고리듬을 적용한 지능형 ATP 시스템 개발)

  • Kim, Tai-Young
    • Journal of Intelligence and Information Systems
    • /
    • v.16 no.4
    • /
    • pp.131-145
    • /
    • 2010
  • The framework for making a coordinated decision for large-scale facilities has become an important issue in supply chain(SC) management research. The competitive business environment requires companies to continuously search for the ways to achieve high efficiency and lower operational costs. In the areas of production/distribution planning, many researchers and practitioners have developedand evaluated the deterministic models to coordinate important and interrelated logistic decisions such as capacity management, inventory allocation, and vehicle routing. They initially have investigated the various process of SC separately and later become more interested in such problems encompassing the whole SC system. The accurate quotation of ATP(Available-To-Promise) plays a very important role in enhancing customer satisfaction and fill rate maximization. The complexity for intelligent manufacturing system, which includes all the linkages among procurement, production, and distribution, makes the accurate quotation of ATP be a quite difficult job. In addition to, many researchers assumed ATP model with integer time. However, in industry practices, integer times are very rare and the model developed using integer times is therefore approximating the real system. Various alternative models for an ATP system with time lags have been developed and evaluated. In most cases, these models have assumed that the time lags are integer multiples of a unit time grid. However, integer time lags are very rare in practices, and therefore models developed using integer time lags only approximate real systems. The differences occurring by this approximation frequently result in significant accuracy degradations. To introduce the ATP model with time lags, we first introduce the dynamic production function. Hackman and Leachman's dynamic production function in initiated research directly related to the topic of this paper. They propose a modeling framework for a system with non-integer time lags and show how to apply the framework to a variety of systems including continues time series, manufacturing resource planning and critical path method. Their formulation requires no additional variables or constraints and is capable of representing real world systems more accurately. Previously, to cope with non-integer time lags, they usually model a concerned system either by rounding lags to the nearest integers or by subdividing the time grid to make the lags become integer multiples of the grid. But each approach has a critical weakness: the first approach underestimates, potentially leading to infeasibilities or overestimates lead times, potentially resulting in excessive work-inprocesses. The second approach drastically inflates the problem size. We consider an optimized ATP system with non-integer time lag in supply chain management. We focus on a worldwide headquarter, distribution centers, and manufacturing facilities are globally networked. We develop a mixed integer programming(MIP) model for ATP process, which has the definition of required data flow. The illustrative ATP module shows the proposed system is largely affected inSCM. The system we are concerned is composed of a multiple production facility with multiple products, multiple distribution centers and multiple customers. For the system, we consider an ATP scheduling and capacity allocationproblem. In this study, we proposed the model for the ATP system in SCM using the dynamic production function considering the non-integer time lags. The model is developed under the framework suitable for the non-integer lags and, therefore, is more accurate than the models we usually encounter. We developed intelligent ATP System for this model using genetic algorithm. We focus on a capacitated production planning and capacity allocation problem, develop a mixed integer programming model, and propose an efficient heuristic procedure using an evolutionary system to solve it efficiently. This method makes it possible for the population to reach the approximate solution easily. Moreover, we designed and utilized a representation scheme that allows the proposed models to represent real variables. The proposed regeneration procedures, which evaluate each infeasible chromosome, makes the solutions converge to the optimum quickly.