• Title/Summary/Keyword: buffer time

Search Result 1,368, Processing Time 0.035 seconds

Design and Implementation of an Efficient Buffer Replacement Method for Real-time Multimedia Databases Environments (실시간 멀티미디어 데이터베이스 환경을 위한 효율적인 버퍼교체 기법 설계 및 구현)

  • 신재룡;피준일;유재수;조기형
    • Journal of Korea Multimedia Society
    • /
    • v.5 no.4
    • /
    • pp.372-385
    • /
    • 2002
  • In this paper, we propose an efficient buffer replacement method for the real-time multimedia data. The proposed method has multi level priority to consider the real-time characteristics. Each priority level is divided into a cold data set that is likely to be referenced for the first time and a hot data set that is likely to be re-referenced. An operation to select the victim data is sequentially executed from the cold set with the minimum priority level to the hot set with the maximum Priority level. It is chosen only at the lower level than or equal to the priority of the transaction that requests a buffer allocation. In the cold set, our method selects a media that has the maximum size in the level for a target of victim first of all. And in the hot set, our method selects a medium that has the maximum interval of the reference first of all. Since it maintains many popular media in the limited buffer space, the buffer hit ratio is increased. It also manages many service requests. As a result, our method improves the overall performance of the system. We compare the proposed method with the Priority-Hints method in terms of the buffer hit ratio and the deadline missing ratio of transactions. It is shown through the performance evaluation that our method outperforms the existing methods.

  • PDF

LiNbO3 integrated optic devices with an UV-curable polymer buffer layer

  • Jeong, Woon-Jo;Kim, Seong-Ku;Park, Gye-Choon;Lee, Jin
    • Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
    • /
    • 2002.05b
    • /
    • pp.111-118
    • /
    • 2002
  • A new lithium niobate optical modulator with a polymer buffer layer on Ni in-diffused optical waveguide is proposed for the fist time, successfully fabricated and examined at a wavelength of 1.3 mm. By determining the diffusion parameters of Ni in-diffused waveguide to achieve more desirable mode size which is well matched to the mode in the fiber, the detailed results on the achievement of high optical throughput are reported. In addition, the usefulness of polymer buffer layer which can be applicable to a buffer layer in Ni in-diffused waveguide devices is demonstrated. Several sets of channel waveguides fabricated on Z-cut lithium niobate by Ni in-diffusion were obtained and on which coplanar traveling-wave type electrodes with a polymer-employed buffer layer were developed by a conventional fabrication method for characterizing of electro-optical performances of the proposed device. The experimental results show that the measured half-wave voltage is of ~10 V and the total measured fiber-to-fiber insertion loss is of ~6.4 dB for a 40 mm long at a wavelength of =1.3 mm, respectively. From the experimental results, it is confirmed that the polymer-employed buffer layer in LiNbO3 optical modulator can be a substitute material instead of silicon oxide layer which is usually processed at a high temperature of over $300^{\circ}C$. Moreover, the fabrication tolerances by using polymer materials in LiNbO3 optical modulators are much less strict in comparison to the case of dielectric buffer layer.

  • PDF

Simulation and Analysis of Base Station Buffer in UMTS Systems (UMTS 시스템에서 기지국 버퍼에 대한 실험 및 분석)

  • Kim, Nam-Gi;Park, In-Yong;Jeong, Hye-Yeong;Yun, Hyeon-Su
    • The KIPS Transactions:PartA
    • /
    • v.9A no.3
    • /
    • pp.317-326
    • /
    • 2002
  • The mobile telecommunication system has been growing exponentially after 1990s due to the high population in a city and the growth of mobile user. In this time, the current mobile system mainly concentrates on the voice communication. However, in the next generation, mobile users want to get very diverse services via mobile terminal such as the Internet access, web access, multimedia communication, and etc. For this reason, the next generation system, such as the UMTS system, has to support the packet data service and it will play the major role in the system. In different from the voice service, the packet data service should store packet data in a buffer at base station before it forwards. Consequently, the performance closely related to the buffer management and its operation. However, until now, there are rare study on the buffer behavior and management. In this paper, we will observe the buffer behavior in the UMTS systems by using simulation and analyze the results. For this research, we generate packet data traffics and model the UMTS system for a simulation. Then we analyze the buffer state by a simulation and calculate the buffer overflow probability by mathematical methods.

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.

A Dynamic Buffer Allocation Scheme in Video-on-Demand System (주문형 비디오 시스템에서의 동적 버퍼 할당 기법)

  • Lee, Sang-Ho;Moon, Yang-Sae;Whang, Kyu-Young;Cho, Wan-Sup
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.28 no.9
    • /
    • pp.442-460
    • /
    • 2001
  • In video-on-demand(VOD) systems it is important to minimize initial latency and memory requirements. The minimization of initial latency enables the system to provide services with short response time, and the minimization of memory requirements enables the system to service more concurrent user requests with the same amount of memory. In VOD systems, since initial latency and memory requirement increase according to the increment of buffer size allocated to user requests, the buffer size allocated to user requests must be minimized. The existing static buffer allocation scheme, however, determines the buffer size based on the assumption that thy system is in fully loaded state. Thus, when the system is in partially loaded state, the scheme allocates user requests unnecessarily large buffers. This paper proposes a dynamics buffer allocation scheme that allocates user requests the minimum buffer size in fully loaded state as well as a partially loaded state. This scheme dynamically determines the buffer size based on the number of user requests in service and the number of user requests arriving while servicing current requests. In addition, through analyses and simulations, this paper validates that the dynamics buffer allocation outperforms the statics buffer allocation in initial latency and the number of concurrent user requests that can be supported. Our simulation results show that, in proportion to the static buffer allocation scheme, the dynamic buffer allocation scheme reduces the average initial latency by 29%~65%, and in a systems having several disks. increases the average number of concurrent user requests by 48%~68%. Our results show that the dynamic buffer allocation scheme significantly improves the performance and reduce the capacity requirements of VOD systems.

  • PDF

Performance Analysis of Buffer Aware Scheduling for Video Services in LTE Network

  • Lin, Meng-Hsien;Chen, Yen-Wen
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.9
    • /
    • pp.3594-3610
    • /
    • 2015
  • Recent advancements in broadband wireless communication technologies enable mobile users to receive video streaming services with various smart devices. The long term evolution (LTE) network provides high bandwidth and low latency for several emerging mobile applications. This paper proposes the buffer aware scheduling (BAS) approach to schedule the downlink video traffic in LTE network. The proposed BAS scheme applies the weighting function to heuristically adjust the scheduling priority by considering the buffer status and channel condition of UE so as to reduce the time that UE stays in the connected state without receiving data. Both of 1080P and 2160P resolution video streaming sources were applied for exhaustive simulations to examine the performance of the proposed scheme by comparing to that of the fair bandwidth (FB) and the best channel quality indicator (CQI) schemes. The simulation results indicate that the proposed BAS scheme not only achieves better performance in power saving, streaming delivery time, and throughput than the FB scheme while maintaining the similar performance as the best CQI scheme in light traffic load. Specifically, the proposed scheme reduces streaming delivery time and generates less signaling overhead than the best CQI scheme when the traffic load is heavy.

Performance Relation Analysis of CLR, Buffer Capacity and Delay Time in the ATM Access Node (ATM 접속노드에서 셀 손실율과 버퍼용량 및 지연시간의 상관관계 분석)

  • 이하철;이병섭
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.10C
    • /
    • pp.945-950
    • /
    • 2002
  • In this paper the performance evaluations on Asynchronous Transfer Mode(ATM) access node are performed in the ATM access network which consists of access node and channel. The performance factors of access node are Cell Loss Ratio(CLR), buffer capacity and delay time. Both the ATM cell-scale queueing model and burst-scale queueing model are considered as the traffic model of access node for various traffic types such as Constant Bit Rate(CBR), Variable Bit Rate(VBR) and random traffic in the ATM access networks. Based on these situations, the relation of CLR, buffer capacity and delay time is analyzed in the ATM access node.

Buffer Management Method for Multiple Projects in the CCPM-MPL Representation

  • Nguyen, Thi Ngoc Truc;Takei, Yoshinori;Goto, Hiroyuki;Takahashi, Hirotaka
    • Industrial Engineering and Management Systems
    • /
    • v.11 no.4
    • /
    • pp.397-405
    • /
    • 2012
  • This research proposes a framework of buffer management for multi-project systems in the critical chain project management (CCPM) method, expressed in the form of max-plus linear (MPL) representation. Since time buffers are inserted in the projects for absorbing uncertainties in task durations and protecting the completion times, the proposed method provides a procedure for frequently surveying the rates of consumed buffers and the rate of elapsed times. Their relation expresses the performance of the projects which is plotted on a chart through the completed processes. The chart presents the current performance of the projects and their interaction, which alerts managers to make necessary decisions at the right time for managing each project and the entire multi-project system. The proposed framework can analyze the complex system readily, and it enables managers to make an effective decision on scheduling. The effectiveness of the framework is demonstrated through a numerical example.

Timed-Transfer of Buses (동시환승(Timed-Transfer) 버스시스템)

  • 고승영
    • Journal of Korean Society of Transportation
    • /
    • v.13 no.4
    • /
    • pp.105-115
    • /
    • 1995
  • This paper deals with an operation concept of "time-transfer of buses", in which buses arrive a transfer center at the same time and allow passengers to transfer to other bus lines, so that passengerscan go anywhere all the timed-transfere buses operate with only one transfer. This timed-transfer bus system is known as an efficient operating technique which can be adopted in an area with sparsely distrubuted bus demand. A model of timed-transfer is estabilished in terms of vaious factors such as the expected(or average) arrival time, distribution of arrival time, timed-transfer cycle, shceduled departure time, etc. It is assumed that the objective of timed-transfer bus system is to minimize the total transfer waiting time. The optimal schedualed arrival time or buffer time(time required to arrive ealy in consideration of delay) is analyzed for a general case and various speicial cases. It was found that the optiaml buffer time is an inverse funcion of the timed-transfer cycl and increases with the cycle time, assumin g that there is a fixed scheduled departure time at the transfer cetner regardless of whether one or more buses fail to arrive before the scheduled departure time. If buses are to wait uhtil all the buses arrive at the transfer center, that is, the transfer departure time is vairable, the optimal scheduled arrival times can be obtained by a mathmatical programming.

  • PDF

Longevity Issues in Swelling Clay as a Buffer Material for a HLW Repository (고준위폐기물처분장 완충재물질로서 팽윤성 점토의 장기건전성과 주요 고려사항)

  • Lee, Jae-Owan;Cho, Won-Jin
    • Journal of Nuclear Fuel Cycle and Waste Technology(JNFCWT)
    • /
    • v.6 no.1
    • /
    • pp.55-63
    • /
    • 2008
  • A swelling clay should remain physically and chemically stable for a long time to perform its functions as a buffer material of a high-level waste (HLW) repository. The longevity issues in the swelling clay were reviewed to evaluate their importance in the performance of a repository. The review results suggest that an elevated temperature due to decay heat, groundwater chemistry, high pH environment by concrete, organic matter and microbes, radiation, and mechanical disturbance might significantly affect the long-term performance of a swelling clay as a buffer material. This paper will be used as basic informations to design the swelling clay buffer for a HLW repository.

  • PDF