• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.8A
• /
• pp.1160-1168
• /
• 2000

This paper presents a real-time integrated traffic management (RITM) scheme that can effectively manage variable bit rate (VBR) and available bit rate (ABR) traffics having unpredictable characteristics in asynchronous transfer mode (ATM) networks. An unique feature of this scheme is that it has a special ATM cell control block which makes it possible to monitor bursty traffics in real-time so that the delay incurred to measure cell arrival rate is minimized. Additionally, the proposed scheme intends to dynamically reassign the leftover network resources to VBR/ABR connections without any deterioration in quality of service (QoS) of the existing connections. The RITM scheme has been verified to reliably monitor incoming traffics and to efficiently manage network resources by computer simulations. The capability of managing the incoming ATM traffics in real-time helps determine an optimal acceptable number of user connections for a given network condition. We can use this value as a threshold to protect the network from being congested and to find out a cost-effective buffer design method.

• IE interfaces
• /
• v.16 no.3
• /
• pp.311-321
• /
• 2003

We propose the improved channel assignment and management methods for an efficient use of traffic channel resource for supporting 12.2 Kbps, 64 Kbps, and 384 Kbps traffic with the different quality of service(QoS) in the radio network controller(RNC) in asynchronous IMT-2000 system. We consider two types of traffic channel block assignments for utilizing the traffic channel efficiently; the Completely Shared(CS) channel assignment and the Partially Dedicated and Partially Shared(PDPS) channel assignment. The former is that all traffic channel blocks are completely shared with all traffic types. The latter is that some traffic channel block is independently assigned to each traffic type and the other blocks are completely shared with some traffic type. We also propose the traffic channel management method which consists of the block and task management step, for efficiently assigning, releasing, and managing the channel resource. Finally, we evaluate the performance through various numerical examples when applying our proposed channel block assignment and resource management methods.

• The KIPS Transactions:PartC
• /
• v.12C no.6 s.102
• /
• pp.817-826
• /
• 2005

BcN(Broadband convergence Network) is being developed in order to support a variety of network applications, with enhanced capabilities of QoS(Quality of Service) provisioning and security, and IPv6. In a high-speed network environment such as BcN, it if more likely for the network resources to be exposed to various intrusion activities. The propagation speed of intrusion is alto expected to be much faster than in the existing Internet In this paper, we present a multi-domain security management framework which my be used for a global intrusion detection at multiple domains of BcN and describe its characteristics. For the performance evaluation, we first present test results for the security node and compare with other products. Then we design and Implement an OPNET simulator for the proposed framework, and present some simulation results. In the simulation model, we focus on the performance of alert information in the security overlay network.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.5
• /
• pp.13-18
• /
• 2016

In Long Term Evolution-Advanced (LTE-A), small cell enhancement(SCE) has been developed as a cost-effective way of supporting exponentially increasing demand of wireless data services and satisfying the user quality of service(QoS). However, there are many problems such as the transmission rate and transmission quality degradation due to the dense and irregular distribution of a large number of small cells. In this paper, we propose a clustering based interference management scheme in dense small cell network. We divide the small cells into different clusters according to the reference signal received power(RSRP) from user equipment(UE). Within a cluster, an almost blank subframe(ABS) is implemented to mitigate interference between the small cells. In addition, we apply the power control to reduce the interference between the clusters. Simulation results show that proposed scheme can improve Signal to Interference plus Noise Ratio(SINR), throughput, and spectral efficiency of small cell users. Eventually, proposed scheme can improve overall cell performance.

• Korean Management Science Review
• /
• v.23 no.3
• /
• pp.243-257
• /
• 2006

ITU-T's NgN(Next generation Network) architecture is expected to offer a new Internet platforms such as QoS(Quality of Service) guaranteed services as it overcame the limitations of the existing best-effort Internet architecture. However, policy development crucial for the NgN framework(e.g., interconnections and billing) is lagging far behind technology development. For example, arguments over network neutrality clearly indicate little understanding of the Internet industry structure where diverse providers including ISP and CP coexist. This study employs a network economics approach to predict how the competitive landscape involving various providers will evolve under the traffic-based billing system under the NgN environment. Applied is the non-cooperative game theory, in particular, Stackelberg's repeated game in order to build and analyze model for competition among those providers. We also studied possible impacts that CPs would have on the competitive landscape if they have an option to replace ISP: i.e., CDN(Content Delivery Network) provider. Lastly, based on the model analysis and experiments, presented are their implications to policy development and tile future prospect.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.9
• /
• pp.2118-2135
• /
• 2012

With the rapid development of heterogeneous emerging wireless technologies and numerous types of mobile devices, the need to support robust mobile video streaming based on the seamless handover in Future Internet is growing. To support the seamless handover, several IP-based mobility management protocols such as Mobile IPv6 (MIPv6), fast handover for the MIPv6 (FMIPv6), Hierarchical MIPv6 (HMIPv6) and Proxy Mobile IPv6 (PMIPv6) were developed. However, MIPv6 depreciates the Quality-of-Service (QoS) and FMIPv6 is not robust for the video services in heterogeneous emerging wireless networks when the Mobile Node (MN) may move to another visited network in contrast with its anticipation. In Future Internet, the possibility of mobile video service failure is more increased because mobile users consisting of multiple wireless network interfaces (WNICs) can frequently change the access networks according to their mobility in heterogeneous wireless access networks such as 3Generation (3G), Wireless Fidelity (Wi-Fi), Worldwide Interoperability for Microwave Access (WiMax) and Bluetooth co-existed. And in this environment, seamless mobility is coupled according to user preferences, enabling mobile users to be "Always Best Connected" (ABC) so that Quality of Experience is optimised and maintained. Even though HMIPv6 and PMIPv6 are proposed for the location management, handover latency enhancement, they still have limit of local mobility region. In this paper, we propose a robust mobile video streaming in Heterogeneous Emerging Wireless Systems. In the proposed scheme, the MN selects the best-according to an appropriate metric-wireless technology for a robust video streaming service among all wireless technologies by reducing the handover latency and initiation time when handover may fail. Through performance evaluation, we show that our scheme provides more robust mechanism than other schemes.

• Proceedings of the Society of Korea Industrial and System Engineering Conference
• /
• 2002.05a
• /
• pp.105-111
• /
• 2002

Presented is a Genetic Algorithm(GA) for dynamic partitioning an ATM LANE(LAN Emulation) network. LANE proves to be one of the best solutions to provide guaranteed Quality of Service(QoS) for mid-size campus or enterprise networks with a little modification of legacy LAN facilities. However, there are few researches on the efficient LANE network operations to deal with scalability issues arising from broadcast traffic delivery. To cope with this scalability issue, proposed is a decision model named LANE Partitioning Problem(LPP) which aims at partitioning the entire LANE network into multiple Emulated LANs(ELANs), each of which works as an independent virtual LAN.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.11b
• /
• pp.1391-1394
• /
• 2002

Diffserv에서 제시하고 있는 실시간 서비스에 대한 큐잉기법은 네트워크에서 사용자가 요구하는 다양한 서비스 특성을 배제하고 일반적인 우선순위를 할당하여 처리한다. 그러나, 이 기법은 실시간 서비스의 특징이 서로 다르고 요구되는 조건이 서로 다른 서비스에 대한 고려를 충분히 하고 있지 못하다. 따라서, 요구되는 조건이 서로 다른 다양한 서비스에 대한 서비스 품질(QoS;Quality of Service)를 보장하기 위하여, 기존의 버퍼관리 및 스케줄링 기법이 가지는 한계를 해결하기 위하여, 본 논문에서는 다양한 트래픽 특성에 따라 우선순위에 차등을 주어 효과적인 버퍼관리를 할 수 있는 방안을 제시하고 마른 동작을 위하여 기존의 복잡한 연산을 간략화 함으로써 스케줄러의 성능을 높인다. 또한, 기존의 버퍼관리 및 스케줄러와 시뮬레이션을 통하여 성능을 평가하고, 제안하는 버퍼관리기법과 스케줄링을 적용하고 구현하기 위하여, 다양한 실시간 서비스와 비실시간 서비스를 수용하고 있는 임베디드 RG(Residential Gateway)에 제안하는 우선순위 버퍼관리와 스케줄러를 구현한다.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.43 no.1
• /
• pp.1-6
• /
• 2020

Fast service access involves keeping track of the location of mobile users, while they are moving around the mobile network for a satisfactory level of QoS (Quality of Service) in a cost-effective manner. The location databases are used to keep track of Mobile Terminals (MT) so that incoming calls can be directed to requested mobile terminals at all times. MT reporting cell system used in location management is to designate each cell in the network as a reporting cell or a non-reporting cell. Determination of an optimal number of reporting cells (or reporting cell configuration) for a given network is reporting cell planning (RCP) problem. This is a difficult combinatorial optimization problem which has an exponential complexity. We can see that a cell in a network is either a reporting cell or a non-reporting cell. Hence, for a given network with N cells, the number of possible solutions is 2^N. We propose a biogeography based optimization (BBO) for design of mobile station location management system in wireless communication network. The number and locations of reporting cells should be determined to balance the registration for location update and paging operations for search the mobile stations to minimize the cost of system. Experimental results show that our proposed BBO is a fairly effective and competitive approach with respect to solution quality for optimally designing location management system because BBO is suitable for combinatorial optimization and multi-functional problems.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.8
• /
• pp.2774-2796
• /
• 2015

Quality-of-service (QoS) provisioning for a cognitive mesh network (CMN) with heterogeneous services has become a challenging area of research in recent days. Considering both real-time (RT) and non-real-time (NRT) traffic in a multihop CMN, [1] studied cross-layer resource management, including joint access control, route selection, and resource allocation. Due to the complexity of the formulated resource allocation problems, which are mixed-integer non-linear programming, a low-complexity yet efficient algorithm was proposed there to approximately solve the formulated optimization problems. In contrast, in this work, we present an application of genetic algorithm (GA) to re-address the hard resource allocation problems studied in [1]. Novel initialization, selection, crossover, and mutation operations are designed such that solutions with enough randomness can be generated and converge with as less number of attempts as possible, thus improving the efficiency of the algorithm effectively. Simulation results show the effectiveness of the newly proposed GA-based algorithm. Furthermore, by comparing the performance of the newly proposed algorithm with the one proposed in [1], more insights have been obtained in terms of the tradeoff among QoS provisioning for RT traffic, throughput maximization for NRT traffic, and time complexity of an algorithm for resource allocation in a multihop network such as CMN.