• The KIPS Transactions:PartC
• /
• v.15C no.5
• /
• pp.419-428
• /
• 2008

IEEE 802.15.4 reserves transmission time to support real-time transport by sending GTS request packets to the PAN coordinator in advance. This paper introduces GTS-FAT technique to reduce the reservation time by giving a higher sending priority to GTS request packets than data packets. Differently from the conventional scheme where these two kinds of packets share a single transmission queue, GTS-FAT scheme allocates two queues with two different contention window sizes like IEEE 802.11e. This paper also proposes an analytical GTS delay model by combining the two legacy models for 802.15.4 and 802.11e to accurately predict the GTS-FAT delay over a given network topology. Our analysis shows that GTS-FAT reduces GTS service delay by up to 50% at the expense of the data delay by only up to 6.1% when GTS request packets four times outnumber data packets.

• Journal of KIISE:Information Networking
• /
• v.29 no.5
• /
• pp.553-561
• /
• 2002

We present a novel service discipline, called linear service discipline, to serve multiple QoS queues sharing a resource and analyze its properties. The linear server makes the output traffic and the queueing dynamics of individual queues as a linear function of its input traffic. In particular, if input traffic is Gaussian, the distributions of queue length and output traffic are also Gaussian with their mean and variance being a function of input mean and input power spectrum (equivalently, autocorrelation function of input). Important QoS measures including buffer overflow probability and queueing delay distribution are also expressed as a function of input mean and input power spectrum. This study explores a new direction for network-wide traffic management based on linear system theories by letting us view the queueing process at each node as a linear filter.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.5 no.7
• /
• pp.1238-1244
• /
• 2001

Earlier efforts on optical access concentrated on the design of PONs for the collection and distribution portion of the access network. In these networks the optical hardware in the RN is very simple, but a multiple access protocol is needed for upstream traffic control. On the other hand, the role of communications is already well established in the office environment. With the advent of cheap, affordable broadband communications and the increasing complexity of consumer electronics, it seems natural to extend the network into the home. As the application of Home Area Network is ever increasing, we therefore consider connectivity between access network and home network which generates various traffic to design MAC protocol over residential network. Global-FIFO is quite simple and allows dynamic upstream bandwidth assignment on the basis of a request-and-permit mechanism. It has good bandwidth efficiency and being cell-based, it does not consider the various traffic from home network. In this paper, we design and analyze the new MAC resource assignment algorithm called MQ-FIFO (Multiple Queue-FIFO) that provides good performance under the environment of ATM-PON and Home Network.

• Journal of Korea Multimedia Society
• /
• v.14 no.11
• /
• pp.1409-1419
• /
• 2011

It is well known that estimating the system processing time and cost at the early stage of the software system development is very important, and many Petri net methods of analysing processing time have been published. In another field of computer science, web service has been widely studied as a key of an efficient application software development method. Considering these two phenomena, this paper introduces a Petri net method of analysing the process time of application software consisting of web services. It is not plausible to represent the process time of a web application system as a constant. Therefore, we propose to use "Petri net with queues" to represent a web application system. The main contribution of this paper is to introduce a method of analysing a "Petri net with queues".

• Journal of Families and Better Life
• /
• v.20 no.4
• /
• pp.179-188
• /
• 2002

This paper aims to provide the basic data for the educational direction of global etiquette through the analyses of 1,028 articles appearing in Chosun Daily Newspaper the results of this study are as follows: 1. The articles of global etiquette were classified into the life in public places, the traffic and the public behavior. 1) The contents of the life in public places dealt with restaurants(29.3％), the neighborhood(24.7％), theaters and stadiums(9.7％), hotels and sanitary facilities(8.8％), stores(7.7％), schools and offices(7.0％), airports and public offices(6.6％) and resorts(6.2％). 2) The contents of traffic dealt with the motorists(29.3％), buses(24.7％), taxis(12.3％), subways(10.3％), trains(8.2％), elevators and pedestrian crossing(6.2％), airplanes(4.6％) and parking(4.4％). 3) The contents of public behavior contained the kindness(45.6％), the use of cellular Phone(12.4％), the concession and queues(10.8％), the greeting(10.3％), the responsibility and obeying laws(7.9％), the cleanliness(7.7％), the commercial transaction(2.9％) and the table manner(2.4％). 2. Koreans were negatively evaluated on 1) the kindness at restaurants, the neighbor and strangers and the motorists, 2) there aren't enough greetings being practiced within the neighborhood and at restaurants, 3) The use of cellular phone at theaters and stadiums, schools and offices, buses and subways, 4) The table manner at restaurants, 5) The concession and queues at theaters and stadiums, resorts, the motorists and subways, 6) The responsibility and obeying laws of the motorists, 7) the commercial transaction at restaurants and stores, 8) The cleanliness at restaurants, resorts and hotels and public sanitary facilities. According to this finding, it is recommended that we develop the educational contents and programs of global etiquette which are focused on educating the public on the connection between the living area and how the public should adapt and behave

• Journal of The Korea Institute of Healthcare Architecture
• /
• v.24 no.2
• /
• pp.15-25
• /
• 2018

Purpose: The important things in space plan of a screening center are improving the spatial awareness by space systemization and minimizing the examination time for customers, and reducing the required time of screening work and maximizing the capacity for the screening center. Therefore, we tried to solve the problem of improving spatial awareness and reducing the examination time by using the pedestrian based discrete event simulation at the minimum cost. Methods: We have analyzed the drawbacks and the supplement points by comparing the floor plan at the time of opening and the current floor plan. Based on the analysis, we propose an improved plan which changes the location of the examination rooms and the number of services, and we also verify the improved plan based on simulation analyses. Results: 1) Through the analyses, we derived the drawbacks of the floor plan at the time of opening, and we realized that the current floor plan reflects the drawbacks. 2) The major reasons of the long examination time are the human traffic jam and the occurrence of queues due to unreasonable allocation of services. 3) Through the discrete event simulation analyses, it was possible to specify the place of the queues manually so as to use the given space fairly. 4) Using the discrete event simulation, it was possible to reduce the examination time and to improve the spatial awareness effectively at the minimum cost. Implications: Although the proposed simulation methodology in this paper is an analysis of the existing screening center, we expect that the proposed methodology will be used to develop a more efficient architectural design process by pre-applying the method to the course of designing a screening center and finding the suitability of the proposed method with the matched number of services.

• Journal of Advanced Navigation Technology
• /
• v.18 no.1
• /
• pp.29-34
• /
• 2014

Data fusion techniques combine data from multiple radars and related information to achieve more accurate estimations than could be achieved by a single, independent radar. In this paper, we analyze delay and loss of packets to be processed by multiple radar and minimize data processing interval from centralized data processing operation as fusing multiple radar data. Therefore, we model radar network about central data fusion, and analyze delay and loss of packets inside queues on assuming queues respectively as the M/M/1/K using NS-2. We confirmed average delay time, processing fused multiple radar data, through the analysis data. And then, this delay time can be used as a reference time for radar data latency in fusion center.

• The KIPS Transactions:PartB
• /
• v.12B no.3 s.99
• /
• pp.265-272
• /
• 2005

In this paper, we propose a technique which is speedily searching for correspondent points of two images using Voronoi-Distance, as an image registration method for feature based image mosaics. It extracts feature points in two images by the SUSAN corner detector, and then create not only the Voronoi Surface which has distance information among the feature points in the base image using a priority based Voronoi distance algorithm but also select the model area which has the maximum variance value of coordinates of the feature points in the model image. We propose a method for searching for the correspondent points in the Voronoi surface of the base image overlapped with the model area by use of the partitive search algorithm using queues. The feature of the method is that we can rapidly search for the correspondent points between adjacent images using the new Voronoi distance algorithm which has $O(width{\times}height{\times}logN)$ time complexity and the the partitive search algerian using queues which reduces the search range by a fourth at a time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.7A
• /
• pp.987-995
• /
• 1999

The handoff is a distinctive characteristic of the mobile networks. In the CDMA systems, if base stations support multiple Frequency Assignment (FA), they provide both soft handoff and hard handoff. Under the CDMA environments, the soft handoff guarantees the favorable service quality and the continuity of call connection without interruption, and increases the service capacity of the base stations. This paper proposes call connection control schemes with handoff queue for supporting efficient handoff processing. The proposed schemes are divided into two categories: single handoff queue scheme and multiple handoff queue scheme. We analyze the performance of the proposed call connection control schemes using numerical analysis. From the analysis results, we can say that it is more desirable to avoid hard handoff as long as handoff queues are used. When a single handoff queue used, adaptive scheme that properly mixes avoidable and avoidable hard handoff method under the given traffic condition is more desirable. In case that multiple handoff queues are used, the suitable trade-off needs to be developed between handoff blocking probability and hard handoff probability to guarantee a given blocking probability threshold.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.1B
• /
• pp.59-66
• /
• 2012

The use of MPSoC has been increasing because of a rise of use of mobile devices and complex applications. For improving the performance of MPSoC, number of processor has been increasing. Standard MPI is used for efficiently sending data in distributed memory architecture that has advantage in multi processor. Standard In this paper, we propose a scalable distributed memory system with a low cost hardware message passing interface(MPI). The proposed architecture improves transfer rate with buffered send for small size packet. Three queues, Ready Queue, Request Queue, and Reservation Queue, work as previous architecture, and two queues, Small Ready Queue and Small Request Queue, are added to send small size packet. When the critical point is set 8 bytes, the proposed architecture takes more than 2 times the performance improvement in the data that below the critical point.