• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 2003.05a
• /
• pp.8-13
• /
• 2003

Historically, IP-based internets have been able to provide a simple best-effort delivery service to all applications they carry. Best effort treats all packets equally, with no service level, packet loss, and delay. But the needs of users have changed. The want to use the new real-time, multimedia, and multicasting applications. Thus, there is a strong need to be able to support a variety of traffic with a variety of quality-of-service requirements. The DiffServ architecture, proposed by the Internet Engineering Task Force(IETF), has become the most viable solution for provising QoS over IP networks. The DiffServ architecture does not specify any handling method between AF out-profile packets and BE packets. This paper propose a mechanism for supporting inter class fairness in the DiffServ architecture. Ⅰ proposed a modified Weighted Round Robin method to protect the BE traffic from AF out-profile packets in the core routers. The proposed technique is evaluated through simulation. Simulation results indicate that the proposed method provides better protection not only for BE packets from AF out-profile packets, but also for the AF in-profile packets in congested networks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.5B
• /
• pp.344-355
• /
• 2008

In this paper, we are dealing with the problems of performance evaluation of Differentiated Services(DiffServ) networks. For successful performance evaluation, the ability to accurately represent "real" traffic on the network by suitable traffic models is an essential ingredient. Many research results on the nature of real traffic measurements demonstrated LRD(long-range dependence) property for the Internet traffic including Web, TELNET, and P2P traffic. The LRD can be effectively represented by self-similarity. In this paper, we design and implement self-similar traffic generator using the aggregated On/Off source model, based on the analysis of the On-Off source model, FFT-FGN(Fast Fourier Transform-Fractional Gaussian Noise) model, and RMD(Random Midpoint Displacement) model. We confirmed the self-similarity of our generated traffic by checking the packet inter-arrival time of TCPdump data. Further we applied the implemented traffic generator to the performance evaluation of DiffServ networks and observed the effect of performance to the a value of the On/Off model, and performance of EF/BE class traffic by CBQ.

• Korean Journal of Poultry Science
• /
• v.42 no.2
• /
• pp.109-116
• /
• 2015

Ogye rooster sperm chromatin status can be detected using well established sperm assays. In this paper, a simple and fast method to monitor rooster sperm chromatin status could be employed in field for assessment of chicken sperm quality. Using standard bright field microscope, Diff-Quik stains can be reproducibly, easily and routinely monitored with simple staining. The presence of abnormal chromatin staining of rooster sperm was determined by darker stain in head. In the fresh semen, the viabilities of three tested Ogye spermatozoa were 93.53%, 82.42% and 90.63% and normal chromatin rates were 87.96%, 74.25% and 85.10% respectively. However, after freezing, the rates of viability of thawed semen were reduced to 69.58%, 61.98% and 72.20% and normal chromatin rate also reduced to 58.91%, 48.49% and 63.34%. A significant correlation between live sperm and normal sperm nuclei was 0.875 in fresh semen and 0.513 in frozen semen. After incubation of sperm at $37^{\circ}C$ for 5min, the rates of viability, chromatin normality and sperm head activity were shown as $90.63{\pm}1.28%$, $82.44{\pm}8.09%$ and $66.68{\pm}10.29%$ in fresh semen. However, the rates of thawed semen were reduced to $67.92{\pm}7.55%$, $56.92{\pm}12.15%$ and 47.32{\pm}5.02%, respectively. The relationship between chromatin normality and sperm head movements in fresh and thawed semen were 0.564 and 0.540, respectively. With these results, the chicken sperm normality could be assessed by the Diff-Quik staining that could be used for chromatin status of sperm head and activated morphology of live spermatozoa, as a simple and rapid staining method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.2
• /
• pp.473-494
• /
• 2020

To provide a guaranteed Quality of Service (QoS) to real-time traffic in High-Speed Downlink Packet Access (HSDPA) core network, we proposed an enhanced mechanism. For an enhanced QoS, a Class-Based Low Latency Fair Queueing (CBLLFQ) packet scheduling algorithm is introduced in this work. Packet classification, metering, queuing, and scheduling using differentiated services (DiffServ) environment was the points in focus. To classify different types of real-time voice and multimedia traffic, the QoS provisioning mechanisms use different DiffServ code points (DSCP).The proposed algorithm is based on traffic classes which efficiently require the guarantee of services and specified level of fairness. In CBLLFQ, a mapping criterion and an efficient queuing mechanism for voice, video and other traffic in separate queues are used. It is proved, that the algorithm enhances the throughput and fairness along with a reduction in the delay and packet loss factors for smooth and worst traffic conditions. The results calculated through simulation show that the proposed calculations meet the QoS prerequisites efficiently.

• Journal of the Korean Mathematical Society
• /
• v.47 no.4
• /
• pp.675-689
• /
• 2010

For a closed symplectic 4-manifold X, let $Diff_0$(X) be the group of diffeomorphisms of X smoothly isotopic to the identity, and let Symp(X) be the subgroup of $Diff_0$(X) consisting of symplectic automorphisms. In this paper we show that for any finitely given collection of positive integers {$n_1$, $n_2$, $\ldots$, $n_k$} and any non-negative integer m, there exists a closed symplectic (or K$\ddot{a}$hler) 4-manifold X with $b_2^+$ (X) > m such that the homologies $H_i$ of the quotient space $Diff_0$(X)/Symp(X) over the rational coefficients are non-trivial for all odd degrees i = $2n_1$ - 1, $\ldots$, $2n_k$ - 1. The basic idea of this paper is to use the local invariants for symplectic 4-manifolds with contact boundary, which are extended from the invariants of Kronheimer for closed symplectic 4-manifolds, as well as the symplectic compactifications of Stein surfaces of Lisca and Mati$\acute{c}$.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.4B
• /
• pp.255-269
• /
• 2006

The differentiated services(DiffServ) architecture provides packet level service differentiation through the simple and predefined Per-Hop Behaviors(PHBs). The Assured Forwarding(AF) PHB proposed as the assured services uses the RED-in/out(RIO) approach to ensusre the expected capacity specified by the service profile. However, the AF PHB fails to give good QoS and fairness to the TCP flows. This is because OUT(out- of-profile) packet droppings at the RIO buffer are unfair and sporadic during only network congestion while the TCP's congestion control algorithm works with a different round trip time(RTT). In this paper, we propose an Adaptive Regulating Drop(ARD) marker, as a novel dropping strategy at the ingressive edge router, to improve TCP fairness in assured services without a decrease in the link utilization. To drop packets pertinently, the ARD marker adaptively changes a Temporary Permitted Rate(TPR) for aggregate TCP flows. To reduce the excessive use of greedy TCP flows by notifying droppings of their IN packets constantly to them without a decrease in the link utilization, according to the TPR, the ARD marker performs random early fair remarking and dropping of their excessive IN packets at the aggregate flow level. Thus, the throughput of a TCP flow no more depends on only the sporadic and unfair OUT packet droppings at the RIO buffer in the core router. Then, the ARD marker regulates the packet transmission rate of each TCP flow to the contract rate by increasing TCP fairness, without a decrease in the link utilization.

• Journal of Communications and Networks
• /
• v.10 no.3
• /
• pp.338-350
• /
• 2008

The differentiated services (DiffServ) is proposed to provide packet level service differentiations in a scalable manner. To provide an end-to-end service differentiation to users having a connection over multiple domains, as well as a flow marker, an intermediate marker is necessary at the edge routers, and it should not be operated at a flow level due to a scalability problem. Due to this operation requirement, the intermediate marker has a fairness problem among the transmission control protocol (TCP) flows since TCP flows have intrinsically unfair throughputs due to the TCP's congestion control algorithm. Moreover, it is very difficult to resolve this problem without individual flow state information such as round trip time (RTT) and sending rate of each flow. In this paper, to resolve this TCP fairness problem of an intermediate marker, we propose a fair scalable marker (FSM) as an intermediate marker which works with a source flow three color marker (sf-TCM) operating as a host source marker. The proposed fair scalable marker improves the fairness among the TCP flows with different RTTs without per-flow management. Through the simulations, we show that the FSM can improve TCP fairness as well as link utilization in multiple domain DiffServ networks.

• Journal of Information Processing Systems
• /
• v.5 no.2
• /
• pp.97-104
• /
• 2009

In this paper we propose a Differentiated Services Based Admission Control and Routing Algorithm for IPv6 (ACMRA). The basic DiffServ architecture lacks an admission control mechanism, the injection of more QoS sensitive traffic into the network can cause congestion at the core of the network. Our Differentiated Services Based Admission Control and Routing Algorithm for IPv6 combines the admission control phase with the route finding phase, and our routing protocol has been designed in a way to work alongside DiffServ based networks. The Differentiated Services Based Admission Control and Routing Algorithm for IPv6 constructs label switched paths in order to provide rigorous QoS provisioning. We have conducted extensive simulations to validate the effectiveness and efficiency of our proposed admission control and routing algorithm. Simulation Results show that the Differentiated Services Based Admission Control and Routing Algorithm for IPv6 provides an excellent packet delivery ratio, reduces the control packets' overhead, and makes use of the resources present on multiple paths to the destination network, while almost each admitted flow shows compliance with its Service Level Agreement.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.48 no.1
• /
• pp.80-89
• /
• 2011

While detecting changes in XML documents has emerged as a major research area, the level of research on edit scripts, which are the result of the change detection, is not far from satisfactory. In this paper, we present X-treeESgen, the algorithm generating edit scripts used in X-treeDiff+, a change detection algorithm for XML documents. X-treeESgen shows the time complexity of O(n), and support move and copy operations in addition to the basic set that is update, insert, and delete operations. Note that no other change detection algorithm provide all the operations. Also, since the process of generating edit scripts in X-treeESgen is designed independent of the process of matching, various tuning techniques may be applied.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.10a
• /
• pp.165-167
• /
• 2014

In this paper, an packet drop technique is proposed to outperform the previous RIO (RED In and Out) drop mechanism for DiffServ in ship area networks. the proposed packet drop technique does not manage the individual flows and divides them into several flow groups according to a criterion. And it guarantees the fairness between individual flows in the same QoS class through the group-based control. In simulation results of the proposed packet drop technique, the link utilization decreases than RIO. But it guarantees more data rates to DiffServ flows passing multiple bottleneck links.