• Title/Summary/Keyword: 큐잉 정보

Search Result 148, Processing Time 0.026 seconds

The Study of Distributed Processing for Graphics Rendering Engine Based on ARINC 653 Multi-Core System (ARINC 653 멀티코어 기반 그래픽스 렌더링 엔진 분산처리방안 연구)

  • Jung, Mukyoung
    • Journal of Aerospace System Engineering
    • /
    • v.13 no.5
    • /
    • pp.1-8
    • /
    • 2019
  • Recently, avionics has been migrating from a federated architecture to an integrated modular architecture based on a multi-core to reduce the number of systems, weight, power consumption, and platform redundancy. The volume of data which must bo provided to the pilot through the display device has increased, because an integrated single device performs multiple functions. For this reason, the volume of data processed by the graphic processor within a fixed operation period has increased. In this paper, we provide a multi-core-based rendering engine in to perform more graphics processing within a fixed operation period. We assume the proposed method uses a multi-core-based partitioning operating system using the AMP (Asymmetric Multi-Processing) architecture.

Fair Queuing for Mobile Sink (FQMS) : Scheduling Scheme for Fair Data Collection in Wireless Sensor Networks with Mobile Sink (모바일 싱크를 위한 균등 큐잉(FQMS) : 모바일 싱크 기반 무선 센서 네트워크에서 균등한 데이터 수집을 위한 스케줄링 기법)

  • Jo, Young-Tae;Park, Chong-Myung;Lee, Joa-Hyoung;Seo, Dong-Mahn;Lim, Dong-Sun;Jung, In-Bum
    • Journal of KIISE:Information Networking
    • /
    • v.37 no.3
    • /
    • pp.204-216
    • /
    • 2010
  • Since Sensor nodes around a fixed sink have huge concentrated network traffic, the battery consumption of them is increased extremely. Therefore the lifetime of sensor networks is limited because of huge battery consumption. To address this problem, a mobile sink has been studied for load distribution among sensor nodes. Since a mobile sink changes its location in sensor networks continuously, the mobile sink has time limits to communicate with each sensor node and unstable signal strength from each sensor node. Therefore, a fair and stable data collection method between a mobile sink and sensor nodes is necessary in this environment. When some sensor nodes are not able to send data to the mobile sink, a real-time application in sensor networks cannot be provided. In this paper, the new scheduling method, FQMS (Fair Queuing for Mobile Sink), is proposed for fair and stable data collection for mobile sinks in sensor networks. The FQMS guarantees balanced data collecting between sensor nodes for a mobile sink. In out experiments, the FQMS receives more packets from sensor nodes than legacy scheduling methods and provides fair data collection, because moving speed of a mobile sink, distance between a mobile sink and sensor nodes and the number of sensor nodes are considered.

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

An Integrated Processing Method for Image and Sensing Data Based on Location in Mobile Sensor Networks (이동 센서 네트워크에서 위치 기반의 동영상 및 센싱 데이터 통합 처리 방안)

  • Ko, Minjung;Jung, Juyoung;Boo, Junpil;Kim, Dohyun
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.8 no.5
    • /
    • pp.65-71
    • /
    • 2008
  • Recently, the research is progressing on the SWE(Sensor Web Enablement) platform of OGC(Open Geospatial Consortium) to provide the sensing data and moving pictures collected in a sensor network through the Internet Web. However, existed research does not deal with moving objects like cars, trains, ships, and person. Therefore, we present a method to deal with integrated sensing data collected by GPS device, sensor network, and image devices. Also, this paper proposes an integrated processing method for image and sensing data based on location in mobile sensor networks. Additionally, according to proposed methods, we design and implement the combine adapter. This combine adapter receives a contexts data, and provides the common interface included parsing, queueing, creating unified message function. We verity the proposed method which deal with the integrated sensing data based on combine adapter efficiently. Therefore, the research is expected to help the development of a various context information service based on location in future.

  • PDF

Performance Analysis of a Cell - Cluster - Based Call Control Procedure for Wireless ATM Networks (셀집단화 방식에 근거한 무선 ATM 호제어절차의 성능분석)

  • Cho, Young-Jong;Kim, Sung-Soo
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.7
    • /
    • pp.1804-1820
    • /
    • 1997
  • In this paper, an efficient call control procedure is presented for next generation wireless ATM networks and its performance is mathematically analyzed using the open queueing network. This procedure is based on a new scheme called as the cell clustering. When we use the cell clustering scheme, at the time that a mobile connection is admitted to the network, a virtual cell is constructed by choosing a group of neighboring base stations to which the call may probabilistically hand over and by assigning to the call a collection of virtual paths between the base stations. Within a microcell/picocell environment, it is seen that the cell clustering can support effectively a very high rate of handovers, provides very high system capacity, and guarantees a high degree of frequency reuse over the same geographical region without requiring the intervention of the network call control processor each time a handover occurs. But since mobiles, once admitted, are free to roam within the virtual cell, overload condition occurs in which the number of calls to be handled by one base station to exceed that cell site's capacity of radio channel. When an overload condition happens, the quality of service is abruptly degraded. We refer to this as the overload state and in order to quantify the degree of degradation we define two metrics, the probability of overload and the normalized average time spent in the overload state. By using the open network queueing model, we derive closed form expressions for the maximum number of calls that can be admitted into the virtual cell such that the two defined metrics are used as the acceptance criteria for call admission control.

  • PDF

Adaptive Beamwidth Control Technique for Low-orbit Satellites for QoS Performance improvement based on Next Generation Military Mobile Satellite Networks (차세대 군 모바일 위성 네트워크 QoS 성능 향상을 위한 저궤도 위성 빔폭 적응적 제어 기법)

  • Jang, Dae-Hee;Hwang, Yoon-Ha;Chung, Jong-Moon
    • Journal of Internet Computing and Services
    • /
    • v.21 no.6
    • /
    • pp.1-12
    • /
    • 2020
  • Low-Orbit satellite mobile networks can provide services through miniaturized terminals with low transmission power, which can be used as reliable means of communication in the national public disaster network and defense sector. However, the high traffic environment in the emergency preparedness situation increases the new call blocking probability and the handover failure probability of the satellite network, and the increase of the handover failure probability affects the QoS because low orbit satellites move in orbit at a very high speed. Among the channel allocation methods of satellite communication, the FCA shows relatively better performance in a high traffic environment than DCA and is suitable for emergency preparedness situations, but in order to optimize QoS when traffic increases, the new call blocking and the handover failure must be minimized. In this paper, we propose LEO-DBC (LEO satellite dynamic beam width control) technique, which improves QoS by adaptive adjustment of beam width of low-orbit satellites and call time of terminals by improving FCA-QH method. Through the LEO-DBC technique, it is expected that the QoS of the mobile satellite communication network can be optimally maintained in high traffic environments in emergency preparedness situations.

A Dynamic Queue Manager for Optimizing the Resource and Performance of Mass-call based IN Services in Joint Wired and Wireless Networks (유무선 통합 망에서 대량호 지능망 서비스의 성능 및 자원 최적화를 위한 동적 큐 관리자)

  • 최한옥;안순신
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.5B
    • /
    • pp.942-955
    • /
    • 2000
  • This paper proposes enhanced designs of global service logic and information flow for the mass-call based IN service, which increase call completion rates and optimize the resource in joint wired and wireless networks. In order to hanve this logic implemented, we design a Dynamic Queue Manager(DQM) applied to the call queuing service feature in the Service Control Point(SCP). In order to apply this logic to wireless service subscribers as well as wired service subscribers, the service registration flags between the Home Location Register(HLR) and the SCP are managed to notify the DQM of the corresponding service subscribers’ mobility. Hence, we present a dynamic queue management mechanism, which dynamically manages the service group and the queue size based on M/M/c/K queueing model as the wireless subscribers roam the service groups due to their mobility characteristics. In order to determine the queue size allocated by the DQM, we simulator and analyze the relationship between the number of the subscriber’s terminals and the drop rate by considering the service increment rate. The appropriate waiting time in the queue as required is simulated according to the above relationship. Moreover, we design and implement the DQM that includes internal service logic interacting with SIBs(Service Independent building Blocks) and its data structure.

  • PDF

A Study of Autonomous Intelligent Load Management System Based on Queueing Model (큐잉모델에 기초한 자율 지능 부하 관리 시스템 연구)

  • Lee, Seung-Chul;Hong, Chang-Ho;Kim, Kyung-Dong;Lee, In-Yong;Park, Chan-Eom
    • Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
    • /
    • v.22 no.2
    • /
    • pp.134-141
    • /
    • 2008
  • This paper presents an innovative load management technique that can effectively lower the summer peak load by adjusting the aircondition loads through smoothe coordinations between utility companies and large customers. An intelligent hierarchical load management system composed of a Central Intelligent Load Management System(CIMS) and multiple Local Intelligent Management Systems(LIMS) is also proposed to implement the reposed technique. Upon receiving a load curtailment request from the utilities, CIMS issues tokens, which can be used by each LIMS as a right to turn on the airconditioner. CIMS creates and maintains a queue for fair allocation of the tokens among the LIMS demanding tokens. By adjusting the number tokens and queue management Policies, desired load factors can be achieved conveniently. The Markov Birth and Death Process and the Balance Equations are employed in estimating various queue performances. The proposed technique is tested using a summer load data of a large apartment complex and proved to be quite effective in load management while minimizing the customer inconveniences.