• The KIPS Transactions:PartA
• /
• v.16A no.3
• /
• pp.189-198
• /
• 2009

The traditional interrupt-based protocol processing at end hosts has two priority-inversion problems. First, low-priority packets may interrupt and delay high-priority process executionssince interrupts have the highest priority in most operating systems. Second, low-priority packet may delay high priority packets when they arrive almost simultaneously since interrupt processing is performed in a FCFS (first come, first served) order. These problems can be solved by a priority-based protocol processing policy and implementation. However, general priority-based schemes commonly have the problem of starvation and cannot support the each network flow requiring the mutually exclusive QoS since the packets are processed in the FCFS order. Therefore, the priority-based schemes are not appropriate for different QoS-demanding applications. In this paper, we present a bottom-half-based approach that relies on priority- and budget-based processing. The proposed approach allows us to solve both the starvation and priority-inversion problems, and further enables effective QoS isolation between different network connections. This feature also enables bounding the protocol processing time at an end host. We finally show through experiments that the proposed approach achieves QoS isolation and control.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.6B
• /
• pp.595-604
• /
• 2009

The HCCA reserves the channel resources based on the mean data rate in IEEE 802.11e. It may cause either the waste of channel resource or the increase of transmission delay at MAC layer if the frame size is rapidly varied when a compressed mode video codec such as MPEG video is used. To solve these problems, it is developed that the packet scheduler allocates the wireless resource adaptation by according to the packet size. However, it is difficult to perform the admission control because of the difficulty with calculating the available resources. In this paper, we propose a CAC mechanism to solve the problem that may not satisfy the QoS by increasing traffic load in case of using EDCA. Especially, the proposed CAC mechanism calculates the EB of TSs using the traffic information transmitted by the application layer and the number of average transmission according to the wireless channel environment, and then determines the admission of the TS based on the EB. According to the simulation results of the proposed CAC mechanism, it admitted the TSs under the loads which are satisfied within the delay bound. Therefore, the proposed mechanism guarantees QoS of streaming services effectively.

• The KIPS Transactions:PartA
• /
• v.8A no.4
• /
• pp.319-330
• /
• 2001

In virtual memory system, when a process attempts to access a page that is not resident in memory, the system generates and handles a page fault that causes unpredictable delay. So virtual memory system is not appropriate for the real-time system, because it can increase the deadline miss ratio of real-time task. In multimedia system, virtual memory system may degrade the QoS(quality of service) of multimedia application. Furthermore, in general-purpose operating system, whenever a new task is dynamically loaded, virtual memory system suffers from extensive page fault that cause transient overloading state. In this paper, we present efficient overloading control mechanism called RBPFH (Rate-Based Page Fault Handling). A significant feature of the RBPFH algorithm is page fault dispersion that keeps page fault ratio from exceeding available bound by monitoring current system resources. Furthermore, whenever the amount of available system resource is changed, the RBPFH algorithm dynamically adjusts the page fault handling rate. The RBPFH algorithm is implemented in the Linux operating system and its performance measured. The results demonstrate RBPFH\`s superior performance in supporting multimedia applications. Experiment result shows that RBPFH could achieve 10%∼20% reduction in deadline miss ratio and 50%∼60% reduction in average delay.

• Corrosion Science and Technology
• /
• v.8 no.2
• /
• pp.74-80
• /
• 2009

The high alkaline property in the concrete pore solution protects the embedded steel in concrete from corrosion due to aggressive ions attack. However, a continuous supply of those ions, in particular, chlorides altogether with a pH fall in electrochemical reaction on the steel surface eventually depassivate the steel to corrode. To mitigate chloride-induced corrosion in concrete structures, finely grained mineral admixtures, for example, pulverized fuel ash (PFA), ground granulated blast furnace slag (GGBS) and silica fume (SF) have been often advised to replace ordinary Portland cement (OPC) partially as binder. A consistent assessment of those partial replacements has been rarely performed with respect to the resistance of each binder to corrosion, although the studies for each binder were extensively looked into in a way of measuring the corrosion rate, influence of microstructure or chemistry of chlorides ions with cement hydrations. The paper studies the behavior of steel corrosion, chloride transport, pore structure and buffering capacity of those cementitious binders. The corrosion rate of steel in mortars of OPC, 30% PFA, 60% GGBS and 10% SF respectively, with chloride in cast ranging from 0.0 to 3.0% by weight of binder was measured at 7, 28 and 150 days to determine the chloride threshold level and the rate of corrosion propagation, using the anodic polarization technique. Mercury intrusion porosimetry was also applied to cement pastes of each binder at 7 and 28 days to ensure the development of pore structure. Finally, the release rate of bound chlorides (i.e. buffering capacity) was measured at 150 days. The chloride threshold level was determined assuming that the corrosion rate is beyond 1-2 mA/$m^3$ at corrosion and the order of the level was OPC > 10% SF > 60% GGBS > 30% PFA. Mercury intrusion porosimetry showed that 10% SF paste produced the most dense pore structure, followed by 60% GGBS, 30% PFA and OPC pastes, respectively. It was found that OPC itself is beneficial in resisting to corrosion initiation, but use of pozzolanic materials as binders shows more resistance to chloride transport into concrete, thus delay the onset of corrosion.

• Journal of Korea Multimedia Society
• /
• v.9 no.8
• /
• pp.1020-1029
• /
• 2006

Realization of high-capacity quality-of-service router needs fair packet schedulers with a lower complexity. Timestamp based fair packet schedulers have the ideal complexity of O(log V), where V is the maximum number of admitted flows, but it has been recently reduced to O(1) using bin concept. However, the latency property was deteriorated and the bandwidth utilization was also declined. In addition, traffic flows requiring strong delay bound may not be admitted. To overcome these problems, this paper proposes a Mini-Bin based Start-Time (MBST) scheduler with variable complexity and evaluates its performance. The MBST scheduler uses the timestamp calculation scheme of start-time based schedulers to enhance the bandwidth utilization and also introduces mini-bin concept to improve the latency, The performance evaluation shows that the proposed scheduler can reduce the complexity of the legacy start-tine based schedulers by $1.8{\sim}5$ times without deteriorating the bandwidth utilization property.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.11
• /
• pp.2920-2939
• /
• 2012

Enterprises that develop online games have to deploy supporting infrastructures, including hardware and bandwidth resources, in order to provide a good service to users. First Person Shooter games generate high rates of small UDP packets from the client to the server, so the overhead is significant. This work analyzes a method that saves bandwidth, by the addition of a local agent which queues packets, compresses headers and uses a tunnel to send a number of packets within a multiplexed packet. The behavior of the system has been studied, showing that significant bandwidth savings can be achieved. For certain titles, up to 38% of the bandwidth can be saved for IPv4. This percentage increases to 54% for IPv6, as this protocol has a bigger overhead. The cost of these bandwidth savings is the addition of a new delay, which has an upper bound that can be modified. So there is a tradeoff: the greater the added delays, the greater the bandwidth savings. Significant reductions in the amounts of packets per second generated can also be obtained. Tests have been deployed in an emulated scenario matching an access network, showing that if the number of players is big enough, the added delays can be acceptable in terms of user experience.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.21 no.4
• /
• pp.497-507
• /
• 2018

Tactical networks are evolving into an All-IP based network for network centric warfare(NCW). Owing to the flexibility of IP based network, various military data applications including real-time and multi-media services are being integrated in tactical networks. Because each application has diverse Quality-of-service(QoS) requirements, it is crucial to develop a QoS provisioning method for guaranteeing QoS requirements efficiently. Conventionally, differentiated services(DiffServ) have been used to provide a different level of QoS for traffic flows. However, DiffServ is not designed to guarantee a specific requirement of QoS such as delay, loss, and bandwidth. Therefore, it is not suitable for military applications with a tight bound of QoS requirements. In this paper, we propose a multi-layer network virtualization scheme that allocates traffic flows having different QoS requirements to multiple virtual networks, which are constructed to support different QoS policies such as virtual network functions(VNFs), routing, queueing/active queue management(AQM), and physical layer policy. The experiment results indicate that the proposed scheme achieves lower delays and losses through multiple virtual networks having differentiated QoS policies in comparison with conventional networks.

• The KIPS Transactions:PartC
• /
• v.13C no.2 s.105
• /
• pp.203-210
• /
• 2006

Fair packet scheduling algorithms supporting quality-of-services of real-time multimedia applications can be classified into the following two design schemes in terms of the reference time used in calculating the timestamp of arriving packet: Finish-time Design (FD) and Start-time Design (SD) schemes. Since the former can adjust the latency of a flow with raising the flow's reserved rate, it has been applied to a router for the guaranteed service of the IETF (Internet Engineering Task Force) IntServ model. However, the FD scheme may incur severe bandwidth loss for traffic flows requiring low-rate but strong delay bound such as internet phone. In order to verify the usefulness of the SD scheme based router for the IETF guaranteed service, this paper analyzes and compares two design schemes in terms of bandwidth and payload utilizations. It is analytically proved that the SD scheme is better bandwidth utilization than the FD one, and the simulation result shows that the SD scheme gives better payload utilization by up to 20%.

• YAKHAK HOEJI
• /
• v.48 no.4
• /
• pp.247-253
• /
• 2004

We investigated the hypoglycemic effect of formula containing Euonymus alatus (EA) and Mori Folium (MF) in multiple low dose (MLD) streptozotocin (STZ)-induced diabetic rats. In order to iduce hyperglycemic state 25 mg/kg of STZ was injected intraperitoneally for 5 consecutive days. SD rats were randomly divided into diabetic control and treatment groups. Treatment groups were administered with either 250 mg/kg of EA and 250 mg/kg of MF (E1Ml), or 500 mg/kg of EA mixed with same dose of MF (E2M2) for 3 weeks. Blood glucose levels and body weights were measured every 5th or 6th day. E1Ml and E2M2 both significantly reduced food intake, water intake, and fasting blood and urine glucose levels as compared to those in diabetic control group in a dose dependent manner. Body weight in diabetic control group was increased slightly after 3 weeks. Treatment group, however, showed gradual increase in body weights during 3 week-period. While plasma insulin levels of the diabetic control group were decreased to the level of 387$\pm$14 pg/ml from 534$\pm$36 pg/ml, those levels in E1Ml and E2M2-treated groups were both markedly increased by 13% and 26%, respectively. Urine glucose levels in E1Ml and E2M2-treated groups were also remarkably reduced by 17 and 26% compared to the levels of diabetic control group. While expression of membrane-bound glucose transporter-4 (GLUT-4) protein in skeletal muscle was reduced by 45% in diabetic control compared to the normal control, GLUT-4 protein expressions in E1Ml and E2M2-treated groups were augmented by 2 and 3.5 times compared to the diabetic control, respectively. Pancreatic HE staining experiments showed that E2M2-treated group revealed much less infiltrated mononuclear cells, indicating that E2M2 efficiently blocked insulitis induced by multiple low dose streptozotocin. Taken together, we conclude that formula containing EA and MF may prevent or delay the development of hyperglycemia through overexpression of GLUT-4 protein in skeletal muscle and prevention of insulitis.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.11
• /
• pp.2553-2562
• /
• 2013

It is difficult for TCP congestion control algorithm to ensure the bandwidth and delay bound required for media streaming services in broadband wireless network environments. In this paper, we propose the COIN TCP (COncave INcrease TCP) scheme for providing a high-quality media streaming services. The COIN TCP concavely increases the congestion window size by adjusting the increment rate of congestion window, that is inversely proportional to the amount of data accumulated in the router queue. As a result, our scheme can quickly occupy the available bandwidth and prevent the heavy congestion. It also improves the link utilization by adjusting the decrement rate of congestion window according to the packet loss rate with the random loss. Through the simulation results, we prove that our scheme improves the total throughput in broadband wireless network.