• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.29 no.2
• /
• pp.393-399
• /
• 2019

In a situation where an unauthorized SW brought into the organization without being authorized is emerging as a threat to the network security, the security of the network based on the SDN(Software-Defined Network) can be strengthened through the development of the security application considering the organization's characteristics. Security technology of existing SDN environment has been studied to protect internal network from external networks such as firewalls and Intrusion Detection Systems, but the research for resolving insider threat was insufficient. Therefore, We propose a system that protects the internal network from unauthorized SW, which is one of the insider threats in the SDN environment.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.5
• /
• pp.1319-1326
• /
• 1997

The Internet is a very convenient neteork, but not always a So.many orvanizations often require administrative security policies when they want to connect with ther organizations thtough a pubic network.A firewall is one way of protecting an internal network from the untrusted extemal network with a mechanism for selectively permiting or blocking traffic between the intermal network and the extermal network. The firewall also provides some limited Intemet access such as Ftp.Telet, etc.Usually , through a firewall system, X applications running on the extermal network may not access an X display on the intermal network.Thus, X applications run-ning on the extemal network are not supported through the usual firewall.In this paper, we propose a method of suppoting X application programs effedtively dffectvely through the firewall, overcoming this restriction.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.1
• /
• pp.80-90
• /
• 1996

The efficienty of ATM is based on the statical multiplexing of fixed-length packets, which are called cells. The most important technical point for realizing ATM switching network is an arrangement of the buffers and switches. Current most ATM switching networks are being achieved by using the switching modules based on the unit switch of $8{\times}8$ 150Mb/s or $16{\times}16$ 150Mb/s, the unit switch of $32{\times}32$150Mb/s for a large scale system is under study in many countries. In this paper, we proposed a new $32{\times}32$(4.9Gb/s throughput) ATM switch using Shared buffer memory switch which provides superior traffic characteristics in the cell loss, delay and throughput performance and easy LSI(Large Scale Integrated circuit). We analytically estimated and simulated by computer the buffer size into it. We also proposed the configuration of the large capacity ATM switching network($M{\times}M$.M>1,000) consisting of multistage to improve the link speed by non-blocking.

• Journal of Internet Computing and Services
• /
• v.6 no.5
• /
• pp.123-132
• /
• 2005

By complementary integration of WLAN and UMTS, a Beyond third Generation(B3G) mobile network can be constructed to establish the fastest global roaming environments, There are 2 types of B3G networks: loosely-coupled and tightly-coupled, A tightly-coupled network demands lots of investment and considerable amount of time to construct. On the other hand a loosely-coupled network is more scalable and easier to implement than a tightly-coupled one, But it has critical drawbacks of packet loss and blocking of services due to handover delay, To alleviate these drawbacks this thesis proposes a vertical handover procedure between WLAN and UMTS, which is based on MAP of HMIPv6, Performance of the proposal is evaluated in terms of blocking probabilities, The proposed procedure based on HMIPv6 shows better performance than those based on MIP.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38C no.9
• /
• pp.764-774
• /
• 2013

The number of users and data packets has increased in 4G cellular networks. Therefore, 4G cellular network providers suffer from the network capacity problem. In order to solve this problem, femtocell concept is suggested. It can reduce the coverage hole and enhance the QoS. However, only small number of femtocells experience the large amount of loads. To solve this problem, Mobility Load Balancing (MLB) algorithm is suggested, which is a kind of load balancing algorithm. To distribute the traffic load, MLB algorithm modifies the handover region. If the handover region is reduced by MLB algorithm, some cell edge users are compulsively handed over to neighbor femtocell. In this paper, we analyze the relation between MLB performing period and performance indicators. For example throughput and blocking probability is reduced, if period is decreased. On the contrast, if period is increased, the number of handover frequency is decreased. Using this relation, we suggest the adaptive periodic MLB algorithm. This algorithm includes the advantage of both long period and short period MLB algorithm, such as high throughput, the small number of handover frequency, and low blocking probability.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.3
• /
• pp.838-856
• /
• 2014

Enhanced network speed and the appearance of various applications have recently resulted in the rapid increase of Internet users and the explosive growth of network traffic. Under this circumstance, Internet users are eager to receive reliable and Quality of Service (QoS)-guaranteed services. To provide reliable network services, network managers need to perform control measures involving dropping or blocking each traffic type. To manage a traffic type, it is necessary to rapidly measure and correctly analyze Internet traffic as well as classify network traffic according to applications. Such traffic classification result provides basic information for ensuring service-specific QoS. Several traffic classification methodologies have been introduced; however, there has been no favorable method in achieving optimal performance in terms of accuracy, completeness, and applicability in a real network environment. In this paper, we propose a method to classify Internet traffic as the first step to provide stable network services. We integrate the existing methodologies to compensate their weaknesses and to improve the overall accuracy and completeness of the classification. We prioritize the existing methodologies, which complement each other, in our integrated classification system.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.10
• /
• pp.1-7
• /
• 2003

In this paper, we propose load balanced routing and wavelength assignment (RWA) algorithm for static model. The proposed algorithm arranges the routing paths over the link uniformly and assigns routing paths according to the length of routing paths orderly. Thus, the proposed algorithm can efficiently utilize the network resources. Through the computer simulation on layered-graph model, we prove that the proposed algorithm improves network throughput and reduces blocking probability comparing to first-fit algorithm [1］. Moreover, the proposed algorithm considerably reduces computational time.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.12 no.2
• /
• pp.119-131
• /
• 2008

The paper considers the computation method in the performance evaluation of cellular network in the phase-type distribution assumptions that the channel holding times induced from mobility are modeled by well-fitted distributions to reflect an actual situation. When ww consider a phase-type distribution model instead of exponential distribution, the complexity of the computation increase exponential even though the accuracy is improved. We consider an efficient numerical algorithm to compute the performance evaluations in cellular networks such as a handoff call dropping probability, new call blocking probability, and handoff arrival rate. Numerical experiment shows that numerical analysis results are well approximated to the results of simulation.

• Journal of Digital Contents Society
• /
• v.3 no.1
• /
• pp.89-99
• /
• 2002

Saturation routing algorithm is known to be an effective routing mechanism for tactical application and packet radio networks, since it minimizes the call set-up time and does not have to maintain routing tables. But, it is known that it has significant drawbacks with respect to the network efficiency, the overhead on the control messages [1]. We consider a tactical circuit-switched grid network with a maximum of tour links and two priority classes of voice traffic. Using the minimum first-derivative length (MFDL) path, we improve the blocking probability performance of a circuit-switched network without increasing the call set-up time and processor loading of the algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.3
• /
• pp.360-371
• /
• 1993

Flood search algorithm is known to be an effective routing mechanism for tactical application, since it provides high degree of survivability and robustness. But it is known that it has significant drawbacks with respect to the network efficiency [1]. We consider a tactical circuit-switched grid network with a maximum of four links and two priority classes of voice traffic, Using the minimum first-derivative length (MFDL) path, we improve the blocking probability performance of the circuit-switched network without increasing the call set-up time and processor loading of the algorithm.