• The Transactions of the Korea Information Processing Society
• /
• v.6 no.4
• /
• pp.1058-1070
• /
• 1999

In this paper, we propose a control model which can control the burst input messages of the BSC(Base Station controller) in mobile communication systems more efficiently and reliably, by dividing the input messages characteristically and using multiprocessor system. Using M/M/c/K queueing model, we briefly analyze proposed model to get characteristic parameters which are required to performance improvement. On the base of the results, we compare our proposed model with the conventional one by using SLAM II with regard to the following factors : the call blocking rate of the input message, the distribution of average queue length, the utilization of process controller(server), and the distribution of average waiting time in queue. In addition, we modified our model which has overload control function for burst input messages, and analyzed its performance.

• 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.

• Journal of KIISE:Information Networking
• /
• v.29 no.4
• /
• pp.437-446
• /
• 2002

In order to reduce the increasing packet loss rates caused by an exponential increase in network traffic, the IETF (Internet Engineering Task Force) is considering the deployment of active queue management techniques such as RED (Random Early Detection). While active queue management in routers and gateways can potentially reduce packet loss rates in the Internet, this paper has demonstrated the inherent weakness of current techniques and shows that they are ineffective in preventing high loss rates. The inherent problem with these queue management algorithms is that they all use static parameter setting. So, in case where these parameters do not match the requirement of the network load, the performance of these algorithms can approach that of a traditional Drop-tail. In this paper, in order to solve this problem, a new active queue management algorithm called ARED (Active RED) is proposed. ARED computes the parameter based on our heuristic method. This algorithm can effectively reduce packet loss while maintaining high link utilizations.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.2
• /
• pp.177-185
• /
• 2012

In this paper, we developed the composition system that it can efficiently edit camera recording data, images, office document such as powerpoint data, MS word data etc in real-time and broadcasting system that the file is made by the composition system. In this Study, we developed two kinds of algorithm; Approximate Composition for Optimization (ACFO) and Sequence Composition using Memory Que (SCUMQ). Especially, the system is inexpensive and useful because the system is based on mobile devices and PCs when lectures hope to make video institutional contents. Therefore, it can be contributed for e-learning and m-learning. In addition, the system can be applied to various fields, different kinds of multimedia creation, remote conferencing, and e-commerce.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.5
• /
• pp.44-56
• /
• 2009

Multimedia streaming service is susceptible to loss and delay of data as it requires high bandwidth and real time processing. Therefore QoS cannot be guaranteed due to data loss caused by heavy network traffic and error of wireless channel. To solve these problems, studies about algorithms which improve the quality of multimedia by serving differently according to the priority of packets in multimedia stream. Two algorithms are proposed in this paper. The first algorithm proposed is WMS-1(Wireless Multimedia Scheduling-1) algorithm which acts like IWFQ when any wireless loss is occurred but assigns channels first in case of urgent situation like when the running time of multimedia runs out. The second algorithm proposed is WMS-2(Wireless Multimedia Scheduling-2) algerithm that assigns priority to multimedia flow and schedules flow that has higher priority according to type of frame first. The comparison with other existing scheduling algorithms shows that multimedia service quality of the proposed algorithm is improved and the larger the queue size of base station is, the better total quality of service and fairness were gained.

• Journal of Navigation and Port Research
• /
• v.29 no.1 s.97
• /
• pp.91-96
• /
• 2005

The National Marine Electronics Association(NMEA) is nonprofit-making cooperation composed with manufacturers, distributors, wholesalers and educational institutions. We use the basic port of equipment in order to process the signal from NMEA signal using equipment. When we don't have enough one, we use the multi-port for processing. However, we need to have module development simulation which could multiplex and provide NMEA related signal that we could solve the problems in multi-port application and exclusive equipment generation for a number of signal. For now, we don't have any case or product using NMEA multiplexer so that we import expensive foreign equipment or embody NMEA signal transmission program like software, using multi-port. These have problems since we have to pay lots ci money and build separate processing part for every application programs. Besides, every equipment generating NMEA signal are from different manufactures and have different platform so that it could cause double waste and loss of recourse. For making up for it, I suggest the NMEA multiplexer embodiment, which could independently move by reliable process and high performance single hardware module, improve the memory efficiency of module by designing the optimized Queue, and keep having reliability for realtime communication among the equipment such as main input sensor equipment Gyrocompass, Echo-sound, and GPS.

• Maxillofacial Plastic and Reconstructive Surgery
• /
• v.29 no.1
• /
• pp.55-62
• /
• 2007

Radical paring of the cleft edge during primary cleft lip operation or repeated secondary surgeries can result in tightness of the upper lip. In case, the degree of the resulting side-to-side tension is very severe, the possibility of a lip switch flap must be considered. When the lip tightness accompanies a loss of more than two-thirds of the Cupid's bow, an Abbe flap is an alternative. The disadvantages of Abbe flap are scar formation on the lower lip, design of incision line on the upper lip, disharmony of colors, and the dysfunction of the orbicularis muscle. These problems have been recognized in the literature and extreme discretion has been advised in its application. We experienced four cases of Abbe flap operation which were designed differently to correct the secondary unilateral or bilateral cleft-lip nasal deformities. The Abbe flap operations resulted in removal of the scars and tightness of the upper lip, reconstruction of the Cupid's bow, lengthening of the columella, and therefore secondary cleft-lip nasal deformity could be corrected. It is thought that carefully applied Abbe flap is an appropriate method to relieve horizontal tightness or flattening of the upper lip which occured after primary operation of cleft lip.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.9A
• /
• pp.663-668
• /
• 2003

With the advent of high speed networking technology, computers connected to the high-speed networks tend to consume more of their CPU cycles to process data. So one of the solutions to improve the performance of the computers is to reduce the CPU cycles for processing the data. As the consumption of the CPU cycles is increased in proportion to the number of the packets per second to be processed, reducing the number of the packets per second by increasing the length of the packet is one of the solutions. In order to meet this requirement, two types of jumbo packets such as jumbograms and jumbo frames have already been standardized or being discussed. In case that the jumbograms and general packets are interleaved and scheduled together in a router, the jumbogrms may deteriorate the QoS of the general packets due to the transfer delay. They also frequently exhaust the memory with storing the huge length of the packets. This produces the congestion state easily in the router that results in the loss of the packets. In this paper, we analyze the problems in processing the jumbo packets and suggest a noble solution to overcome the problems.

• Proceedings of the KIEE Conference
• /
• 2005.05a
• /
• pp.215-217
• /
• 2005

There are two types of packet loss probabilities used in both the network layer and the physical layer within the wireless transmitter such as a queueing discard probability and transmission loss probability. We analyze these loss performances in order to guarantee Quality of Service (QoS) which is the basic of the future network. The queuing loss probability is caused by a maximum allowable delay time and the transmission loss probability is caused by a wireless channel error. These two types of packet loss probabilities are not easily analyzed due to recursive feedback which, originates as a result at a queueing delay and a number of retransmission attempts. We consider a wireless transmitter to a M/D/1 queueing model. We configurate the model to have a finite-size FIFO buffer in order to analyze the real-time traffic streams. Then we present the approaches used for evaluating the loss probabilities of this M/D/1/K queueing model. To analyze the two types of probabilities which have mutual feedbacks with each other, we drive the solutions recursively. The validity and accuracy of the analysis are confirmed by the computer simulation. From the following solutions, we suggest a minimum of 'a Maximum Allowable Delay Time' for real-time traffic in order to initially guarantee the QoS. Finally, we analyze the required service rate for each type utilizing real-time traffic and we apply our valuable analysis to a N-user's wireless network in order to get the fundamental information (types of supportable real-type traffics, types of supportable QoS, supportable maximum number of users) for network design.

• Journal of the Korea Society of Computer and Information
• /
• v.25 no.1
• /
• pp.21-27
• /
• 2020

In this paper, a hybrid scheduling algorithm is proposed for CMS(Combat Management System) to improve QoS(Quality of Service) based on DWDRR(Dynamic Weighted Deficit Round Robin) and priority-based scheduling method. The main proposed scheme, DWDRR is method of packet transmission through giving weight by traffic of queue and priority. To demonstrate an usefulness of proposed algorithm through simulation, efficiency in special section of the proposed algorithm is proved. Therefore, We propose hybrid algorithm between existing algorithm and proposed algorithm. Also, to prevent frequent scheme conversion, a hysteresis method is applied. The proposed algorithm shows lower packet loss rate and delay in the same traffic than existing algorithm.