• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.8B
• /
• pp.677-686
• /
• 2012

In the presence of a high power cellular network, picocells are added to a Macro-cell layout aiming to enhance total system throughput from cell-splitting. While because of the different transmission power between macrocell and picocell, and co-channel interference challenges between the existing macrocell and the new low power node-picocell, these problems result in no substantive improvement to total system effective throughput. Some works have investigated on these problems. Pico Cell Range Expansion (CRE) technique tries to employ some methods (such as adding a bias for Pico cell RSRP) to drive to offload some UEs to camp on picocells. In this work, we propose two solution schemes (including cell selection method, channel allocation and serving process) and combine new adaptive frequency partitioning reuse scheme to improve the total system throughput. In the simulation, we evaluate the performances of heterogeneous networks for downlink transmission in terms of channel utilization per cell (pico and macro), call blocking probability, outage probability and effective throughput. The simulation results show that the call blocking probability and outage probability are reduced remarkably and the throughput is increased effectively.

• The Journal of the Korea Contents Association
• /
• v.4 no.4
• /
• pp.189-196
• /
• 2004

Most of the recent researches for ATM switches have been based on multistage interconnection network known as regularity and self-routing property. These networks can switch packets simultaneously and in parallel. However, they are blocking networks in the sense that packet is capable of collision with each other Mainly Banyan network have been used for structure. There are several ways to reduce the blocking or to increase the throughput of banyan-type switches: increasing the internal link speeds, placing buffers in each switching node, using multiple path, distributing the load evenly in front of the banyan network and so on. Therefore, this paper proposes the use of recirculating shuffle-exchange network to reduce the blocking and to improve hardware complexity. This structures are recirculating shuffle-exchange network as simplified in hardware complexity and Rank network with tree structure which send only a packet with highest priority to the next network, and recirculate the others to the previous network. after it decides priority number on the Packets transferred to the same destination, The transferred Packets into banyan network use the function of self routing through decomposition and composition algorithm and all they arrive at final destinations. To analyze throughput, waiting time and packet loss ratio according to the size of buffer, the probabilities are modeled by a binomial distribution of packet arrival. If it is 50 percentage of load, the size of buffer is more than 15. It means the acceptable packet loss ratio. Therefore, this paper simplify the hardware complexity as use of recirculating shuffle-exchange network instead of bitonic sorter.

• Journal of Korea Multimedia Society
• /
• v.17 no.8
• /
• pp.988-994
• /
• 2014

Software Defined Network (SDN) is a new technology in computer network area which enables user to centralize control plane. The security issue is important in computer network to protect system from attackers. SYN flooding attack is one of Distributed Denial of Service attack methods which are popular to degrade availability of targeted service on Internet. There are many methods to protect system from attackers, i.e. firewall and IDS. Even though firewall is designed to protect network system, but it cannot mitigate DDoS attack well because it is not designed to do so. To improve performance of DDOS mitigation we utilize another mechanism by using SDN technology such as OpenFlow and sFlow. The methodology of sFlow to detect attacker is by capturing and sum cumulative traffic from each agent to send to sFlow collector to analyze. When sFlow collector detect some traffics as attacker, OpenFlow controller will modify the rule in OpenFlow table to mitigate attacks by blocking attack traffic. Hence, by combining sum cumulative traffic use sFlow and blocking traffic use OpenFlow we can detect and mitigate SYN flooding attack quickly and cheaply.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.4
• /
• pp.246-251
• /
• 2013

In this paper, it is proposed a bandwidth allocation Scheme based on Bankruptcy theory in Distributed Mobile Multimedia Network. The proposed scheme is guaranteed a minimum allocation. So, the minimum quality of each service are guaranteed. Therefore efficient and fairness network can be configured. The performance evaluation results indicate that the proposed scheme has good performance than other existing schemes by the fairness index and the Erlang blocking formular calculation. The minimum bandwidth of the proposed scheme can be applied to other techniques of a priority based bandwidth allocation scheme and dynamic bandwidth allocation scheme.

• ETRI Journal
• /
• v.44 no.5
• /
• pp.733-745
• /
• 2022

In software-defined wireless networking (SDWN), the optimal routing technique is one of the effective solutions to improve its performance. This routing technique is done by many different methods, with the most common using integer linear programming problem (ILP), building optimal routing metrics. These methods often only focus on one routing objective, such as minimizing the packet blocking probability, minimizing end-to-end delay (EED), and maximizing network throughput. It is difficult to consider multiple objectives concurrently in a routing algorithm. In this paper, we investigate the application of machine learning to control routing in the SDWN. An intelligent routing algorithm is then proposed based on the machine learning to improve the network performance. The proposed algorithm can optimize multiple routing objectives. Our idea is to combine supervised learning (SL) and reinforcement learning (RL) methods to discover new routes. The SL is used to predict the performance metrics of the links, including EED quality of transmission (QoT), and packet blocking probability (PBP). The routing is done by the RL method. We use the Q-value in the fundamental equation of the RL to store the PBP, which is used for the aim of route selection. Concurrently, the learning rate coefficient is flexibly changed to determine the constraints of routing during learning. These constraints include QoT and EED. Our performance evaluations based on OMNeT++ have shown that the proposed algorithm has significantly improved the network performance in terms of the QoT, EED, packet delivery ratio, and network throughput compared with other well-known routing algorithms.

• Journal of the Korean Mathematical Society
• /
• v.35 no.3
• /
• pp.539-557
• /
• 1998

This paper is concerned with the performance evaluation of loss networks. We shall review the Erlang Fixed Point (EFP) method for estimating the blocking probabilities, which is based on an assumption that links are blocked independently. For networks with linear structure, the behaviour of adjacent links can be highly correlated. We shall give particular attention to recently-developed fixed-point methods which specifically account for the dependencies between neighbouring links. For the network considered here, namely a ring network with two types of traffic, these methods produce relative errors typically $10^{-5}$ of that found using the basic EFP approximation.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.22 no.4
• /
• pp.51-69
• /
• 1997

Recently Lee et al[5] developed an approximation algorithm for the performance evaluation of the open queueing networks with blocking. This algorithm, which solves the exponential queueing networks with general configuration is developed based on the symmetrical decomposition approach and is reported to have many advantages over the previous algorithmsf. In addition to being very accurate, this algorithm is reported to be quite simple, pretty fast and solves very general configurations. In this study, we show that if a network has a tree-like configurations, the algorithm developed by Lee at al, always converges to the unique solution. To prove the theoretical results pertaining to the algorithm, some properties associated with symmetrical decomposition approach are exploited. The results obtained in this study such as the proofs of convergence of the algorithm as well as uniquences of the solution would contribute to the theoretical study for the non-tandem configurating of open queueing network.

• Proceedings of the KIEE Conference
• /
• 2005.10b
• /
• pp.349-351
• /
• 2005

현재 다양한 인터넷 콘텐츠들에 의해 많은 정보가 공유되고 있으며, 유익한 정보들과 더불어 성인물과 같은 유해한 정보들이 있다. 이로 인하여 여러 문제점들이 야기되고 있으며, 이를 해결하기 위해 다양한 방법들이 제안되고 있다. 그 중에서 성인 영상 차단을 위한 연구도 많이 행해지고 있으며 주로 색상을 이용한 방법을 사용하고 있다. 그러나 살색과 유사한 영상이나 노출이 심한 영상에는 성인 영상 검출의 신뢰성이 떨어지는 단점을 갖는다. 본 논문에서는 이런 문제점을 해결하기 위해 새로운 성인 영상 차단 방법을 제안한다. 기존의 제안된 살색 검출을 이용한 방법을 기반으로 성인 영상물로 판정될 수 있는 신체 부위를 검출함으로써 강인한 성인 영상 차단을 한다. 신체 부위에 대한 판별을 위해 여러 기저 영상에서 특징 벡터를 추출하고. 이 벡터를 Back Propagation(BP) 신경망의 데이터로 이용하여 학습한다. 제안한 성인 영상 차단 방법의 성능을 여러 장의 살색과 유사한 색상의 물체 영상과 노출이 심한 영상, 성인 영상을 이용한 종합적인 실험 결과인 성인 영상 검출률을 통해 증명한다.

• IE interfaces
• /
• v.11 no.1
• /
• pp.155-163
• /
• 1998

In multiparty multimedia communication, each participant not only receives information from other participants but also generates real-time data streams to distribute to others and therefore the difference between source and destination is not clear in terms of data transmission. During a teleconference session, many sub-multicast trees may be generated to exchange information to specific members within the multicast group and if those sub-multicast trees use the same fixed multicast tree, the blocking probability will be high and it is hard to provide QoS for each sub-multicast group. Also, even though there exits some shortcuts between each sub-multicast group, fixed multicast tree does not allow to use those shortcuts. Thus to overcome these problems. We propose a network resource reservation protocol and show that its effectiveness in terms of blocking probability and network resources usage.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.46 no.6
• /
• pp.78-87
• /
• 2009

In this paper, we propose a new method of blocky artifacts measurement for IP based video service. In order to assess the quality of IP based video service, we classify degradation into blocking artifacts by network error or by transmission error. in order to assess blocking artifacts based on No-reference, we estimate blocky artifacts from network errors and image compression by calculating amount of difference between target block and neighbor blocks and error concealment algorithm in a video receiver. To ensure accuracy of proposed method, we compare our result to MOS data using SSCQE method. Experimental results show that the proposed algorithm is better than a conventional method by around 1.3.