• 제목/요약/키워드: Idle Service

검색결과 111건 처리시간 0.031초

해상무선통신환경에서 스펙트럼 공유와 우선순위를 적용한 동적스펙트럼할당 알고리즘 기술연구 (Dynamic Spectrum Allocation Algorithm for Maritime Communications using Spectrum Sharing and Priority)

  • 임무성;김경성;이연우;이성로
    • 한국통신학회논문지
    • /
    • 제35권7B호
    • /
    • pp.1001-1008
    • /
    • 2010
  • 본 논문에서는 해상무선통신환경에서 선박의 위치에 따라 속해있는 네크워크 운영자들 간의 장기간(long-term)의 우선순위(priority) 및 서비스 클래스간의 우선순위 등을 고려한 동적스펙트럼할당(DSA: Dynamic Spectrum Allocation) 알고리즘을 제안한다. 제안한 DSA 알고리즘은 네트워크 운영자간의 각기 다른 서비스 클래스의 트래픽 패턴에 대해서 동적으로 스펙트럼을 공유하고 할당하여, 기존의 고정 스펙트럼 할당방식에 비해 사용자들에게 요구하는 스펙트럼 대역폭을 충분히 제공할 수 있어 서비스 만족율을 향상시킴을 보였다. 따라서 제안한 알고리즘은 해상무선통신환경에서도 스펙트럼 공유와 동적 할당을 통한 운영이 가능함을 보여 육상의 유휴 스펙트럼 자원을 활용할 수 있음을 제시하였다.

A Genetic Algorithm Based Task Scheduling for Cloud Computing with Fuzzy logic

  • Singh, Avtar;Dutta, Kamlesh
    • IEIE Transactions on Smart Processing and Computing
    • /
    • 제2권6호
    • /
    • pp.367-372
    • /
    • 2013
  • Cloud computing technology has been developing at an increasing expansion rate. Today most of firms are using this technology, making improving the quality of service one of the most important issues. To achieve this, the system must operate efficiently with less idle time and without deteriorating the customer satisfaction. This paper focuses on enhancing the efficiency of a conventional Genetic Algorithm (GA) for task scheduling in cloud computing using Fuzzy Logic (FL). This study collected a group of task schedules and assessed the quality of each task schedule with the user expectation. The work iterates the best scheduling order genetic operations to make the optimal task schedule. General GA takes considerable time to find the correct scheduling order when all the fitness function parameters are the same. GA is an intuitive approach for solving problems because it covers all possible aspects of the problem. When this approach is combined with fuzzy logic (FL), it behaves like a human brain as a problem solver from an existing database (Memory). The present scheme compares GA with and without FL. Using FL, the proposed system at a 100, 400 and 1000 sample size*5 gave 70%, 57% and 47% better improvement in the task time compared to GA.

  • PDF

가솔린자동차의 무부하 운전에서 사이클변동에 관한 연구 (A Study on Cyclic Variation by Idling in Gasoline Vehicle)

  • 한성빈;김성모
    • 에너지공학
    • /
    • 제18권3호
    • /
    • pp.156-162
    • /
    • 2009
  • 내연기관의 연소현상을 연구하는 연구자들에게 엔진 내부의 압력값은 연소과정을 이해 할 수 있는 좋은 데이터가 된다. 본 논문에서는 압력값을 이용하여 스파크 점화기관의 무부하에서의 사이클 연소 변동의 중요한 원인이 무엇인가를 규명한다. 또한 실험기관의 연소실에서 채취한 압력 데이터는 사이클 변동의 연소 해석의 기초 데이터와 연소율 해석 등의 데이터분석을 하는데 사용되었다. 연소변수의 입력변수로써 연료, 공기, 잔류량, 등등이 사이클 변동을 결정하는데 사용되었다.

Optimal Control Policy for Replacements Involving Two Machines and One Repairman

  • Noh, Jang-Kab
    • 한국국방경영분석학회지
    • /
    • 제17권1호
    • /
    • pp.61-83
    • /
    • 1991
  • There has been a great deal of research dealing with the optimal replacement of stochastically deteriorating equipment and research in queueing systems with a finite calling population. However. there has been a lack of research which combines these two areas to deal with optimal replacement for a fixed number of machines and a limited number of repairmen. In this research, an optimal control policy for replacement involving two machines and one repairman is developed by investigating a class of age replacement policies in the context of controlling a G/M/1 queueing system with a finite calling population. The control policy to be imposed on this problem is an age-dependent control policy, described by the control limit $t^{\ast}$. The control limit is operational only when the repairman is idle; that is. if both machines are working, as soon as a machine reaches the age $t^{\ast}$ it is taken out of service for replacememt. We obtain the ${\epsilon}$-optimal control age which will minimize the long-run average system cost. An algorithm is developed that is applicable to general failure time distributions and cost functions. The algorithm does not require the condition of unimodality for implementation.

  • PDF

DSP 칩을 이용한 다중채널 R2MFC/DTMF/CCT 겸용 수신기 (A Single-Chip, Multichannel Combined R2MFC/DTMF/CCT Receiver Using Digital Signal Processor)

  • 김덕환;이형호;김대영
    • 전자공학회논문지B
    • /
    • 제31B권10호
    • /
    • pp.21-31
    • /
    • 1994
  • This paper describes the multichannel combined R2MFC/DTMF/CCT reciver which provides a signaling service functions for call processing control in digital switching system. Using the TMS320C25 DSP chip, we have implemented multi-function receriver shich processes 8 channels of R2MFC, DTMF, and CCT signals simultaneously. In order to increase the channel multiplicity of the combined receiver. R2MFC and CCT receiver were employed by discrete Fourier transform(DFT) method using Goertzel algorithm, and DTMFreceiver was employ by infinite impulse reponse(IIR) filtering method using 4KHz subsampling technique. The combined receiver has 4 function modes for each channel such as R2MFC, DTMF, CCT, and Idle modes. The function mode of each channel may be selected at any time by single-chip micro-controller(.mu.C). Hence, the number of channels assigned for each function mode can be adjusted dynamically according to the signaling traffic variations. From the experimental test results using the test-bed, it has been proved that the combined receiver statisfies all receiver satisfies all receiver specifications, and provides good channel multiplicity and performance, Therefore, it may give a great improvement than existing receiver in cost, reliability, availability, and serviceability.

  • PDF

Temporary Access Selection Technology in WIFI Networks

  • Lu, Yang;Tan, Xuezhi;Mo, Yun;Ma, Lin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제8권12호
    • /
    • pp.4269-4292
    • /
    • 2014
  • Currently, increasing numbers of access points (AP) are being deployed in enterprise offices, campuses and municipal downtowns for flexible Internet connectivity, but most of these access points are idle or redundant most of the time, which causes significant energy waste. Therefore, with respect to power conservation, applying energy efficient strategies in WIFI networks is strongly advocated. One feasible method is dynamically managing network resources, particularly APs, by powering devices on or off. However, when an AP is powered on, the device is initialized through a long boot time, during which period clients cannot be associated with it; therefore, the network performance would be greatly impacted. In this paper, based on a global view of an entire WLAN, we propose an AP selection technology, known as Temporary Access Selection (TAS). The criterion of TAS is a fusion metric consisting of two evaluation indexes which are based on throughput and battery life, respectively. TAS is both service and clients' preference specific through balancing the data rate, battery life and packet size. TAS also works well independently in traditional WLANs in which no energy efficient strategy is deployed. Moreover, this paper demonstrates the feasibility and performance of TAS through experiments and simulations with Network Simulator version 3 (NS3).

쇠퇴지역 내 신축형 서포티브주택의 특성 연구 - 미국 뉴욕시 '더 브룩' 사례를 중심으로 - (Field Visit Study of Newly Constructed Supportive Housing 'The Brook' in Decayed Area of New York, USA)

  • 이연숙;박재현;치 팅
    • KIEAE Journal
    • /
    • 제16권2호
    • /
    • pp.43-52
    • /
    • 2016
  • In the 21st century, Korea had radical economic development with accelerating urban sprawl, and following declination with social polarization. City declination makes socially vulnerable people unstable and increase homelessness. The projects revitalizing decayed area utilize local idle spaces to build new facility with creative supportive programs. The purpose of this study is to analyze inclusive characteristics of a supportive housing 'The Brook'. A field visit walk through observation and in-depth interview were utilized as research methods. The information of a representative supportive housing field will promote understanding the concept, and create base for further research. As results, state and knowhow of information concerning housing first policy, active government investment, space planning, management, social integration, service providing, architecture and so on offered to facilitate inclusive insights. In conclusion, the characteristics of supportive housing were realistically analyzed through a field research. This research is significant to introduce initially the effective supportive housing which has been practiced for 30 years in USA to that needs alternatives for the socially vulnerable in Korea.

안전재고에 관한 연구 (A Study on the Safety Stock)

  • 박병기;정종식
    • 산업경영시스템학회지
    • /
    • 제10권16호
    • /
    • pp.143-147
    • /
    • 1987
  • Safety stocks constitute one of the major means of dealing with the uncertainties associated with variation in demand and lead time. Adeguate safety facilitate production activities and help to assure customers if good service on the other hand, carrying safety storks ties up working capital on goods that sit idle. The major problem of safety stocks management thus of consists of trying to achieve an optimal balance between the other carrying cost and the costs of stock shortage. Therefore, this study aims to find safety stock level of the fixed reorder quantity system and the fixed reorder cycle system of minimizing total cost when both demand and lead time are variable. (The distribution of demand and lead time is a mere assumption that follows the normal distribution) The results can be summarized as follows. i) Safety factor on the safety stock is determined by carrying cost and the costs of stock shortage: An optimal safety stick=the costs of stork shortage($C_s$) (the carrying cost($C_h$)+the costs of stock storage($C_s$). ii) The safety stock level of the fixed reorder quantity system is ($a{\;}_p\sqrt{L}{\sigma}$) under uncertainties. iii) The safety stock level of the fixed reorder cycle system is ($a{\;}_p\sqrt{R+L{\sigma}}$) under uncertain demand and constant lead time. ($a{\;}_p\sqrt{L{\sigma}_d{\;^2+{\mu}^2L{\sigma}^2}$) under demand and lead time uncertainties.

  • PDF

CR 시스템에서 Chaotic 예측기반 채널 센싱기법 (Chaotic Prediction Based Channel Sensing in CR System)

  • 고상;이주현;박형근
    • 전기학회논문지
    • /
    • 제62권1호
    • /
    • pp.140-142
    • /
    • 2013
  • Cognitive radio (CR) has been recently proposed to dynamically access unused-spectrum. Since the spectrum availability for opportunistic access is determined by spectrum sensing, sensing control is identified as one of the most crucial issues of cognitive radio networks. Out-of-band sensing to find an available channels to sense. Sensing is also required in case of spectrum hand-off. Sensing process needs to be done very fast in order to enhance the quality of service (QoS) of the CR nodes, and transmission not to be cut for longer time. During the sensing, the PU(primary user) detection probability condition should be satisfied. We adopt a channel prediction method to find target channels. Proposed prediction method combines chaotic global method and chaotic local method for channel idle probability prediction. Global method focus on channel history information length and order number of prediction model. Local method focus on local prediction trend. Through making simulation, Proposed method can find an available channel with very high probability, total sensing time is minimized, detection probability of PU's are satisfied.

Mechanism for Fairness Service of Web Server

  • Rhee, Yoon-Jung;Park, Nam-Sup;Hyun, Eun-Sil;Kim, Jeong-Beom;Lee, Young-Ji;Yun, Ma-Ru;Hyeok Kang;Kim, Young-Jun;Kim, Tai-Yoon
    • 한국정보과학회:학술대회논문집
    • /
    • 한국정보과학회 2001년도 봄 학술발표논문집 Vol.28 No.1 (A)
    • /
    • pp.355-357
    • /
    • 2001
  • HTTP/1.1 standard reduces latencies and overhead from closing and re-establishing connections by supporting persistent connections as a default, which encourage multiple transfers of objects over one connection. HTTP/1.1, however, does not define explicitly connection-closing time but specifies a certain fixed holding time model. This model may induce wasting server’s resource when server maintains connection with the idle-state client that requests no data for a certain time. This paper proposes the mechanism of a heuristic connection management supported by the client-side under persistent HTTP, in addition to HTTP/1.1’s fixed holding time model on server-side. The client exploits the tag information within transferred HTML page so that decides connection-closing time. As a result, the mechanism allows server to use server’s resource more efficiently without server’s efforts.