• Title/Summary/Keyword: queue state

Search Result 181, Processing Time 0.02 seconds

Fuzzy Logic based Admission Control for On-grid Energy Saving in Hybrid Energy Powered Cellular Networks

  • Wang, Heng;Tang, Chaowei;Zhao, Zhenzhen;Tang, Hui
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.10
    • /
    • pp.4724-4747
    • /
    • 2016
  • To efficiently reduce on-grid energy consumption, the admission control algorithm in the hybrid energy powered cellular network (HybE-Net) with base stations (BSs) powered by on-grid energy and solar energy is studied. In HybE-Net, the fluctuation of solar energy harvesting and energy consumption may result in the imbalance of solar energy utilization among BSs, i.e., some BSs may be surplus in solar energy, while others may maintain operation with on-grid energy supply. Obviously, it makes solar energy not completely useable, and on-grid energy cannot be reduced at capacity. Thus, how to control user admission to improve solar energy utilization and to reduce on-grid energy consumption is a great challenge. Motivated by this, we first model the energy flow behavior by using stochastic queue model, and dynamic energy characteristics are analyzed mathematically. Then, fuzzy logic based admission control algorithm is proposed, which comprehensively considers admission judgment parameters, e.g., transmission rate, bandwidth, energy state of BSs. Moreover, the index of solar energy utilization balancing is proposed to improve the balance of energy utilization among different BSs in the proposed algorithm. Finally, simulation results demonstrate that the proposed algorithm performs excellently in improving solar energy utilization and reducing on-grid energy consumption of the HybE-Net.

A Privacy-preserving and Energy-efficient Offloading Algorithm based on Lyapunov Optimization

  • Chen, Lu;Tang, Hongbo;Zhao, Yu;You, Wei;Wang, Kai
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.8
    • /
    • pp.2490-2506
    • /
    • 2022
  • In Mobile Edge Computing (MEC), attackers can speculate and mine sensitive user information by eavesdropping wireless channel status and offloading usage pattern, leading to user privacy leakage. To solve this problem, this paper proposes a Privacy-preserving and Energy-efficient Offloading Algorithm (PEOA) based on Lyapunov optimization. In this method, a continuous Markov process offloading model with a buffer queue strategy is built first. Then the amount of privacy of offloading usage pattern in wireless channel is defined. Finally, by introducing the Lyapunov optimization, the problem of minimum average energy consumption in continuous state transition process with privacy constraints in the infinite time domain is transformed into the minimum value problem of each timeslot, which reduces the complexity of algorithms and helps obtain the optimal solution while maintaining low energy consumption. The experimental results show that, compared with other methods, PEOA can maintain the amount of privacy accumulation in the system near zero, while sustaining low average energy consumption costs. This makes it difficult for attackers to infer sensitive user information through offloading usage patterns, thus effectively protecting user privacy and safety.

Fault Diagnosis Method of Complex System by Hierarchical Structure Approach (계층구조 접근에 의한 복합시스템 고장진단 기법)

  • Bae, Yong-Hwan;Lee, Seok-Hee
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.14 no.11
    • /
    • pp.135-146
    • /
    • 1997
  • This paper describes fault diagnosis method in complex system with hierachical structure similar to human body structure. Complex system is divided into unit, item and component. For diagnosing this hierarchical complex system, it is necessary to implement special neural network. Fault diagnosis system can forecast faults in a system and decide from current machine state signal information. Comparing with other diagnosis system for single fault, the developed system deals with multiple fault diagnosis comprising Hierarchical Neural Network(HNN). HNN consists of four level neural network, first level for item fault symptom classification, second level for item fault diagnosis, third level for component symptom classification, forth level for component fault diagnosis. UNIX IPC(Inter Process Communication) is used for implementing HNN wiht multitasking and message transfer between processes in SUN workstation with X-Windows(Motif). We tested HNN at four units, seven items per unit, seven components per item in a complex system. Each one neural newtork operate as a separate process in HNN. The message queue take charge of information exdhange and cooperation between each neural network.

  • PDF

LOSIM : Logic Simulation Program for VLSI (LOSIM : VLSI의 설계검증을 위한 논리 시뮬레이션 프로그램)

  • Kang, Min-Sup;Lee, Chul-Dong;Yu, Young-Uk
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.26 no.5
    • /
    • pp.108-116
    • /
    • 1989
  • The simulator described here-LOSIM(LOgic SIMulator)-was developed to verify the logic design for VLSI(Very Large Scale Integrated) circuits at mixed level. In this paper, we present a modeling approach to obtain more accurate results than conventional logic simulators [5-6,9] for general elements, functional elements, transmission gates and tri-state gates using eight signal values and two gignal strengths. LOSIM has the capability which can perform timing and hazard analysis by using assignable rise and fall delays. We also prosent an efficient algorithm to accurately detectdynamic and static hazards which may be caused by the circuit delays. Our approach is based on five logic values and the scheduled time. LOSIM has been implemented on a UN-3/160 workstation running Berkeley 4.2 UNIX, and the program is written in C language. Static RAM cell and asynchronous circuit are illustrated as an example.

  • PDF

Performance improvement of ER switch congestion control algorithm for ABR service in ATM network (ATM망에서 ABR 서비스를 위한 ER 스위치 폭주 제어 알고리즘의 성능 개선)

  • 김운하;박성곤;조용환
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.9
    • /
    • pp.1890-1906
    • /
    • 1997
  • A new ER feedback switch control algorithm, called EMRCA(Explicit Max-min Rate Control Algorithm), to control the ABR services traffic in the ATM networks, is proposed in this thesis. This scheme was interpreted the ACR variation residing on between a transient state and a stable state using the two thresholds that is the $TH_{high}$ and $TH_{low}$ in the queue to detect switch nodes congestion, and decreased the difference of minimum and maximum ACR all active connection to enhance the line bandwidth utilization. The proiposed scheme used a minimum and maximum rate of all active connections to select the connection whose the congestion rate inveoked, and uses a congestion detection mechanixm to prevent some potential cogestion by regulating selected contection.s The EMRCA scheme showed ACR variation more stable that the EPRCA scheme, also reduced buffer size of the switch, and achieved higher link utilization than the EPRCA scheme.

  • PDF

MAC Scheduling Algorithm for Efficient Management of Wireless Resources in Bluetooth Systems (블루투스 시스템에서의 효율적 무선자원관리를 위한 MAC 스케쥴링 기법)

  • 주양익;권오석;오종수;김용석;이태진;엄두섭;차균현
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.9A
    • /
    • pp.702-709
    • /
    • 2003
  • In this paper, we propose an efficient and QoS-aware MAC scheduling algorithm for Bluetooth, which considers both throughput and delay performance of each Master-Slave pair in scheduling decisions, and thus, attempts to maximize overall performance. The proposed algorithm, MTDPP (Modified Throughput-Delay Priority Policy), makes up for the drawbacks of T-D PP (Throughput-Delay Priority Policy) proposed in [6] and improves the performance. Since Bluetooth employs a master-driven TDD based scheduling algorithm, which is basically operated with the Round Robin policy, many slots may be wasted by POLL or NULL packets when there is no data waiting for transmission in queues. To overcome this link wastage problem, several algorithms have been proposed. Among them, queue state-based priority policy and low power mode-based algorithm can perform with high throughput and reasonable fairness. However, their performances may depend on traffic characteristics, i.e., static or dynamic, and they require additional computational and signaling overheads. In order to tackle such problems, we propose a new scheduling algorithm. Performance of our proposed algorithm is evaluated with respect to throughput and delay. Simulation results show that overall performances can be improved by selecting suitable parameters of our algorithm.

Block Replacement Scheme based on Reuse Interval for Hybrid SSD System (Hybrid SSD 시스템을 위한 재사용 간격 기반 블록 교체 기법)

  • Yoo, Sanghyun;Kim, Kyung Tae;Youn, Hee Yong
    • Journal of Internet Computing and Services
    • /
    • v.16 no.5
    • /
    • pp.19-27
    • /
    • 2015
  • Due to the advantages of fast read/write operation and low power consumption, SSD(Solid State Drive) is now widely adopted as storage device of smart phone, laptop computer, server, etc. However, the shortcomings of SSD such as limited number of write operations and asymmetric read/write operation lead to the problem of shortened life span of SSD. Therefore, the block replacement policy of SSD used as cache for HDD is very important. The existing solutions for improving the lifespan of SSD including the LARC scheme typically employ the LRU algorithm to manage the SSD blocks, which may increase the miss rate in SSD due to the replacement of frequently used block instead of rarely used block. In this paper we propose a novel block replacement scheme which considers the block reuse interval to effectively handle various data read/write patterns. The proposed scheme replaces the block in SSD based on the recency decided by reuse interval and age along with hit ratio. Computer simulation using workload trace files reveals that the proposed scheme consistently improves the performance and lifespan of SSD by increasing the hit ratio and decreasing the number of write operations compared to the existing schemes including LARC.

Research on The Modeling of Appropriate Parking Space for Mass Traffic Generating Facilities (대량 교통유발시설의 적정주차 추정모형구축에 관한 연구)

  • 오윤표;장무렬
    • Journal of Korean Society of Transportation
    • /
    • v.19 no.3
    • /
    • pp.61-73
    • /
    • 2001
  • The purpose of this study is to simulate the suitable space of parking lots for Mass traffic instigating facilities in Pusan. After the suitable scale of parking lots estimate using GPSS, one of the Queue Simulation, with the average arriving time and the average parking time at parking lots, the formula is simulated by the Regression model to relate a total floor area and the suitable number of parking lots. The improved criteria or present parking lots is needed to prevent the unnecessary vehicles and improve the efficiency of land use. The suitable scale of parking lots estimate just with the state of using the parking lots in this study. but it is necessary to consider land use, traffic condition, commercial area etc.

  • PDF

A Study on QoS Performance Based on CBQ Using Real-time Transport Protocol (RTP를 이용한 CBQ기반의 QoS 성능에 관한 연구)

  • 하미숙;박승섭
    • Proceedings of the Korean Institute of Navigation and Port Research Conference
    • /
    • 2004.04a
    • /
    • pp.43-48
    • /
    • 2004
  • RTP that is proposed supplement of real-time services on internet environment, as Real-time Transport Protocol, is the protocol that for the purpose of sending data of stream type. RTP and RTCP(Real-time Transport Control Protocol) basically work at the same time, RTCP serves with state information of network at present. RTP has important properties of a transport protocol that runs on end-to-end systems and provides demultiplexing. It also offer reliability and protocol-defined flow/congestion control that transport protocol like TCP can not provides. In this paper, we look around concept and construction of Differentiated sen1ice tint run on RTP and by setting parameters of packet transfer method be used CBQ(Class-Based Queuing) for packet transfer on Differentiated service, each service queue controls properly through packet scheduling method, such as WRR(Weighted Round Robin) and PRR(Packet-by-packet Round Robin) all service classes do not experience the starvation and confirm the performance through computer simulation to achieve fairly scheduling.

  • PDF

Effective Scheduling Algorithm using Queue Separation and Packet Segmentation for Jumbo Packets (큐 분리 및 패킷 분할을 이용한 효율적인 점보패킷 스케쥴링 방법)

  • 윤빈영;고남석;김환우
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.9A
    • /
    • pp.663-668
    • /
    • 2003
  • With the advent of high speed networking technology, computers connected to the high-speed networks tend to consume more of their CPU cycles to process data. So one of the solutions to improve the performance of the computers is to reduce the CPU cycles for processing the data. As the consumption of the CPU cycles is increased in proportion to the number of the packets per second to be processed, reducing the number of the packets per second by increasing the length of the packet is one of the solutions. In order to meet this requirement, two types of jumbo packets such as jumbograms and jumbo frames have already been standardized or being discussed. In case that the jumbograms and general packets are interleaved and scheduled together in a router, the jumbogrms may deteriorate the QoS of the general packets due to the transfer delay. They also frequently exhaust the memory with storing the huge length of the packets. This produces the congestion state easily in the router that results in the loss of the packets. In this paper, we analyze the problems in processing the jumbo packets and suggest a noble solution to overcome the problems.