• Title/Summary/Keyword: 버퍼 할당

Search Result 150, Processing Time 0.024 seconds

Access Frequency Based Selective Buffer Cache Management Strategy For Multimedia News Data (접근 요청 빈도에 기반한 멀티미디어 뉴스 데이터의 선별적 버퍼 캐쉬 관리 전략)

  • Park, Yong-Un;Seo, Won-Il;Jeong, Gi-Dong
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.9
    • /
    • pp.2524-2532
    • /
    • 1999
  • In this paper, we present a new buffer pool management scheme designed for video type news objects to build a cost-effective News On Demand storage server for serving users requests beyond the limitation of disk bandwidth. In a News On Demand Server where many of users request for video type news objects have to be serviced keeping their playback deadline, the maximum numbers of concurrent users are limited by the maximum disk bandwidth the server provides. With our proposed buffer cache management scheme, a requested data is checked to see whether or not it is worthy of caching by checking its average arrival interval and current disk traffic density. Subsequently, only granted news objects are permitted to get into the buffer pool, where buffer allocation is made not on the block basis but on the object basis. We evaluated the performance of our proposed caching algorithm through simulation. As a result of the simulation, we show that by using this caching scheme to support users requests for real time news data, compared with serving those requests only by disks, 30% of extra requests are served without additional cost increase.

  • PDF

Fair Bandwidth Allocation in Core-Stateless Networks (Core-Stateless망에서의 공정한 대역폭 할당 방식)

  • Kim Mun-Kyung;Park Seung-Seob
    • The KIPS Transactions:PartC
    • /
    • v.12C no.5 s.101
    • /
    • pp.695-700
    • /
    • 2005
  • To provide the fair rate and achieve the fair bandwidth allocation, many per-flow scheduling algorithms have been proposed such as fair queueing algorithm for congestion control. But these algorithms need to maintain the state, manage buffer and schedule packets on a per-flow basis; the complexity of these functions may prevent them from being cost-effectively implemented. In this paper, therefore, to acquire cost-effectively for implementation, we propose a CS-FNE(Core Stateless FNE) algorithm that is based on FM(Flow Number Estimation), and evaluated CS-FNE scheme together with CSFQ(Core Stateless Fair Queueing), FRED(Fair Random Early Detection), RED(Random Early Detection), and DRR(Dynamic Round Robin) in several different configurations and traffic sources. Through the simulation results, we showed that CS-FNE algorithm can allocate fair bandwidth approximately than other algorithms, and CS-FNE is simpler than many per-flow basis queueing mechanisms and it can be easily implemented.

A study on the optimization of network resource allocation scheme based on access probabilities (접근확률 기반의 네트워크 자원할당방식의 최적화에 관한 연구)

  • Kim Do-Kyu
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.10 no.8
    • /
    • pp.1393-1400
    • /
    • 2006
  • This paper optimizes the access probabilities (APs) in a network resource allocation scheme based on access probabilities in order that the waiting time and the blocking probability are minimized under the given constraints, and obtains its performance. In order to optimize APs, an infinite number of balance equations is reduced to a finite number of balance equations by applying Neuts matrix geometric method. And the nonlinear programming problem is converted into a linear programming problem. As a numerical example, the performance measures of waiting time and blocking probability for optimal access probabilities and the maximum utilization under the given constraints are obtained. And it is shown that the scheme with optimal APs gives more performance build-up than the strategy without optimization.

Adaptive Dynamic Slot Assignment of VBR Traffics Using In-band Parameters in Wireless ATM (무선 ATM에서 In-Band 파라미터를 이용한 VBR 트래픽의 적응적 슬롯 할당)

  • Paek, Jong-Il;Jun, Chan-Yong;Kim, Young-Chul
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.39 no.7
    • /
    • pp.30-37
    • /
    • 2002
  • In this paper, we propose a new adaptive slot assignment algorithm called In-VDSA in order to guarantee the QoS(Quality of Service) of VBR(Variable Bit Rate) traffics in wireless ATM and maximize efficiency in use of wireless channels. In the proposed algorithm, the status of terminal buffers is encoded in signed number on the GFC(Generic Flow Control) field of an ATM cell header and piggybacked. And also, the number of slots to be assigned to the next frame is adjusted effectively, which is different to methods in the conventional slot assignment algorithms. As a result, we can guarantee QoS such as CLR(Cell Loss Rate) and cell delay and achieve the higher utilization of channels. The validity of the proposed algorithm has been justified in performance by analysis through simulation results using the BONeS tool and comparison with conventional methods.

Bandwidth Allocation and Performance Analysis of MAC Protocol for Ethernet PON (Ethernet PON의 MAC프로토콜의 대역폭 할당 및 성능 분석)

  • 엄종훈;장용석;김성호
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.40 no.7
    • /
    • pp.261-272
    • /
    • 2003
  • An Ethernet PON(Passive Optical Network) is an economical and efficient access network that has received significant research attention in recent years. A MAC(Media Access Control) protocol of PON , the next generation access network, is based on TDMA(Time Division Multiple Access) basically and can classify this protocol into a fixed length slot assignment method suitable for leased line supporting QoS(Quality of Service) and a variable length slot assignment method suitable for LAN/MAN with the best effort. For analyzing the performance of these protocols, we design an Ethernet PON model using OPNET tool. To establish the maximum efficiency of a network, we verify a MAC protocol and determine the optimal number of ONUs(Optical Network Unit) that can be accepted by one OLT(Optical Line Terminal) and propose the suitable buffer size of ONU based on analyzing the end-to-end Ethernet delay, queuing delay, throughput, and utilization.

Resource Allocation and Transmission Control Scheme using Window-Based Dynamic Bandwidth Smoothing Method (윈도우 기반 동적 대역폭 평활화 방식을 이용한 자원 할당 및 전송 제어 기법)

  • Kim Hyoung-Jin;Go Sung-Hyun;Ra In-Ho
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.9 no.5
    • /
    • pp.943-950
    • /
    • 2005
  • Recently, many of researches on stream transmission for satisfying each of different real-time transmission condition of the multimedia data that demands various service quality through high-speed networks have been studied actively. In this paper, we design a scheme that discriminately reserves the network resources for the transmission of each multimedia application and propose a bandwidth allocation scheme for improving the utilization ratio of free resources. And we also propose a pipelining scheme for providing flexible real-time transmission. The proposed schemes can be used to support a real-time transmission by applying feedback transmission control method based on receiving buffer for guaranteeing the synchronization conditions requested by the multimedia data. Moreover, we propose a transmission control scheme that can take the amount of network resources down to the minimum amount within the range of permissible error-range under the guarantee with no quality degradation simultaneously when the bottleneck is caused by the network congestion. Finally, we propose a dynamic bandwidth smoothing scheme that can smooth the maximum bandwidth to the demand of each video steam for giving continuous transmission to the delay sensitive video steam between senders and receivers.

Packet Delay and Loss Analysis of Traffic with Delay Priority in a DBA Scheme of an EPON (EPON의 DBA방안에서 지연 우선순위를 갖는 트래픽의 재킷 손실률과 지연 성능 분석)

  • Park Chul-Geun;Shim Se-Yong;Jung Ho-Seok
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.8B
    • /
    • pp.507-513
    • /
    • 2005
  • As the rapid increasement of the number of internet users has occured recently, many multimedia application services have been emerging. To improve quality of service, traffic can be suggested to be classified with priority in EPON(Ethernet Passive Optical Network), which is supporting the multimedia application services. In this paper, multimedia application services treat bandwidth classifying device in serving both delay sensitive traffic for real-time audio, video and voice data such as Von(Voice over Internet Protocol), and for real-time traffic such as BE(Best Effort). With looking through existing mechanisms, new mechanism to improve the quality will be suggested. The delay performances and packet losses of traffic achieved by supporting bandwidth allocation of upstream traffic in suggested mechanism will be analized with simulations.

Bandwidth Allocation Algorithm for Improving QoS in EPON with Sleep Mode (수면 모드를 이용하는 EPON에서 QoS 향상을 위한 대역 할당 알고리즘)

  • Yang, Won-Hyuk;Jeong, Jin-Hyo;Kim, Young-Chon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.7B
    • /
    • pp.489-498
    • /
    • 2012
  • Recently, as the interest in Green IT is exponentially increased, EPON with sleep mode has been studied to reduce energy consumption in access network. In oder to guarantee cyclic sleep for ONU(Optical Network Units), EPON with sleep mode transmits upstream and downstream data at the same time. However, since conventional algorithms for sleep mode in EPON allocate bandwidth to each ONU according to upstream bandwidth request, the QoS of downstream data is not guaranteed when the offered load of OLT is larger than that of ONU. In this paper, we propose a bandwidth allocation algorithm for improving QoS in EPON with sleep mode. The proposed algorithm compares its size with an upstream request of ONU when a downstream buffer in the OLT exceeds a QoS threshold. And then it allocates selectively a bandwidth that satisfies the required QoS between the bandwidth request of ONU and OLT. Therefore, the proposed algorithm can save energy through cyclic sleep of ONUs while guaranteeing the QoS of up/downstream data. In order to evaluate the proposed algorithm, we perform simulation in terms of total sleep time of ONUs, queueing delay between OLT and ONU, and the utilization of allocated bandwidth at OLT through OPNET.

Performance Analysis of Buffer Allocation Schemes for Controlled Transfer Service in ATM Networks (ATM 망에서 CT 서비스를 위한 버퍼 할당 방식의 성능 분석)

  • 김병철;조유제안윤영권율
    • Proceedings of the IEEK Conference
    • /
    • 1998.10a
    • /
    • pp.261-264
    • /
    • 1998
  • Controlled transfer (CT) capability, a new ATM transfer capability (ATC) for high-speed data applications which using credit-based flow control, has recently been proposed and studied in ITU-T. In this paper, we review the existing dyanmic buffer allocation schemes and propose an improved scheme. Also, we compare the performances of the existing buffer allocation methods such as static allocation, flow controlled virtual channels (FCVC), and zero queueing flow control (ZQFC) with the proposed method through simulation. Simulation results show that the proposed scheme exhibits a better performance than the existing schemes in terms of throughput, fairness, queue length and link utilization.

  • PDF

A Design of Object Model for Multimedia Streaming Transmission based on IP (IP 기반의 멀티미디어 스트리밍 전송을 위한 객체 모델 설계)

  • Ryu, Hyoung-Seok;Ryu, In-Ho;Kim, Tae-Hyoung;Song, Je-Ho;Kim, Hyoung-Jin
    • Proceedings of the KAIS Fall Conference
    • /
    • 2010.11a
    • /
    • pp.443-446
    • /
    • 2010
  • 최근 들어 데이터, 음성 위주의 통신 산업과 영상중심의 방송 산업이 빠르게 융합되고 있다. 따라서 본 논문에서는 IP 기반의 멀티미디어 스트리밍 전송이 가능하도록 네트워크 대역폭의 사용을 최소화하여 특정 채널에 대한 멀티미디어 서비스뿐만 아니라 여러 채널을 동시에 사용자가 서비스 받을 수 있도록 멀티 접근 방법을 제안하고자 한다. 또한 네트워크의 지연을 흡수 할 수 있는 버퍼링 기법, 안정적인 채널 대역폭 할당 및 유지를 위한 객체 모델을 설계 하고자 한다.

  • PDF