• The KIPS Transactions:PartC
• /
• v.9C no.1
• /
• pp.45-54
• /
• 2002

MPLS(Multiprotocol Label Switching) is regarded as a core technology for migrating to the next generation Internet. In this paper, we propose an dynamic flow admission control supporting DiffServ(Differentiated Services) to provide QoS in MPLS networks. Our proposed model dynamically adjusts the amount of admissible traffic based on transmittable capacity over one outgoing port. It then transmits the Packets while avoiding congested area resulting traffic loss. Ingress LSRs find out the congested area by collecting network state information at QoS state update for QoS routing table. Our Proposed model manages the resource efficiently by protecting the waste of resources that is a critical Problem of DiffServ and makes much more flows enter the network to be served.

• KIPS Transactions on Computer and Communication Systems
• /
• v.4 no.3
• /
• pp.81-84
• /
• 2015

Cloud service is one of major technologies in modern IT business. Due to the dynamics of user demands, service providers need VM(Virtual Machine) provisioning mechanism to predict the amount of resources demanded by cloud users for the next service and to prepare the resources. VM provisioning provides the QoS to cloud user and maximize the revenue of a service provider by minimizing the expense. In this paper, we propose a new VM provisioning technique to minimize the total expense of a service provider by minimizing the expected value of the expense based on the predicted demands of users. To evaluate the effectiveness of our prediction technique, we compare the total expense of our technique with these of the other prediction techniques with a series of real trace data.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.39 no.4
• /
• pp.180-187
• /
• 2002

Many real-time multimedia applications, such as video conferencing have stringent end-to-end delay constraints and consume large amount of network resources. In order to support these applications efficiently, multicast routing algorithms computing least cost multicast trees that satisfy a given end-to-end delay constraint are needed. However, finding such a tree is known to be computationally expensive. Therefore, we propose a heuristic distributed multicast routing algorithm that reduces a “finding multicast tree”that satisfies a given end-to-end delay constraint and minimizes the average resulting tree cost. Also, simulation results show that the proposed algorithm has much better average cost performance than other existing algorithms.

• The Journal of Korean Institute of Information Technology
• /
• v.17 no.9
• /
• pp.91-97
• /
• 2019

When a radar tracks the warhead of a ballistic missile, decoys of a ballistic missile put a heavy burden on the radar resource management tracking the targets. To reduce this burden, it is necessary to be able to separate the signal of the warhead from the received dynamic radar cross section (RCS) signal on the radar. In this paper, we propose the method of separating the dynamic RCS of each target from the received signal by the Hough transform which extracts straight lines from the image. The micro motion of the targets was implemented using a 3D CAD model of the warhead and decoys. Then, we calculated the dynamic RCS from the 3D CAD model having micromotion and verified the performance by applying the proposed algorithm. Simulation results show that the proposed method can separate the signals of the warhead and decoys at the signal-to-noise ratio (SNR) of 10dB.

• Journal of IKEEE
• /
• v.5 no.1 s.8
• /
• pp.100-110
• /
• 2001

In this paper, we investigated several buffer management schemes for the design of shared-memory type ATM switches, which can enhance the utilization of switch resources and can support quality-of-service (QoS) functionalities. Our results show that dynamic threshold (DT) scheme demonstrate a moderate degree of robustness close to pushout(PO) scheme, which is known to be impractical in the perspective of hardware implementation, under various traffic conditions such as traffic loads, burstyness of incoming traffic, and load non-uniformity across output ports. Next, we considered buffer management strategies to support QoS functions, which utilize parameter values obtained via connection admission control (CAC) procedures to set tile threshold values. Through simulations, we showed that the buffer management schemes adopted behave well in the sense that they can protect regulated traffic from unregulated cell traffic in allocating buffer space. In particular, it was observed that dynamic partitioning is superior in terms of QoS support than virtual partitioning.