• Journal of KIISE:Databases
• /
• v.31 no.2
• /
• pp.132-139
• /
• 2004

A range $Top-\kappa$ query returns top k records in order of a measure attribute within a specified region on multi-dimensional data, and it is a powerful tool for analysis in spatial databases and data warehouse environments. In this paper, we propose an algorithm for answering the query via selective traverse of a Hierarchical Max R-Tree(HMR-tree). It is possible to execute the query by accessing only a small part of the leaf nodes in the query region, and the query performance is nearly constant regardless of the size of the query region. The algorithm manages the priority queue efficiently to reduce cost of handling the queue and the proposed HMR-tree can guarantee the same fan-out as the original R-tree.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.6
• /
• pp.1869-1880
• /
• 2014

Wireless communication is one of most active areas in modern communication researches, QoS (Quality of Service) assurance is very important for wireless communication systems design, especially for applications such as streaming video etc., which requires strict QoS assurance. The modern wireless networks multi-layer protocol stack structure results in QoS metrics layered and acting in cascade and QoS metrics vertical mapping between protocol layers. Based on virtual buffer between protocol layers and queuing technology, a unified layered QoS mapping framework is proposed in this paper, in which we first propose virtual queue concept, give a novelty united neighboring protocol layers QoS metric mapping framework, and analysis method based on dicerete-time Markov chain, and numerical results show that our proposed framework represents a significant improvement over previous model.

• Journal of Electrical Engineering and information Science
• /
• v.2 no.3
• /
• pp.29-40
• /
• 1997

Two asymptotic analyses of the queue length distribution at a statistical multiplexor supporting heterogeneous exponential on-off sources are considered. The first analysis is performed by approximating the cell generation rates as a multi-dimensional Ornstein-Uhlenbeck process and then applying the Benes queueing formula. In the second analysis, w state with a system of linear equations derived from the exact expressions of the dominant eigenvalue of the matrix governing the queue length distribution. Assuming that there are a large number of sources, we obtain asymptotic approximations to the dominant eigenvalue. Based on the analyses, we define a traffic descriptor to include the mean and the variance of the cell generation rate and a burstiness measure. A simple expression for the quality of service (QoS) in cell loss rate is derived in terms of the traffic descriptor parameters and the multiplexor parameters (output link capacity and buffer size). The result is then used to quantify the factors determining the required capacity of a call taking the statistical multiplexing gain into consideration. As an application of the analyses, we can use the required capacity calculation for simple yet effective connection admission control(CAC) algorithms.

• Journal of KIISE:Databases
• /
• v.29 no.1
• /
• pp.72-78
• /
• 2002

The distance join is a spatial join which finds data pairs in the order of distance between two spatial data sets using R-trees. The distance join stores node pairs in a priority queue, which are retrieved while traversing R-trees in a top-town manner, in the order of distance. This paper first shows that a priority strategy for the tied pairs in the priority queue during distance join processing has much effect on its performance, and then proposes an optimized secondary priority method. The experiments show that the proposed method is always better than the other methods in the performance perspectives.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.5 no.5
• /
• pp.429-432
• /
• 2004

In this paper, we propose a new sorting algorithm for ATM switch with a shared buffer which has a sequencer architecture with single queue. The proposed switch performs a sorting procedure of ATM cell based on the output port number of ATM cell with hardware implementation. The proposed architecture has a single buffer physically but logically it has function of multi-queue which is designed at most to control the conflicts in output port. In the future, this architecture will take various applications for routing switch and has flexibility for the extension of system structure. therefore, this structure is expected on good structure in effective transmission.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2004.11a
• /
• pp.15-19
• /
• 2004

Domestic use, or embody program that transmit NMEA protocol using multi port as software and is using because there is no fee and product that develop NMEA protocol Multiplexer, import mounting for foreign climax present. These method is paid or there is problem that must make out special processing part in each application program. Also, each mountings that display NMEA protocol can cause double resources waste and damage etc. because manufacturing firm and platform are different. Can act separatively as single hardware module of reliable processing method and high efficiency to supplement this in this treatise, and because using design of optimized cue, heighten memory efficiency of module, and proposed NMEA protocol Multiplexer that can keep high trustability of Come on, deviation compass, echo sound, mountings of GPS and so on and real time communication that is main input sensor equipment about embodiment.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.13 no.3
• /
• pp.509-516
• /
• 2018

TCP is a well-known communication protocol which is widely used for reliable message transmissions. The urgent mechanism of TCP plays a key role to transmit messages with a high priority. If a high priority message occurs at the transmitting node, the urgent mechanism informs the receiving node about the presence of a high priority message prior to its transmission so that the receiving node can be prepared for handling this message in advance. This implies that the existing urgent mechanism of TCP does not guarantee an immediate or faster delivery of the high priority message itself. Therefore, the ability of priority-based transmission is required on TCP not only to ensure reliable transmissions of normal messages but also to offer a differentiated service according to the priority of message. This paper presents a priority-based transmission algorithm over TCP using a priority queue in a multi-threaded environment. The effectiveness of the proposed algorithm is explored using an experimental setup in which various messages with different priority levels are transmitted.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.1
• /
• pp.141-146
• /
• 2011

The GIS service has to provide latest spatio-temporal data for the effective service. The two-way synchronization scheme collects updated spatio-temporal data in the field and synchronizes with a server by using the wireless network. However, since the two-way synchronization scheme processes sequentially synchronizing work of clients, it has the problem that the synchronization of multiple clients takes long time. In this paper, we propose the concurrent synchronizations scheme based on the multi-queue in order to reduce the waiting time of multiple clients. We also build both schemes and evaulate the performance test. The results show that the proposed scheme reduce the waiting time by 31%.

• Journal of the Korea Society for Simulation
• /
• v.17 no.4
• /
• pp.61-69
• /
• 2008

In order to evaluate the performance of priority queues for future event list in discrete-event simulations, models representing patterns of enqueue and dequeue processes are required. The time complexities of diverse priority queue implementations can be compared using the performance models. This study aims at developing such performance models especially under the environment that a developed simulation model is used repeatedly for a long period. The developed performance model is based on multi-stage Markov process models; probabilistic patterns of enqueue and dequeue are considered by incorporating non-homogeneous transition probability. All necessary parameters in this performance model would be estimated by analyzing a results obtained by executing the simulation model. A case study with a war game simulation model shows how the parameters defined in muti-stage Markov process models are estimated.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.5
• /
• pp.125-133
• /
• 2008

In this paper, we propose active queue management mechanism (Active-WRED) to guarantee quality of the high priority service class in multi-class traffic service environment. In congestion situation, this mechanism increases drop probability of low priority traffic and reduces the drop probability of the high priority traffic, therefore it can improve the quality of the high priority service. In order to analyze the performance of our mechanism we introduce the stochastic analysis of a discrete-time queueing systems for the performance evaluation of the Active Queue Management (AQM) based congestion control mechanism called Weighted Random Early Detection (WRED) using a two-state Markov-Modulated Bernoulli arrival process (MMBP-2) as the traffic source. A two-dimensional discrete-time Harkov chain is introduced to model the Active-WRED mechanism for two traffic classes (Guaranteed Service and Best Effort Service) where each dimension corresponds to a traffic class with its own parameters.