• Title/Summary/Keyword: Queueing System

Search Result 439, Processing Time 0.033 seconds

Energy-Saving Strategy for Green Cognitive Radio Networks with an LTE-Advanced Structure

  • Jin, Shunfu;Ma, Xiaotong;Yue, Wuyi
    • Journal of Communications and Networks
    • /
    • v.18 no.4
    • /
    • pp.610-618
    • /
    • 2016
  • A green cognitive radio network (CRN), characterized by base stations (BSs) that conserve energy during sleep periods, is a promising candidate for realizing more efficient spectrum allocation. To improve the spectrum efficiency and achieve greener communication in wireless applications, we consider CRNs with an long term evolution advanced (LTE-A) structure and propose a novel energy-saving strategy. By establishing a type of preemptive priority queueing model with a single vacation, we capture the stochastic behavior of the proposed strategy. Using the method of matrix geometric solutions, we derive the performance measures in terms of the average latency of secondary user (SU) packets and the energy-saving degree of BSs. Furthermore, we provide numerical results to demonstrate the influence of the sleeping parameter on the system performance. Finally, we compare the Nash equilibrium behavior and social optimization behavior of the proposed strategy to present a pricing policy for SU packets.

The Analysis of the Transportation Process of Mokpo Port (목포항 운송과정의 분석)

  • Nam, M.U.;Lee, C.Y.;Park, G.K.;Yun, M.O.
    • Journal of Korean Port Research
    • /
    • v.9 no.1
    • /
    • pp.33-43
    • /
    • 1995
  • Korean economic and industrial structure has been seperated into some areas with the trend of the change to the bloc system of international economy: the Gyeongin including the capital area, the Middle-West, the South-West, the South-East, and the Eastern sea areas. Mokpo port has played a major role as the central one of the South-West area and the entrance of Yeong-san river of Jeonnam province gate. Some studies has been done on the Mokpo port, but there is no research of the analytical approach about it. In this paper, we analyze the data of 1994's on the domestic and oceangoing piers in the Mokpo port and simulate the transportation process of it through a queueing model. The results of the simulation are summarized as follows: The average arrival interval of the domestic vessel is 6.034 hours. The average service time and the berth utility rate are 24.056 hours and over 100%, respectively. The average arrival interval of the oceangoing vessel is 34.48 hours. The average service time and the berth utility rate are 120.04 hours and the 34.91%, respectively. The proposal to improving of the Mokpo port as follows: It is desirable to extend the capacity of domestic pier to about 50% for the optimal utility rate of 70% and in the case of oceangoing pier to be increase 65% of the vessel capacity for the optimal utility rate of 70%.

  • PDF

A DQN-based Two-Stage Scheduling Method for Real-Time Large-Scale EVs Charging Service

  • Tianyang Li;Yingnan Han;Xiaolong Li
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.18 no.3
    • /
    • pp.551-569
    • /
    • 2024
  • With the rapid development of electric vehicles (EVs) industry, EV charging service becomes more and more important. Especially, in the case of suddenly drop of air temperature or open holidays that large-scale EVs seeking for charging devices (CDs) in a short time. In such scenario, inefficient EV charging scheduling algorithm might lead to a bad service quality, for example, long queueing times for EVs and unreasonable idling time for charging devices. To deal with this issue, this paper propose a Deep-Q-Network (DQN) based two-stage scheduling method for the large-scale EVs charging service. Fine-grained states with two delicate neural networks are proposed to optimize the sequencing of EVs and charging station (CS) arrangement. Two efficient algorithms are presented to obtain the optimal EVs charging scheduling scheme for large-scale EVs charging demand. Three case studies show the superiority of our proposal, in terms of a high service quality (minimized average queuing time of EVs and maximized charging performance at both EV and CS sides) and achieve greater scheduling efficiency. The code and data are available at THE CODE AND DATA.

The Optimal Distributed Database System Design Using the Genetic Algorithm (유전자 알고리즘을 이용한 최적의 분산 데이터베이스 시스템 설계)

  • Ko, Suc-Bum;Youn, Sung-Dae
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.9
    • /
    • pp.2797-2806
    • /
    • 2000
  • Recently, DDSs(Distributed Database Systems) have been implemented on V AN(V alue Added Network) as we know the amazing expansion of information network. DDS can yield significant cost and response time advantages over centralized systems for geographically distributed organizations. However, inappropriate design can result in high cost and poor response time to maintain the database at each site. In a DDS design, the main problem is how to select proper computer and how to allocate data fragment into a proper site. In this paper, we address DDS design problem of selecting the proper class of computers and the allocating data files on VAN. Also, the formulated model includes two objectives, the waited response time and the investment cost to include their relationship. Specially, the formulation of waited response time is based on M/M/1 queueing system to evaluate more precisely. GA(Genetic Algorithm), a kind of heuristic search method, is developed to search an optimal solution in the proposed design model and we show the simulation result to examine the algorithm performance.

  • PDF

A Study on the Optimal Allocation of Maintenance Personnel in the Naval Ship Maintenance System (해군 함정 정비체계 최적 정비인력 할당 모형 연구)

  • Kim, Seong-Woo;Yoon, Bong-Kyoo
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.16 no.3
    • /
    • pp.1853-1862
    • /
    • 2015
  • Naval maintenance system carries out repairs of battle ships. Korean Navy has four maintenance stations to maximize the readiness of the battle ships. Since each station can provide different services according to characteristics(specific size of ships, type of maintenances) and the maintenance ability of stations is predetermined, it has been one of complex problems for the Korean Navy to find the optimal resource allocation. We investigate the operation of the stations from the perspective of the human resource allocation which plays crucial role in the performance of the maintenance stations. Using a queueing model and optimization technique, we present a way to derive the optimal personnel allocation which minimize the waiting number of battle ships at each station, leading to the improvement of the military readiness in the Korean Navy.

An Adaptive Strategy for Providing Dynamic Route Guidance under Non-Recurrent Traffic Congestion (돌발적 교통혼잡발생시 동적경로안내를 위한 적응형 알고리즘개발에 관한 연구)

  • 이상건
    • Proceedings of the KOR-KST Conference
    • /
    • 1996.12a
    • /
    • pp.81-108
    • /
    • 1996
  • 첨단교통정보시스템(ATIS)의 핵심 요소라 할 수 있는 동적경로안내 시스템(Dynamic Route Guidance System : DRGS)은 운전자가 목적지에 도착하기까지 실시간 교통정보를 토대로 최적경로를 안내해 줌으로써 날로 심화되어 가고 있는 교통혼잡을 최소화할 수 있으리라 기대를 모으고 있다. 특히 교통사고나 긴급도로공사 등으로 인해 발생하는 돌발적 교통혼잡하에서는 DRGS의 역할이 더욱 커질 것으로 예상되고 있다. 본 논문은 돌발적 교통혼잡하에서 보다 효과적인 DRGS의 경로 안내 알고리즘을 개발하는 데 그 목적이 있다. 이를 위해서 우선 하부구조기반(Infrastructure Based) DRGS와 개인차량기반(In-vehicle Based)DRGS의 장단점을 운전자, 교통행정당국, 그리고 교통체계관점에서 비교하였고, 시스템 아키텍쳐와 경로안내 알고리즘간의 상호관계를 규명하였다. 또한 효율적인 경로안내를 위해 사용자 평형(User Equilibrium)경로안내전략과 시스템최적화(System Optimal) 경로안내전략을 이상형 교통망(Idealistic Network)을 통해 비교분석하였다. 여기에는 현재 ITS-America에서 System Architecture 평가를 위해 사용한 INTEGRATION이라는 ITS Simulation Model과 그 통행저항함수를 사용하였다. 이를 토대로 돌발적 교통혼잡상황 아래서 사용자평형 경로안내를 제공할 경우 야기될 수 있는 Braess` Paradox 문제와, 총통행시간을 최소화하기 위한 시스템최적 경로안내를 제공할 경우 일어날 수 있는 사용자 호응도(User Compliance)문제를 동시에 고려한 적응형 동적경로안내 알고리즘을 개발하였다. 여기에는 돌발적 교통혼잡하에서 통행시간을 동적으로 예측하기 위해 이산형 확정적 대기행렬모형(Discrete Deterministic Queueing Model)이 사용되었다. 한편 알고리즘의 효율성을 평가하기 위해 이상형 교통망과, 실제 미국 Virginia 주의 Fairfax County에 소재한 주간 고속도로 66번(I-66)과 인접 교통망의 교통자료를 사용하여 각종 돌발교통 혼잡 상황을 전제로 한 Traffic Simulation과 정보제공시나\리오를 INTEGRATION Model을 이용해 실행하였다. 그 결과 적응형 알고리즘이 개개인의 최단시간 경로를 제공하는 사용자 평형 경로안내전략에 비해 교통혼잡도와 정체시간의 체류정도에 따라 3%에서 10%까지 전체통행시간을 절약할 수 있다는 결론을 얻었다.

  • PDF

Backhaul Resource Allocation Protocol for Underwater Cellular Communication Networks (수중 셀룰러 통신 네트워크에서 백홀 자원분배 프로토콜에 관한 연구)

  • Yun, Changho;Park, Jong-Won;Choi, Suhan
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.42 no.2
    • /
    • pp.393-402
    • /
    • 2017
  • Just like terrestrial cellular networks, underwater cellular communication networks, which can manage the overall network resource by adaptively allocating backhaul resource for each base station according to its ingress traffic, are necessary. In this paper, a new resource allocation protocol is proposed for the underwater cellular communication network, allocating backhaul resource of a base station proportional to its ingress traffic to the base station. This protocol is classified into two types dependent upon allocation period: the resource allocation protocol with adaptive period and that with fixed period. In order to determine a proper resource allocation protocol, the performance of the two protocols, in terms of reception rate, message overhead, and latency is compared and investigated via simulation. As a result, the resource protocol with adaptive period outperforms that with fixed period; the resource allocation protocol with fixed period results in a maximum of $10^2$ order longer queueing delay as well as $10^2$ order greater message overhead than that with adaptive period.

A Study on the Performance Evaluation Method of the Spatial Information Network based on GIS (인터넷 기반의 공간정보유통망 성능분석 방법에 관한 연구)

  • Jin, Heui-Chae;Si, Jong-Yik
    • Journal of Korea Spatial Information System Society
    • /
    • v.1 no.1 s.1
    • /
    • pp.29-37
    • /
    • 1999
  • Recently, brisk up the construction of the spatial information, many people highly concern to tile information circulation of GIS. Each system like GIS has a structure of the information circulation to itself. In this paper, we study on the performance evaluation method of tile structure which to circulate tile spatial information based on the internet. To do this, we hypothesize values of content and scale of the geo-spatial information on each internet network and volumes of the information to circulate between internet networks. Then we suggest a method to evaluate the performance of the structure to aid the circulation of spatial information based on queueing model. Henceforth, with the volumes of data stored and circulated information of each GIS, this method can help to design the structure to circulate the GIS information more efficiently.

  • PDF

Performance Analysis of Call Admission Control Scheme with Bandwidth Borrowing and Bandwidth Reservation in GEO based Integrated Satellite Network (GEO 기반 위성 네트워크에서의 대역폭 빌림 방법과 대역폭 예약 방법을 이용한 호 수락 제어 성능 분석)

  • Hong, Tae-Cheol;Gang, Gun-Seok;An, Do-Seop;Lee, Ho-Jin
    • Journal of Satellite, Information and Communications
    • /
    • v.1 no.1
    • /
    • pp.12-19
    • /
    • 2006
  • In this paper, we propose the bandwidth borrowing scheme which improves the performance of the cal admission control of the integrated GEO satellite networks. In general, target transmission rates of communications and streaming services are fixed, but data services do not have the target transmission rates. Therefore, we can control the transmission rates for data services flexibly according to the system loading situation. When the available bandwidth of the system is insufficient, the bandwidth borrowing scheme gives the bandwidth to request real time services by the transmission rates control of data services through packet scheduler. We make the queueing model for our system model and demonstrate the results through simulations. The simulation results show that there is a 8.7-35.2 dB gain at the total blocking probability according to the use of bandwidth borrowing scheme.

  • PDF

Performance Evaluation of Workstation System within ATM Integrated Service Switching System using Mean Value Analysis Algorithm (MVA 알고리즘을 이용한 ATM 기반 통합 서비스 교환기 내 워크스테이션의 성능 평가)

  • Jang, Seung-Ju;Kim, Gil-Yong;Lee, Jae-Hum;Park, Ho-Jin
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.6 no.4
    • /
    • pp.421-429
    • /
    • 2000
  • In present, ATM integrated switching system has been developed to a mixed modules that complexed switching system including maintenance, operation based on B-ISDN/LAN service and plug-in module, , which runs on workstation computer system. Meanwhile, workstation has HMI operation system feature including file system management, time management, graphic processing, TMN agent function. The workstation has communicated with between ATM switching module and clients. This computer system architecture has much burden messages communication among processes or processor. These messages communication consume system resources which are socket, message queue, IO device files, regular files, and so on. Therefore, in this paper we proposed new performance modeling with this system architecture. We will analyze the system bottleneck and improve system performance. In addition, in the future, the system has many additional features should be migrated to workstation system, we need previously to evaluate system bottleneck and redesign it. In performance model, we use queueing network model and the simulation package is used PDQ and C-program.

  • PDF