• International Journal of Internet, Broadcasting and Communication
• /
• v.14 no.1
• /
• pp.95-104
• /
• 2022

A TPR-tree is a well-known indexing structure that is developed to answer queries about the current or future time locations of moving objects. For the purpose of space efficiency, the TPR-tree employs the notion of VBR (velocity bounding rectangle)so that a regionalrectangle presents varying positions of a group of moving objects. Since the rectangle computed from a VBR always encloses the possible maximum range of an indexed object group, a search process only has to follow VBR-based rectangles overlapped with a given query range, while searching toward candidate leaf nodes. Although the TPR-tree index shows up its space efficiency, it easily suffers from the problem of dead space that results from fast and constant expansions of VBR-based rectangles. Against this, the TPR-tree index is enforced to update leaf nodes for reducing dead spaces within them. Such an update-prone feature of the TPR-tree becomes more problematic when the tree is saved in flash storage. This is because flash storage has very expensive update costs. To solve this problem, we propose a new Bloom filter based caching scheme that is useful for reducing updates in a flash TPR-tree. Since the proposed scheme can efficiently control the frequency of updates on a leaf node, it can offer good performance for indexing moving objects in modern flash storage.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.8A
• /
• pp.1160-1168
• /
• 2000

This paper presents a real-time integrated traffic management (RITM) scheme that can effectively manage variable bit rate (VBR) and available bit rate (ABR) traffics having unpredictable characteristics in asynchronous transfer mode (ATM) networks. An unique feature of this scheme is that it has a special ATM cell control block which makes it possible to monitor bursty traffics in real-time so that the delay incurred to measure cell arrival rate is minimized. Additionally, the proposed scheme intends to dynamically reassign the leftover network resources to VBR/ABR connections without any deterioration in quality of service (QoS) of the existing connections. The RITM scheme has been verified to reliably monitor incoming traffics and to efficiently manage network resources by computer simulations. The capability of managing the incoming ATM traffics in real-time helps determine an optimal acceptable number of user connections for a given network condition. We can use this value as a threshold to protect the network from being congested and to find out a cost-effective buffer design method.

• The Journal of the Acoustical Society of Korea
• /
• v.18 no.6
• /
• pp.65-70
• /
• 1999

In ATM network there exist several traffics according to QoS, such as CBR, rt-VBR, nrt-VBR, UBR, and ABR. Many studies have done at the traffic management of ABR which uses the unused network bandwidth. Many flow control mechanisms have proposed to use efficiently the unused bandwidth. In TMWG(Traffic Management Working Group) of ATM Forum, there exist rate-based, credit-based, and mixture of them to manage flow control of ABR traffic. Among these, rate-based mechanisms adopted as standard because it is flexible and also makes it possible to implement ATM switch with low price and high capacity. In this paper, we study the switch that uses EFCI, ER and VS/VD(Virtual Source/Virtual Destination) with rate-based mechanism. Instead of using queue threshold, we propose a new algorithm which uses bandwidth threshold of input stage of switch, and manages efficiently ABR traffic with EPRCA algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.7B
• /
• pp.628-637
• /
• 2003

This paper describes a novel multiplexing scheme for delay-sensitive multiple VBR-coded bit streams in live multimedia service offered to high-speed networks. The primary goal of multiplexing in this paper is to keep delay limits of each bit streams and to enhance network resource utilization when they no multiplexed and transmitted over network. For this aim, this paper presents a dynamical control scheme which does not cause violation of any delay constraints to each bit steam. The scheme is based on the assumption that recent behavior of the each bit scream has high correlation with near-term future behavior. Such property is used to make as flat as possible by both temporal averaging on a stream-by-stream and spatial averaging is introduced when multiple VBR-coded bit streams are multiplexed. The effectiveness of the scheme is evaluated by several simulation using an MPEG-coded video trace of Star_wars and it is shown that the proposed scheme can effectively reduce the feat rate md coefficient of variation of the multiplexed transmission rate.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.8
• /
• pp.1755-1764
• /
• 1997

In this paper, we proposed the mechanism for the buffer allocation and a cell scheduling method with logical separation a single buffer in the ATm switch, and analyzed the cell loss probability and the delay of each trafic (CBR/VBR/ABR) based on the weighted value and the dynamic cell service scheduling algorithm. The proposed switch buffering system classifies composite trafics incoming to the switch, according to the characteristic of traffic, then stores them in the logically separated buffers, and adopts the round-robin service with weighted value in order to transmit cells in buffers though one output port. We analyzed 4 cell service scheduling algorithms with dynamic round-robinfor each logically separated service line of a single buffer, in which buffers have the respective weighted values and 3 classes on mixed traffic which characteristized by traffic descriptor. In simulation, using SIMCRIPT II.5., we model the VBR and the ABR traffics as ON/OFF processes, and the CBR traffic as a Poisson processes. As the results of analysis according to the proposed buffer management mechanism and cell service algorithm, we have found that the required QoS of each VC can be quaranteed depends on a scale of weighted values allocated to buffers that changed the weighted values, and cell scheduling algorithm.

• Journal of Korea Multimedia Society
• /
• v.7 no.5
• /
• pp.713-720
• /
• 2004

In this paper we suggest error control scheme to improve CLR performance degradation on wireless ATM access networks which consist of access node and wireless channel. Based on the cell scale and hurst scale, traffic model of wireless ATM access network is analyzed. The CLR equation due to buffer overflow for wireless access node is derived for VBR traffic. the CLR equation due to random bit errors and burst errors for wireless channel is derived. Using the CLR equation for both access node and wireless channel, the CLR equation of wireless ATM access network is derived, and we evaluate the CLR performance on the wireless ATM access networks with conventional SR ARQ scheme and recommended error control scheme, that is, Type I Hybrid ARQ scheme. It is confirmed that CLR performance of the access networks with recommended error control schemes is superior to that of access networks with conventional error control scheme.

• Proceedings of the IEEK Conference
• /
• 2000.06a
• /
• pp.131-134
• /
• 2000

Only MAC protocol can satisfy the service quality of the request of bandwidth, delay time, and cell loss at the same time and it is because MAC protocol provides mobile terminal an environment to use channel evenly and effectively This Paper has been adapted Mobile ATM Standardization of ETSI in maximum and used not only for practicing in-band signal to a priority order but also to the next reserved slot assignment of the dynamic frame. Also, by accepting VBR traffic more adaptively, the effectiveness of transmission channel has been maximized as well, and these are compared with the old way of it and analyzed to confirm the effectiveness.

• The Journal of Information Technology
• /
• v.1 no.2
• /
• pp.65-79
• /
• 1998

In this thesis, a buffer alloction and management algorithm is proposed in order to satisfy the QoS of CBR/VBR traffics incomming to ATM networks. Proposed traffic menagement algorithm is based on the route seperation mechanism that allocates buffers acoording to traffic characterics, and sets threshold to allocated buffers. We developed a cell scheduling algorithm and evaluated cell delay and loss probability characteristics according to incomming traffic classes. The cell scheduling algorithm uses buffer size thresholds to control overload traffic flow.

• The KIPS Transactions:PartC
• /
• v.8C no.4
• /
• pp.443-450
• /
• 2001

본 논문에서는 무선 ATM 망에서 VBR(Variable Bit Rate) 트래픽의 QoS(Quality of Service)를 보장하고 무선 채널의 효율성을 극대화 할 수 있는 새로운 동적 슬롯 할당 알고리즘인 NDSA(Neural Dynamic Slot Assignment)를 제안한다. 제안된 알고리즘에서는 ATM 셀 헤더 부분의 GFC(Generic Flow Control) 필드 상에 단말기의 버퍼 상태와 셀 발생률 변화를 부호화 하여 piggybacking 하는 in-band 방식을 채택하였으며 다음 프레임에 할당할 슬롯의 갯수를 기존 방식과는 달리 신경회로망을 이용하여 유동적으로 조절하여 할당함으로써 단말기의 셀 손실이나 지연에 대한 QoS를 보장하고 채널 이용 효율을 높일 수 있었다. 제안된 알고리즘은 BONeS tool을 이용한 시뮬레이션을 통하여 기존의 방식과 비교 분석한 결과 그 정당성을 확인하였다.

• ETRI Journal
• /
• v.29 no.6
• /
• pp.823-825
• /
• 2007

In this letter, we propose a novel algorithm to predict MPEG-coded real-time variable bit rate (VBR) video traffic. From the frame size measurement, the algorithm extracts the statistical property of video traffic and utilizes it for the prediction of the next frame for I-, P-, and B- frames. The simulation results conducted with real-world MPEG-4 VBR video traces show that the proposed algorithm is capable of providing more accurate prediction than those in the research literature.