• Title/Summary/Keyword: multi-queue

Search Result 135, Processing Time 0.025 seconds

QLGR: A Q-learning-based Geographic FANET Routing Algorithm Based on Multi-agent Reinforcement Learning

  • Qiu, Xiulin;Xie, Yongsheng;Wang, Yinyin;Ye, Lei;Yang, Yuwang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.11
    • /
    • pp.4244-4274
    • /
    • 2021
  • The utilization of UAVs in various fields has led to the development of flying ad hoc network (FANET) technology. In a network environment with highly dynamic topology and frequent link changes, the traditional routing technology of FANET cannot satisfy the new communication demands. Traditional routing algorithm, based on geographic location, can "fall" into a routing hole. In view of this problem, we propose a geolocation routing protocol based on multi-agent reinforcement learning, which decreases the packet loss rate and routing cost of the routing protocol. The protocol views each node as an intelligent agent and evaluates the value of its neighbor nodes through the local information. In the value function, nodes consider information such as link quality, residual energy and queue length, which reduces the possibility of a routing hole. The protocol uses global rewards to enable individual nodes to collaborate in transmitting data. The performance of the protocol is experimentally analyzed for UAVs under extreme conditions such as topology changes and energy constraints. Simulation results show that our proposed QLGR-S protocol has advantages in performance parameters such as throughput, end-to-end delay, and energy consumption compared with the traditional GPSR protocol. QLGR-S provides more reliable connectivity for UAV networking technology, safeguards the communication requirements between UAVs, and further promotes the development of UAV technology.

A Scheme of Concurrent Two-Way Synchronizations for Spatio-Temporal Data on a Mobile Environments (모바일 환경에서 시공간 데이터의 동시 양방향 동기화 기법)

  • Kim, Hong-Ki;Kim, Dong-Hyun
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2008.05a
    • /
    • pp.171-174
    • /
    • 2008
  • As the mobile devices and the wireless networks have high-performance capabilities, it is possible to synchronize the spatio-temporal data of a server with the spatio-temporal data of a mobile device which are collected at a field. However, since the server process the synchronization which the model device requests the whole synchronizations of mass mobile devices take long time. In this paper, we propose the scheme to Process concurrently the synchronizations of mobile devices which does not conflict with others using the scheme of a multi-queue.

  • PDF

Development of Simulation App for Understanding Test-and-Set Algorithms that Multi Learner Can Use Simultaneously

  • Lee, Kyong-ho
    • Journal of the Korea Society of Computer and Information
    • /
    • v.25 no.9
    • /
    • pp.193-201
    • /
    • 2020
  • In this study, we developed a simulation app that performs the Test-and-Set algorithm. The test-and-set algorithm is a highly difficult algorithm, so this simulation app was created for learners who have difficulty understanding it. Learners who want to understand the Test-and-Set algorithm gather to form a team, and use this simulation app to discuss and practice, and these teams can practice at the same time. The test-and-set, which is assumed to be a machine language, is not interrupted by using a queue, and it can be seen that the configured simulation app performs well in all three conditions of 'mutual exclusion', 'progress', and 'bounded waiting' that must be solved in the critical area problem.

Subaru Strategy for 2020's

  • Arimoto, Nobuo
    • The Bulletin of The Korean Astronomical Society
    • /
    • v.40 no.2
    • /
    • pp.27.2-27.2
    • /
    • 2015
  • Strategic plan of Subaru science and operation will be introduced. Currently, Subaru has wide variety of instruments, conducts only classical observations, with less than 5 nights allocation for each proposal. Near future, Subaru will emphasize on surveys, introduce queue mode observations, reduce the number of instruments, and concentrate on large size programs. Large surveys are called Subaru Strategic Programs (SSPs). HSC-SSP is on-going (300 nights for 5 years), PFS-SSP will start at around 2020 (360 nights for 5 years), and IRD-SSP from 2016 (TBD). HSC science includes 1) cosmology with gravitational lensing, 2) lensing studies of galaxies and clusters, 3) photometric redshifts, 4) the Solar system, 5) the Milky Way and the Local Group, 6) AGN/quasars, 7) transients, 8) galaxies at low/high redshifts, and 9) clusters of galaxies. PFS science includes 1) cosmology, 2) galaxy & AGN, and 3) galactic archaeology. Subaru is planning the third pillar instrument, so called ULTIMATE-Subaru, which is the GLAO optical-NIR wide field camera & multi-IFU spectrograph for finding galaxies at ultra high redshift (z>10). Finally the strategy from Subaru to TMT will be presented. Subaru will conduct four major SSPs (HSC, PFS, IRD, ULTIMATE-Subaru) in coming decade to provide targets to TMT. HSC performs wide field surveys to reveal the distribution of dark matter in the Universe. IRD surveys Earth-like young planets to discover ~20 Earth-like habitable planets. PFS studies the expanding Universe to provide a few million emission line galaxies to TMT.

  • PDF

The technique of an adaptive scheduling for a multi-tasking separation (다중작업 분할처리를 위한 적응형 스케쥴링 기법)

  • Go, Jeong-Hwan;Kim, Young-Kil
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.14 no.10
    • /
    • pp.2371-2377
    • /
    • 2010
  • As the substantial increment in program complexity and appearance of mega program, the programs need to be divided to small tasks with multiple partitions and performed with a priority based scheduling. And also, a program development has to be progressed according to diversify of development environment. For instance, there are some restrictions upon O/S environment such as embedded O/S or windows. Therefore, the adaptive scheduling technique which performs multiple task partitioning process, regardless environment or O/S, is suggested. In this study, In this study, the adaptive scheduling technique algorithm and its applied examples are described.

A Cell Scheduling Algorithm based on Multi-Priority in ATM Network (ATM망에서 다중우선순위 기반의 셀 스케줄링 알고리즘)

  • 권재우;구본혁;조태경;최명렬
    • Journal of Korea Multimedia Society
    • /
    • v.4 no.4
    • /
    • pp.339-348
    • /
    • 2001
  • In this paper, a cell scheduling algorithm which can be applied to all of the service class in ATM network is proposed. The proposed algorithm classifies the order of priority in each service class into 4 categories and generates the weight of each class service based on the traffic parameters which are negotiated in connection contract. The proposed algorithm guarantees QoS(Quality of Service) to the traffic which is sensitive to delay carrying out CBR and rt_VBR service. As it effectively manages the connection which has small bandwidth, it minimizes the cell delay in the queue. For verifying the effectiveness of the proposed algorithm the proposed algorithm is simulated with existing cell scheduling algorithm and the result is showed.

  • PDF

A novel technology of Establishing Intelligent Power Information System based on Multi-Agent (멀티에이전트 기반의 지능형 전력 정보시스템 구축 기술)

  • Kim, Ji-Young;Kim, Sang-Tae;Yu, Nam-Cheol;Lee, Dong-Cheol
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2008.06d
    • /
    • pp.307-312
    • /
    • 2008
  • 최근 전기 전력 도메인의 IT화 (전력 IT) 가 본격적으로 진행되면서 전기 데이터를 취득하기 위한 기기들 뿐만 아니라 전력 운영 환경이 변화를 도모하고 있다 본 논문에서는 이런 전력 IT 의 일환으로 개발된 지능형 전력 정보 모니터링 시스템 (K-WAMS)을 소개하고자 한다. 이 시스템은 이기종 분산 환경에서 전력 정보를 실시간으로 전송 받아 현재 전력계통의 상황을 직관적으로 판단할 수 있는 정보를 제공하여 광역 정전을 예방하고자 하는 조기경보시스템 (Early Warning System) 이다. 또한, 전력계통의 안정성 여부를 판단하는 지능형 에이전트의 구현을 통해 광역 정전을 예견하는 지수를 제공하고, 실시간 데이터 처리 및 이력 데이터 저장 에이전트들을 통해 현재 취득되고 있는 현장 데이터 모니터링 기능을 제공한다. K-WAMS 는 실시간으로 전송 처리되는 고속 대용량 데이터들의 처리 지연, 동적 환경으로 인한 네트워크의 부하문제를 해결하기 위해서 IPC Shared Memory 기법을 이용하였고, 동적 프로세스들의 작업 스케줄링을 관리하기 위한 IPC Message Queue 기법을 이용하였다. 또한 논리적 기능 기반으로 설계된 현재 중앙 급전소(GCC) 단위의 설계 모델은 향후 지역 급전소(RCC) 단위로 설치 될 경우 재사용 되어 개발 생산성을 향상시킬 것으로 예상된다.

  • PDF

Hierarchical Dynamic Bandwidth Allocation Algorithm for Multimedia Services over Ethernet PONs

  • Ahn, Kye-Hyun;Han, Kyeong-Eun;Kim, Young-Chon
    • ETRI Journal
    • /
    • v.26 no.4
    • /
    • pp.321-331
    • /
    • 2004
  • In this paper, we propose a new dynamic bandwidth allocation (DBA) algorithm for multimedia services over Ethernet PONs (passive optical networks). The proposed algorithm is composed of a low-level scheduler in the optical network unit (ONU) and a high-level scheduler in the optical line terminal (OLT). The hierarchical DBA algorithm can provide expansibility and efficient resource allocation in an Ethernet PON system in which the packet scheduler is separated from the queues. In the proposed DBA algorithm, the OLT allocates bandwidth to the ONUs in proportion to the weight associated with their class and queue length, while the ONU preferentially allocates its bandwidth to queues with a static priority order. The proposed algorithm provides an efficient resource utilization by reducing the unused remaining bandwidth caused by the variable length of the packets. We also define the service classes and present control message formats conforming to the multi-point control protocol (MPCP) over an Ethernet PON. In order to evaluate the performance, we designed an Ethernet PON system on the basis of IEEE 802.3ah "Ethernet in the first mile" (EFM) using OPNET and carried out simulations. The results are analyzed in terms of the channel utilization, queuing delay, and ratio of the unused remaining bandwidth.

  • PDF

Agent based real-time fault diagnosis simulation (에이젼트기반 실시간 고장진단 시뮬레이션기법)

  • 배용환;이석희;배태용;이형국
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 1994.10a
    • /
    • pp.670-675
    • /
    • 1994
  • Yhis paper describes a fault diagnosis simulation of the Real-Time Multiple Fault Dignosis System (RTMFDS) for forcasting faults in a system and deciding current machine state from signal information. Comparing with other diagnosis system for single fault,the system developed deals with multiple fault diagnosis,comprising two main parts. One is a remotesignal generating and transimission terminal and the other is a host system for fault diagnosis. Signal generator generate the random fault signal and the image information, and send this information to host. Host consists of various modules and agents such as Signal Processing Module(SPM) for sinal preprocessing, Performence Monotoring Module(PMM) for subsystem performance monitoring, Trigger Module(TM) for multi-triggering subsystem fault diagnosis, Subsystem Fault Diagnosis Agent(SFDA) for receiving trigger signal, formulating subsystem fault D\ulcornerB and initiating diagnosis, Fault Diagnosis Module(FDM) for simulating component fault with Hierarchical Artificial Neural Network (HANN), numerical models and Hofield network,Result Agent(RA) for receiving simulation result and sending to Treatment solver and Graphic Agent(GA). Each agent represents a separate process in UNIX operating system, information exchange and cooperation between agents was doen by IPC(Inter Process Communication : message queue, semaphore, signal, pipe). Numerical models are used to deseribe structure, function and behavior of total system, subsystems and their components. Hierarchical data structure for diagnosing the fault system is implemented by HANN. Signal generation and transmittion was performed on PC. As a host, SUN workstation with X-Windows(Motif)is used for graphic representation.

  • PDF

The technique of adaptive scheduling for multi-tasking separation control (다중작업 분할처리를 위한 적응형 스케쥴링 기법)

  • Go, Jeong-Hwan;Kim, Young-Kil
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2010.05a
    • /
    • pp.499-502
    • /
    • 2010
  • Because of the substantial increase in program complexity and appearance of mega program, the needs to devide the program into small task with multiple partitions, and perform a scheduling based on the priority is required. And also, a program can be developed on specific environment according to the diversify of development environment. for instance, there are some restrictions upon O/S environment such as Embedded or Windows. therefore, the adaptive scheduling technique which perform multiple task partitioning process regardless environment or O/S is suggested. In this study, Adaptive scheduling technique algorithm and its application to be described.

  • PDF