• Title/Summary/Keyword: 대기버퍼사용

Search Result 31, Processing Time 0.026 seconds

The Performance Analysis of System according to use the Waiting Buffer and the Reserved Resource for Handover Calls (핸드오버 호를 위한 대기 버퍼와 자원예약에 따른 시스템 성능 분석)

  • Seong, Hong-Seok
    • 전자공학회논문지 IE
    • /
    • v.48 no.4
    • /
    • pp.47-52
    • /
    • 2011
  • In this paper, we analyse the performance of cellular system for call admission method considering to various service types. The call admission control method using the effective bandwidth concept is employed in this paper. In addition, the bandwidth for a new calls and a handover calls is allocated by taking account of the blocking rate of new calls and the dropping rate of handover calls. We reserved wireless resource and used waiting buffer for hanover calls. We simulated using computer for the performance analysis of system.

An Efficient Load Balancing Technique Based on the Dynamic Buffer Partitioning in Cluster Based VOD Senders (클러스터 기반의 VOD서버 상에서 동적 버퍼 분할을 이용한 효율적인 부하분산 기법)

  • 권춘자;김영진;최황규
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2002.04a
    • /
    • pp.244-246
    • /
    • 2002
  • 클러스터 기반의 VOD 서버는 동시에 여러 사용자에게 실시간으로 고품질 서비스를 위해 정교한 부하 분산 기술과 버퍼관리 기술을 요구한다. 본 논문은 클러스터 기반 VOD 서버에서 동적 버퍼 분할을 이용한 새로운 부하분산 기법을 제안한다. 제안된 기법은 사용자 요청을 처리하는 서비스 노드간의 버퍼 성능과 디스크 접근 빈도를 고려하여 노드 부하를 고르게 분산한다. 또한 동적 버퍼 분할 기법은 동일한 연속 매체에 접근하려는 여러 사용자에게 평균 대기시간을 감소시킬 수 있도록 버퍼를 동적으로 분할한다. 각 서비스 노드에서 동적 버퍼 분할로 발생하는 버퍼 정보를 유지함으로써 각 서비스 노드의 버퍼 재사용을 극대화할 수 있다. 시뮬레이션을 통해 제안된 기법이 효율적인 버퍼 관리로 노드 부하 균등화, 사용자 평균 대기시간 감소, 병행 사용자 수 증가 등의 성능 향상을 얻었다.

  • PDF

The Performance Analysis of System by Variable Effective Bandwidth According to use The Reserved Resource and The Waiting Buffer (자원예약과 호 대기 버퍼 사용에 따른 가변등가대역에 의한 시스템 성능 분석)

  • Seong, Hong-Seok
    • 전자공학회논문지 IE
    • /
    • v.46 no.3
    • /
    • pp.42-47
    • /
    • 2009
  • In CDMA system, the call admission control method using the variable effective bandwidth concept is employed in this paper. The bandwidth for a new call and a handoff call is allocated by considering the number of mobile station being served and dynamically assigned by taking account of the blocking rate of new calls and the dropping rate of handoff calls. There is reserved resource for handoff call. In the case radio resource is insufficient, a new call and a handoff call stand by in buffer for constant time. When radio resource come about, the waiting call is allocated the resource. I analyze the performance of system according to existence and nonexistence of buffer by a simulation study.

A Queueing Model for Performance Analysis of SPAX Inter-Node Communication System (고속병렬컴퓨터1)(SPAX) 노드간 통신시스템의 성능분석을 위한 대기행렬모형)

  • Cho, Il-Yeon;Lee, Jae-Kyung;Kim, Hae-Jin
    • The Transactions of the Korea Information Processing Society
    • /
    • v.5 no.1
    • /
    • pp.33-39
    • /
    • 1998
  • A queueing model for performance evaluation of finite buffered inter-node communication system is proposed in this paper. Each components are modeled as M/M/I/B queues to obtain the steady state probabilities and ar-rival rate and to analyze finite buffer behavior, The overall sysrem is integrated as series queues with blocking. Average delay and throughput are the performance measures studied in this analysis. The analytical results are first validated through simulation. Next, the effect of buffer length is discussed using the proposed model.

  • PDF

A Load Balancing Technique Based on the Dynamic Buffer Partitioning in a Clustered VOD Server (동적 버퍼 분할을 사용한 클러스터 VOD 서버 부하 분산 기법)

  • Kwon, Chun-Ja;Choi, Hwang-Kyu
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2002.04a
    • /
    • pp.217-220
    • /
    • 2002
  • 본 논문은 클러스터 기반의 VOD 서버에서 동적 버퍼 분할을 이용한 새로운 부하 분산 기법을 제안한다. 제안된 기법은 사용자 요청을 처리하는 서비스 노드간의 버퍼 성능과 디스크 접근 빈도를 고려하여 전체 부하를 고르게 분산하도록 한다. 또한 동적 버퍼 분할 기법은 통일한 연속매체에 접근하려는 여러 사용자에게 평균 대기시간을 감소시킬 수 있도록 버퍼를 동적으로 분할한다. 시뮬레이션을 통한 성능분석 결과에서 제안된 기법은 기존의 기법보다 부하량을 적절히 조절하면서 평균 대기시간을 감소시키고 각 노드의 처리량과 병행 사용자 수를 증가시킴을 보인다.

  • PDF

Dynamic Buffer Partitioning Technique for Efficient Continuous Media Service in VOD Servers (VOD 서버에서 효율적인 연속미디어 서비스를 위한 동적 버퍼 분할 기법)

  • Kwon, Chun-Ja;Choi, Chang-Yeol;Choi, Hwang-Kyu
    • The KIPS Transactions:PartA
    • /
    • v.9A no.2
    • /
    • pp.137-146
    • /
    • 2002
  • In VOD server, in order to guarantee playback of continuous media, such as video, without hiccups for multiusers, the server has to manage its buffer sophisticatedly by prefeching a part of the data into the buffer As the continuous media data buffered by one user can be used again by the others, the number of disk accesses is reduced and then the latency time far the users is also reduced. In this paper, we propose a new buffer management technique for continuous media in VOD server. Our basic algorithm partitions the buffer into groups and then a group of buffer which has the lowest utilization is chosen and partitioned again for a new user. The basic algorithm is extended for supporting multiple streams and clip data and for providing VCR functions. Our proposed technique is able to increase in the number of concurrent users as increasing the utilization of the buffer and to minimize the average waiting time for multiuser accesses as the bandwidth of storage is slowly reached to the limit. In the simulation study for comparing the performance of our technique with that of the existing techniques, we show that the average waiting time is reduced mere than 50% and the number of concurrent users increases by 1 ∼5% as compared with those of the exiting techniques.

Traffic Characteristics of the DQDB-based B-ISDN access network (DQDB방식을 사용한 B-ISDN 엑세스망의 트래픽 특성 연구)

  • 김화종;양은샘
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.18 no.5
    • /
    • pp.675-684
    • /
    • 1993
  • In this paper, we analyze a traffic control schemes at the interworking unit(IWU) of the IEEE 802.6 DQDB MAN and the B-ISDN, and estimate its performance via computer simulation. We also study traffic management, relaying sublayers for the cases of four service classes defined in the B-ISDN. As for performance criteria, we consider slot waiting time, slot loss rate, and the fairness between DQDB nodes in access networks. We propose a simple control algorithm that decreases the waitint delay at the OWU. With the buffer size of 40 [slots] at the IWU, we have found that the slot loss rate was nearly zero at traffic load below 0.9, and the slot waiting time became less than 15 slot times.

  • PDF

Hybrid Multicast/Broadcast Algorithm for Highly-Demanded Video Services with Low Complexity (Highly-Demanded 비디오 서비스를 위한 낮은 복잡도의 혼합 멀티캐스트/브로드캐스트 알고리즘)

  • Li, Can;Bahk, Sae-Woong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.1B
    • /
    • pp.101-110
    • /
    • 2011
  • With the deployment of broadband networking technology, many clients are enabled to receive various Video on Demand (VoD) services. To support many clients, the network should be designed by considering the following factors: viewer's waiting time, buffer requirement at each client, number of channel required for video delivery, and video segmentation complexity. Among the currently available VoD service approaches, the Polyharmonic and Staircase broadcasting approaches show best performance with respect to each viewer's waiting time and buffer requirement, respectively. However, these approaches have the problem of dividing a video into too many segments, which causes very many channels to be managed and used at a time. To overcome this problem, we propose Polyharmonic-Staircase-Staggered (PSS) broadcasting approach that uses the Polyharmonic and Staircase approaches for the head part transmission and the Staggered approach for the tail part transmission. It is simple and bandwidth efficient. The numerical results demonstrate that our approach shows viewer's waiting time is comparable to that in the Harmonic approach with a slight increase in the bandwidth requirement, and saves the buffer requirement by about 60\% compared to the Harmonic broadcasting approach by simply adjusting the video partitioning coefficient factor. More importantly, our approach shows the best performance in terms of the number of segments and the number of channels managed and used simultaneously, which is a critical factor in real operation of VoD services. Lastly, we present how to configure the system adaptively according to the video partitioning coefficient.

Exploiting Flash Memory for Reducing Disk Energy Consumption in Video Playback. (동영상 재생에서 디스크 에너지 감소를 위한 플래시 메모리 활용 기법)

  • Kim, Jaewoo;Song, Minseok
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2009.04a
    • /
    • pp.724-726
    • /
    • 2009
  • 본 논문에서는 하드디스크 탑재 시스템에서의 동영상 재생시 DRAM과 플래시 메모리를 버퍼로 사용하여, 하드디스크를 가능한 오래 저전력 모드로 동작시켜 하드디스크가 소비하는 에너지를 줄일 수 있는 방법에 대해 제안하고 모델링한다. 기존의 시스템에서는 동영상 플레이어의 요청이 있을 때마다 하드디스크에서 데이터를 제공하였기 때문에 하드디스크에서의 에너지 소모가 많았다. 모델링에서 사용한 방법은 동영상 플레이어가 데이터를 요청하기전에 데이터를 DRAM과 플래시 메모리에 선반입하여 하드디스크를 대기모드로 진입시키고, 요청된 데이터를 플래시 메모리에서 처리하는 방법이다. 모델링 결과 제안한 방법은 버퍼를 사용하지 않은 경우와 비교하여 에너지 감소율이 월등한 것으로 나타났다.

Low Power Consumption Technology for Streaming Data Playback in the IPTV Set-top Box (IPTV 셋톱박스 환경에서 스트리밍 데이터 재생을 위한 전력 소모 감소 기법)

  • Go, Young-Wook;Yang, Jun-Sik;Kim, Deok-Hwan
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.47 no.1
    • /
    • pp.30-40
    • /
    • 2010
  • The hard disk is one of the most frequently used storage in IPTV sep-top box. It has large storage capacity and provides fast I/O speed compared to its price whereas it causes high power consumption due to mechanical characteristics of spindle motor. In order to play streaming data in the set-top box, spindle motor of hard disk keeps active mode and it causes high power consumption. In this paper, We propose an offset-buffering and multi-mode spin-down method to reduce power consumption for streaming data playback. The offset-buffering inspects the user's viewing pattern and performs buffering based on the analysis of viewing pattern. So, it can maintain the status of spindle motor as idle mode for long time. Besides, it can reduce power consumption by spinning down according to offset-buffer size. The experimental result shows that proposed offset-buffering and multi mode spin-down method is about 28.3% and 12.5% lower than the full-Buffering method in terms of the power consumption and spin-down frequency, respectively.