• 제목/요약/키워드: Separate queue

검색결과 18건 처리시간 0.022초

계층셀구조에서 계층별 큐를 이용한 핸드오프 강제종료의 개선방안 (Improvement of Handoff dropping by Separate Queue in Hierarchical Cellular System)

  • 김영일;서주하
    • 산업기술연구
    • /
    • 제22권B호
    • /
    • pp.175-184
    • /
    • 2002
  • In this paper, we proposed separate queue scheme in each hierarchical cell for effective use of wireless channel. This method reduces the blocking rata of high speed mobile station's handoff in hierarchical cellular systems. Basically for the high speed mobile stations channels are allocated in macrocell and for the low speed mobile stations channels are allocated in microcell. In order to reduce the rate of forced handoff termination, some reservation channels are employed for the fast handoff calls in the macrocells. And the queue is located in each cell to be able to store handoff requests and takeback requests. The overflowed mobile station are able to perform takeback as soon as a corresponding channel is available.

  • PDF

카페테리아 식단을 제공하는 사업체 급식소의 식단운영 형태에 따른 대기행렬 분석 (Queueing Analysis by Menu Management Systems in Cafeteria of the Business Foodservices)

  • 양일선
    • Journal of Nutrition and Health
    • /
    • 제31권8호
    • /
    • pp.1347-1354
    • /
    • 1998
  • The purposes of this study were to : (a) anlayze wating time, service rate, arrival rate, and coustomer expectations/satisfaction in cafeteria business foodservices and (b) identify the differences in those factors between foodservices by menu managmenet systems. The samples were two business foodservices operated by contract management in Seoul. The queue, laptime , service rate, and arrival rate were measured at each foodservice by stopwatch observation. The menu type, delivery system, number of meals served , servide time, and turnover rate of each foodservic was investigated. Questionnaires were developed to survey customer expectations and satisfaction. Satistical data analysis was completed using the SAS package programs for descriptive analysis and t-test. The mean waiting time of island type dafeteria system with separte set -menu was shorter than that of the other. In both foodservices, arrival rates were not significantly different from one another , but sevice rates were significnatly high in dafeteria menu systems. The peak time of the queue was found out at combination set menu line. The separate set menu line had a higher servide rate than the combination set menu line. The mean waiting time of the island type cafeteria line was shorter than that of the straifth type . At the straight type dafeterial line, both arrival rate and service rate were higher than those of island-type. The results of this study suggested that a separate set-menu would be more desirable than a combination set-menu in case of providing set menu with cafeteria menu.

  • PDF

입출력 큐를 갖는 ATM 스위치에서의 우선순위에 관한 성능 분석 (Performance study of the priority scheme in an ATM switch with input and output queues)

  • 이장원;최진식
    • 전자공학회논문지S
    • /
    • 제35S권2호
    • /
    • pp.1-9
    • /
    • 1998
  • ATM was adopted as the switching and multiplexing technique for BISDN which aims at transmitting traffics with various characteristics in a unified network. To construct these ATM networks, the most important aspect is the design of the switching system with high performance and different service capabilities. In this paepr, we analyze the performance of an input and output queueing switch with preemptive priority which is considered to be most suitable for ATM networks. For the analysis of an input queue, we model each input queue as two separate virtual input queues for each priority class and we approximage them asindependent Geom/Geom/1 queues. And we model a virtual HOL queue which consists of HOL cells of all virtual input queues which have the same output address to obtain the mean service time at each virtual input queue. For the analysis of an output quque, we obtain approximately the arrival process into the output queue from the state of the virtual HOL queue. We use a Markov chain method to analyze these two models and obtain the maximum throughput of the switch and the mean queueing delay of cells. and analysis results are compared with simulation to verify that out model yields accurate results.

  • PDF

Exploring the Feasibility of Differentiating IEEE 802.15.4 Networks to Support Health-Care Systems

  • Shin, Youn-Soon;Lee, Kang-Woo;Ahn, Jong-Suk
    • Journal of Communications and Networks
    • /
    • 제13권2호
    • /
    • pp.132-141
    • /
    • 2011
  • IEEE 802.15.4 networks are a feasible platform candidate for connecting all health-care-related equipment dispersed across a hospital room to collect critical time-sensitive data about patient health state, such as the heart rate and blood pressure. To meet the quality of service requirements of health-care systems, this paper proposes a multi-priority queue system that differentiates between various types of frames. The effect of the proposed system on the average delay and throughput is explored herein. By employing different contention window parameters, as in IEEE 802.11e, this multi-queue system prioritizes frames on the basis of priority classes. Performance under both saturated and unsaturated traffic conditions was evaluated using a novel analytical model that comprehensively integrates two legacy models for 802.15.4 and 802.11e. To improve the accuracy, our model also accommodates the transmission retries and deferment algorithms that significantly affect the performance of IEEE 802.15.4. The multi-queue scheme is predicted to separate the average delay and throughput of two different classes by up to 48.4% and 46%, respectively, without wasting bandwidth. These outcomes imply that the multi-queue system should be employed in health-care systems for prompt allocation of synchronous channels and faster delivery of urgent information. The simulation results validate these model's predictions with a maximum deviation of 7.6%.

사물인터넷 환경에서 센서데이터의 처리를 위한 적응형 우선순위 큐 기반의 작업 스케줄링 (Adaptive Priority Queue-driven Task Scheduling for Sensor Data Processing in IoT Environments)

  • 이미진;이종식;한영신
    • 한국멀티미디어학회논문지
    • /
    • 제20권9호
    • /
    • pp.1559-1566
    • /
    • 2017
  • Recently in the IoT(Internet of Things) environment, a data collection in real-time through device's sensor has increased with an emergence of various devices. Collected data from IoT environment shows a large scale, non-uniform generation cycle and atypical. For this reason, the distributed processing technique is required to analyze the IoT sensor data. However if you do not consider the optimal scheduling for data and the processor of IoT in a distributed processing environment complexity increase the amount in assigning a task, the user is difficult to guarantee the QoS(Quality of Service) for the sensor data. In this paper, we propose APQTA(Adaptive Priority Queue-driven Task Allocation method for sensor data processing) to efficiently process the sensor data generated by the IoT environment. APQTA is to separate the data into job and by applying the priority allocation scheduling based on the deadline to ensure that guarantee the QoS at the same time increasing the efficiency of the data processing.

BLOCK LOSS DISTRIBUTION IN AN M/M/1 QUEUE WITH A CELL DISCARDING SCHEME

  • Lee, Gye-Min;Kwag, Min-Kon;Jeon, Jong-Woo;Kim, Chong-Kwon
    • 대한수학회논문집
    • /
    • 제13권3호
    • /
    • pp.635-642
    • /
    • 1998
  • When an integrated communication system is congested, we may reserve some spaces for non-realtime traffic by discarding a part of realtime traffic. That is sensible because realtime traffic is insensitive to a few losses. Several discarding schemes have been developed including Separate Queue (SQ). Under such schemes, the block loss distribution, i.e., the distribution of the number of losses within a given block which consists of successive data of a type, is important. We derive the block loss distribution of the SQ scheme and modifies the SQ scheme with a threshold.

  • PDF

Impact of Voice Activity Detection on Channel Allocation in Cellular Networks

  • Limsaksri, Wichan;Thipchaksurat, Sakchai;Varakulsiripunth, Ruttikorn
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2004년도 ICCAS
    • /
    • pp.1067-1071
    • /
    • 2004
  • In this paper, the performance enhancement algorithm of channel allocation for voice and data transmission in cellular networks is proposed. The voice activity detection has been applied to dynamic channel allocation procedure to detect and separate the silence and speech among conversation periods. Hence a data user can use the silent period of an active voice channel to transmit its information. To control the selecting of channel allocation policies, the information of number of data in transmission waiting queue has been determined in order to accept the performance measurement. In the simulation results, the improvement of the performance shows via the quality of services, which are an average delay in queue, a blocking probability, and an impact of the proposed scheme is presented in the system.

  • PDF

통계적 패킷 음성 / 데이터 다중화기의 성능 해석 (Performance Analysis of a Statistical Packet Voice/Data Multiplexer)

  • 신병철;은종관
    • 한국통신학회논문지
    • /
    • 제11권3호
    • /
    • pp.179-196
    • /
    • 1986
  • 본 논문에서는 통계적 패킷 음성/데이터 다중화기의 성능을 연구하였다. 성능해석은 음성과 데이터가 서로 분리된 한정된 queue를 사용하고, 전송에 있어서 음성이 데이터보다 우선권을 갖는 것을 가정하고, 다중화기의 출력 link를 시간 slot단위로 나누고 음성은 (M+1)-state의 Markov Process로, 데이터는 Poisson process로 modeling 하여 수행하였다. 전송시 음성신호가 데이터 신호보다 우선권을 가지므로 음성의 queueing behavior는 data에 거의 영향을 받지 않는다. 다라서 본 연구에서는 음성의 queueing behavior를 먼저 해석한 다음 data의 queueing behavior를 해석하였다. 패킷 음성 다중화기의 성능 해석은 입력상태와 buffer의 점유를 2차원의 Markov chain을 가지고 formulation하였고, 집적된 음성/data의 다중화기는 data를 추가한 3차원 Markov chain으로 하였다. 이러한 model을 사용하여 Gauss-Seidel방법으로 결과를 얻고 simulation으로 입증하였다. 이들 결과로 부터 음성 가입자의 수, 출력 link용량, 음성의 queue크기, 음성의 overflow확률에서는 서로 trade-off가 있고 data에서도 비슷한 tradeoff가 있음을 알았다. 또한 입력 traffic량과 link의 용량에 따라서 음성과 데이타간의 성능에서 서로 tradeoff가 있고, TASI의 이득이 2이상이고 음성가입자의 수가 적을 경우 데이타의 평균 지연시간은 buffer의 최대길이 보다 길음을 알아내었다.

  • PDF

한국형 e-Navigation 운영 시스템의 데이터 메시지 큐잉을 위한 AMQP 분석 (Analysis of the AMQP for Data Message Queueing of Korean e-Navigation Operation System)

  • 장원석;김범준;강문석
    • 한국항해항만학회:학술대회논문집
    • /
    • 한국항해항만학회 2017년도 추계학술대회
    • /
    • pp.22-24
    • /
    • 2017
  • 한국형 e-Navigation 운영 시스템은 해양 안전과 관련된 다양한 서비스를 제공하도록 설계되고 있다. 이 서비스들은 하나의 소프트웨어에서 제공되는 것이 아닌, 별개의 소프트웨어로 구성된다. 한국형 e-Navigation 운영시스템에 탑재되는 서비스 소프트웨어들이 통합되기 위해서는 서비스 소프트웨어간 데이터를 교환할 수 있는 데이터 메시지의 정의가 필요하다. 또한 한국형 e-Navigation 운영시스템 서비스의 동작개념에 따라 짧은 시간에 많은 메시지가 네트워크를 통해 전송될 것으로 예상된다. 이와 같은 이유로 데이터 메시지를 효율적으로 관리하기 위해서는 고빈도, 고용량 메시지를 저장하기 위한 버퍼 또는 데이터 메시지 큐가 필요하다. 이에 본 논문에서는 한국형 e-Navigation 운영 시스템에 적용될 수 있는 데이터 메시지 큐인 AMQP(Advanced Message Queuing Protocol)의 특징을 분석하고 그 결과를 보였다.

  • PDF

고속 입력큐 스위치 패브릭을 위한 3차원 라운드로빈 스케줄러 (THREE-DIMENSIONAL ROUND-ROBIN SCHEDULER FOR ADVANCED INPUT QUEUING SWITCHES)

  • Jeong, Gab-Joong;Lee, Bhum-Cheol
    • 한국정보통신학회:학술대회논문집
    • /
    • 한국해양정보통신학회 2003년도 추계종합학술대회
    • /
    • pp.373-376
    • /
    • 2003
  • 본 논문은 고성능 공통 입력버퍼를 가지는 패킷 스위치 패브릭을 위한 새로운 3차원 라운드로빈 스케줄러에 관한 연구이다. 본 논문에서 제안된 스케줄러는 각 입력 버퍼에서 각 출력 큐를 독립적으로 관리하는 분산형 공통 버퍼를 가지는 스위치 패브릭구조에서 고속으로 동작하는 스케줄러이다. 제안된 스케줄러는 M 개의 각 공통 입력 버퍼가 K개의 입력 및 출력 포트를 가지고 N 개의 가상 출력 큐를 관리하고 $K\geq$M (K$\leq$M)일 때 매 K(M) 사이클 마다 MxK 개의 가상 출력 큐들이 목적 출력포트로 패킷을 전송할 수 있도록 스케줄링한다. 대량 병렬 스케줄링 구조를 이용하여 대용량의 스위칭 포트를 가지는 고성능 스위치 패브릭에의 고속 응용을 지원한다.

  • PDF