• Journal of the Institute of Convergence Signal Processing
• /
• v.7 no.3
• /
• pp.136-142
• /
• 2006

Existing buffer management schemes for shared-memory output queueing switches can be classified into two types: In the first type, some constant amount of memory space is guaranteed to each virtual queue using static queue thresholds. The static threshold method (ST) belongs to this type. On the other hand, the second type of approach tries to maximize the buffer utilization in 머 locating buffer memories. The complete sharing (CS) method is classified into this type. In the case of CS, it is very hard to protect regular traffic from mis-behaving traffic flows while in the case of ST the thresholds can not be adjusted according to varying traffic conditions. In this paper, we propose a new buffer management method called weighted dynamic thresholds (WDT) which can process packet flows based on loss priorities for quality-of-service (QoS) functionalities with fairly high memory utilization factors. We verified the performance of the proposed scheme through computer simulations.

• Journal of Korea Game Society
• /
• v.9 no.6
• /
• pp.163-170
• /
• 2009

There is a request from the client, we almost apply dynamic memory allocating method using Accept() of looping method; thus, there could be process of connecting synchronously lots of client in most of On-line gaming server engine. However, this kind of method causes on-line gaming server which need to support and process the clients, longer loading and bottle necking. Therefore we propose the object pooling scheme to minimize the memory fragmentation and the load of the initialization to the client using an AcceptEx() and static allocating method for an efficient gaming server of the On-line in this paper. We design and implement the gaming server applying to our proposed scheme. Also, we show efficiency of our proposed scheme by performance analysis in this paper.

• Journal of Advanced Navigation Technology
• /
• v.14 no.6
• /
• pp.996-1001
• /
• 2010

In this paper, network selection algorithm for services of mobile IPTV(internet protocol television) and implementation of a hierarchical processing system for reducing overload by terminal with low speed is proposed. This algorithm selects the network according to the following priorities derived from formulas; value that uses remaining bandwidth, network cost, signal strength. If terminal has a low processing power for using selected network and TV service, quality of service declines due to the system overloading. Hence, we implemented system which processes selected network and TV services accomplished by layer divided. Through experiments results, the method of direct user network selection waits for bandwidth assignment. However, on the one hand, that waiting time in exhausted situation will be very long. On the other hand, if we consider the priority plot of used networks, we should select the network with the best state. Therefore, data transmission rate will keep on average and the waiting time will be low.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.3 s.345
• /
• pp.111-117
• /
• 2006

Developing a home network and a ubiquitous infrastructure requires various communication techniques and devices with more advanced hardware. With this development, increasing realtime access to multimedia data results in rapid degradation of qualify for multimedia playback. This paper presents a traffic allocation technique based on MPP(Media Preference for Presentation) that can steadily maintain multimedia playback quality by adaptively allocating streaming traffic requested from clients with different playback performances. Media preference is defined in accordance with content popularity and playback performance of client devices. Through experiments when requested stream data exceeds processing ability of a midea server, the proposed allocation technique shows 10% quality improvement comparing to the system without applying the proposed allocation technique.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.3
• /
• pp.692-698
• /
• 1999

In this paper, we proposed the channel assignment scheme for the CDMA(Code Division Multiple Access) cellular system using power allocation concept. Also, the performance of the proposed scheme was analyzed and it was compared with the channel assignment scheme using the fixed power allocation method in the CDMA cellular system. The proposed scheme allocates the power adaptively in according to the traffic loads and the traffic distribution pattern of neighbor cells in the forward link. We found that total call blocking probability (Pr) is more dependent on blocking probability($P_B$) than outage probability (Po) under physical number of channels ($C_{th}$)=30. Pr(Call Blocking Probability) is dependent on $P_B$(Blocking Probability) and Po(Outage Probability) at the same ratio under $C_{th}$=32, in which case P$P_{TA}$(blocking probability for the adaptive power allocation) is greater than $P_{TF}$(blocking probability for the fixed power allocation) about 6%.

• Journal of Korea Multimedia Society
• /
• v.13 no.2
• /
• pp.279-286
• /
• 2010

Unbalanced traffic load offered to the nodes making up a path in the network guaranteeing quality-of-service has been known as a main cause deteriorating the capability of the path in admitting traffic flows. Several path load balancing methods have been developed to resolve this problem which used a feedback control scheme that adjusts the delay budget of a flow allocated to each node according to the conditions of available resource in the path. Because of no consideration about the probabilistic characteristics of the service quality, it is impossible for them to prevent in advance a bottleneck on the path which leads to a native restriction in the improvement of the capability being deteriorated. This paper proposes a preventive intra-path load balancing method applicable to the RSVP system which is based on the probabilistic characteristics of the quality-of-service of the offered load. The results of the simulation of the proposed method on a simple evaluation network showed that it provides the gain of 4~22% compared to the legacy one in terms of the number of admitted flows.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.7B
• /
• pp.489-498
• /
• 2012

Recently, as the interest in Green IT is exponentially increased, EPON with sleep mode has been studied to reduce energy consumption in access network. In oder to guarantee cyclic sleep for ONU(Optical Network Units), EPON with sleep mode transmits upstream and downstream data at the same time. However, since conventional algorithms for sleep mode in EPON allocate bandwidth to each ONU according to upstream bandwidth request, the QoS of downstream data is not guaranteed when the offered load of OLT is larger than that of ONU. In this paper, we propose a bandwidth allocation algorithm for improving QoS in EPON with sleep mode. The proposed algorithm compares its size with an upstream request of ONU when a downstream buffer in the OLT exceeds a QoS threshold. And then it allocates selectively a bandwidth that satisfies the required QoS between the bandwidth request of ONU and OLT. Therefore, the proposed algorithm can save energy through cyclic sleep of ONUs while guaranteeing the QoS of up/downstream data. In order to evaluate the proposed algorithm, we perform simulation in terms of total sleep time of ONUs, queueing delay between OLT and ONU, and the utilization of allocated bandwidth at OLT through OPNET.

• Journal of Korean Society of Environmental Engineers
• /
• v.27 no.1
• /
• pp.43-51
• /
• 2005

This paper presents a waste load allocation study for the Incheon coastal environment, where a computer model, called AQUASEA, was applied. A finite element mesh was constructed and refined to cover the complicated geometry of Incheon coastal sea. The tidal height at 13 places of Incheon coastal boundary and flow of the Han River were given as an input condition to the tidal simulation. All pollution sources that discharge into Incheon coast were given as input data to the water quality simulation. The modeled parameters include tidal flow and COD(Chemical Oxygen Demand). The model was calibrated and verified with the field measurements. The model results showed reasonable agreements with field measurements in both tidal flow and water quality. Systems analysis showed that the pollution load from the Han River caused recognizable impacts on the water quality of Incheon coast from Yeomhwa waterway to northern area of Younghungdo. The loads from Incheon City affected water quality from the area below Youngjongdo to the area above Jawalldo. The discharge from the Sihwa Lake caused discernible impacts on the coastal zone from the dike outlet to the Incheon harbor, and pollution loads from Kyungkido affected the sea near the Oido. An effective water quality management plan was developed from the waste load allocation analysis of the validated model, that the maximum waste loads can be discharged without violating the water quality standard given in the Incheon coastal environment.

• Journal of the Korea Institute of Building Construction
• /
• v.17 no.4
• /
• pp.369-375
• /
• 2017

This study suggests PSO(Particle Swarm Optimization) algorithm that optimizes the snowplow route allocation and the location of the snow control material storage to improve the efficiency in snow removal works. The modified PSO algorithm for improving the search capacity is proposed, and this study suggests the solution representation, the parameter setting, and the fitness function for the given optimization problems. Computational experiments in real-world case are carried out to justify the proposed method and compared with the traditional PSO algorithms. The results show that the proposed algorithms can find the better solution than the traditional PSO algorithms by searching for the wider solution space without falling into the local optima. The finding of this study is efficiently employed to solve the optimization of the snowplow route allocation by minimizing the workload of each snowplow to search the location of the snow control material storage as well.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.6B
• /
• pp.1004-1014
• /
• 1999

MAC protocols in wireless ATM has to increase and maintain the system throughput performance. To achieve these purposes, this paper proposes a dynamic control algorithm called DSPA (Dynamic Signalling Period Allocation) for wireless ATM MAC protocol. The proposed DSPA algorithm consists of the following three algorithms. First, a control slot generation algorithm which generates the control slots by utilizing static and dynamic parameters from the terminals, is proposed. Second, a dynamic signalling period allocation algorithm is proposed for a base station to dynamically determine each signalling period according to current terminal states, and thus allocates the optimal signalling periods. Finally, a dynamic slot allocation algorithm is proposed to dynamically determine priorities of the terminals whenever a slot is allocated. Simulation results indicates that DSPA algorithm decreases average packet delay of the terminals by dynamic allocation of signal periods based on the system utilization, and thus increases the limitation of allowable loads that quarantee quality of services. Also the proposed algorithm is shown to maintain stable throughput even in the case of traffic variations.