• Title/Summary/Keyword: Network Based Solution

Search Result 1,189, Processing Time 0.038 seconds

Mobility-adaptive QoE Provisioning Solution in Heterogeneous Wireless Access Networks

  • Kim, Moon;Cho, Sung-Joon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.8B
    • /
    • pp.1159-1169
    • /
    • 2010
  • This paper introduces the mobility-adaptive QoE provisioning solution. The key is placed on the intelligent selection of access network depending on the QoE criteria classified by the user mobility and the bandwidth demand for service. We further focus on the network-based smart handover scheme using the mobility-adaptive handover decision and the enhanced MIH-FMIP framework. The concept is the network-based calm service and the balance in order to facilitate vertical and seamless handover. In result, it is figured out that our solution improves QoE performance by selecting appropriate access network, repressing handover occurrence, and reducing handover delay as well.

Loss Minimization for Distribution Network using Partial Tree Search (부분 tree 탐색을 이용한 배전계통의 손실 최소화)

  • Choi, S.Y.;Shin, M.C.;Nam, G.Y.;Cho, P.H.;Park, J.S.
    • Proceedings of the KIEE Conference
    • /
    • 2000.07a
    • /
    • pp.519-521
    • /
    • 2000
  • Network reconfiguration is an operation task, and consists in the determination of the switching operations such to reach the minimum loss conditions of the distribution network. In this paper, an effective heuristic based switch scheme for loss minimization is given for the optimization of distribution loss reduction and a solution approach is presented. The solution algorithm for loss minimization has been developed based on the two stage solution methodology. The first stage of this solution algorithm sets up a decision tree which represent the various switching operations available, the second stage applies a proposed technique called cyclic best first search. Therefore, the solution algorithm of proposed method can determine on-off switch statuses for loss reduction, with a minimum computational effort.

  • PDF

The Development of Collection Solution of the Three-Phase Power Data based on the Personal Computer for Supporting the Smart Grid (스마트 그리드 지원을 위한 컴퓨터 기반 3상 전력 데이터 수집 솔루션 개발)

  • Ko, Yun-Seok
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.6 no.4
    • /
    • pp.553-558
    • /
    • 2011
  • The smart grid is an intelligent electric power network in which a digital communication network is integrated into the existing electric power system. This enhances the efficiency of the electric use by supplying and controlling the electric power through the two-way communication between the utility and the electric customer. In this paper, to support the smart grid, a computer-based solution which collects the three-phase electric power data based on the LPT Communication is designed, and then its prototype is made.

Designing Cellular Mobile Network Using Lagrangian Based Heuristic (라그랑지안 기반의 휴리스틱 기법을 이용한 셀룰러 모바일 네트워크의 설계)

  • Hong, Jung-Man;Lee, Jong-Hyup
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.37 no.1
    • /
    • pp.19-29
    • /
    • 2011
  • Cellular network is comprised of several base stations which serve cellular shaped service area and each base station (BS) is connected to the mobile switching center (MSC). In this paper, the configuration modeling and algorithm of a cellular mobile network with the aim of minimizing the overall cost of operation (handover) and network installation cost (cabling cost and installing cost of mobile switching center) are considered. Handover and cabling cost is one of the key considerations in designing cellular telecommunication networks. For real-world applications, this configuration study covers in an integrated framework for two major decisions: locating MSC and assigning BS to MSC. The problem is expressed in an integer programming model and a heuristic algorithm based on Lagrangian relaxation is proposed to resolve the problem. Searching for the optimum solution through exact algorithm to this problem appears to be unrealistic considering the large scale nature and NP-Completeness of the problem. The suggested algorithm computes both the bound for the objective value of the problem and the feasible solution for the problem. A Lagrangian heuristics is developed to find the feasible solution. Numerical tests are performed for the effectiveness and efficiency of the proposed heuristic algorithm. Computational experiments show that the performance of the proposed heuristics is satisfactory in the quality of the generated solution.

An Effective Solution for the Multimedia Telephony Services in Evolving Networks

  • Kim, Jong-Deug;Jeon, Taehyun
    • International journal of advanced smart convergence
    • /
    • v.2 no.1
    • /
    • pp.24-26
    • /
    • 2013
  • In the process of a mobile network evolution to the All-IP, it is inevitable to experience a transient period embracing both circuit and packet based data traffics. At the stage of those hybrid networks, it is important to build them in an efficient manner in terms of resource utilization which is closely related to the overall system operation cost. Especially, the multimedia telephony is one of the essential services in the advanced packet based mobile networks. In this paper an effective method of system operation is proposed for building up the multimedia telephony service while the legacy network co-exists. The proposed solution is based on the careful investigation of the usage pattern of the multimedia services in the evolving networks. This method is also expected to be a useful guideline for the network resource planning.

Development of a heuristic algorithm for the effective design of military information networks (국방 전산망의 효율적인 설계를 위한 휴리스틱 알고리듬 개발)

  • U, Hun-Sik;Yoon, Dong-Won
    • Journal of National Security and Military Science
    • /
    • s.1
    • /
    • pp.345-360
    • /
    • 2003
  • To build an information oriented armed forces, the Korean military telecommunication networks adopt TCP/IP standard communication infrastructures based on ATM packet switched networks. Utilizing this network infrastructure, the Korean armed forces also applies to the areas of battleship management for efficient operation command controls and resource management for efficient resource allocations. In this military communication networks, it is essential to determine the least cost network topology under equal performance and reliability constraints. Basically, this type of communication network design problem is known in the literature as an NP Hard problem. As the number of network node increases, it is very hard to obtain an optimal solution in polynomial time. Therefore, it is reasonable to use a heuristic algorithm which provides a good solution with minimal computational efforts. In this study, we developed a simulated annealing based heuristic algorithm which can be utilized for the design of military communication networks. The developed algorithm provides a good packet switched network topology which satisfies a given set of performance and reliability constraints with reasonable computation times.

  • PDF

Phase Switching Mechanism for WiFi-based Long Distance Networks in Industrial Real-Time Applications

  • Wang, Jintao;Jin, Xi;Zeng, Peng;Wang, Zhaowei;Wan, Ming
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.1
    • /
    • pp.78-101
    • /
    • 2017
  • High-quality industrial control is critical to ensuring production quality, reducing production costs, improving management levels and stabilizing equipment and long-term operations. WiFi-based Long Distance (WiLD) networks have been used as remote industrial control networks. Real-time performance is essential to industrial control. However, the original mechanism of WiLD networks does not minimize end-to-end delay and restricts improvement of real-time performance. In this paper, we propose two algorithms to obtain the transmitting/receiving phase cycle length for each node such that real time constraints can be satisfied and phase switching overhead can be minimized. The first algorithm is based on the branch and bound method, which identifies an optimal solution. The second is a fast heuristic algorithm. The experimental results show that the execution time of the algorithm based on branch and bound is less than that of the heuristic algorithm when the network is complex and that the performance of the heuristic algorithm is close to the optimal solution.

Cellular Network Bandwidth Management Scheme based on Nash Bargaining Solution (멀티미디어 셀룰러 네트워크상에서 내쉬 협상해법을 이용한 대역폭 관리기법)

  • Choi, Yoon-Ho;Kim, Sung-Wook
    • Journal of KIISE:Information Networking
    • /
    • v.37 no.6
    • /
    • pp.415-419
    • /
    • 2010
  • Bandwidth is an extremely valuable and scarce resource in a wireless network. Therefore, efficient bandwidth management is necessary in order to provide high quality service to users with different requirements. In this paper, we propose a bandwidth reservation algorithm based on Nash Bargaining Solution. The proposed algorithm has low complexity and are quite flexible in the different situations of network. Simulation results indicate that the proposed scheme has excellent performance than other existing schemes.

Supply Chain Network Design - a Model and its Applications (공급사슬망 설계를 위한 수리모형 수립 및 응용)

  • Kim Jeonghyuk;Kim Daeki
    • Korean Management Science Review
    • /
    • v.21 no.2
    • /
    • pp.15-25
    • /
    • 2004
  • Great effort has been exerted to redesign the supply chain network as a means to improve corporate competitiveness. In this study, we present a mathematical model and a solution system to help redesign corporate logistics networks. The objective of the model is to minimize total logistics costs. We applied the solution system to real problem cases. We use the model and the concept to develop decision support system that is based on C++ with the use of CPLEX callable library as a solution engine. We tested and verified the DSS for redesigning the network of a large Korean electronics company. Through various scenario analyses. we recommend to redesign their supply chain network that demonstrates the possibility of substantial logistics cost savings.

Study of Supply-Production-Distribution Routing in Supply Chain Network Using Matrix-based Genetic Algorithm (공급사슬네트워크에서 Matrix-based 유전알고리즘을 이용한 공급-생산-분배경로에 대한 연구)

  • Lim, Seok-Jin;Moon, Myung-Kug
    • Journal of the Korea Safety Management & Science
    • /
    • v.22 no.4
    • /
    • pp.45-52
    • /
    • 2020
  • Recently, a multi facility, multi product and multi period industrial problem has been widely investigated in Supply Chain Network(SCN). One of keys issues in the current SCN research area involves minimizing both production and distribution costs. This study deals with finding an optimal solution for minimizing the total cost of production and distribution problems in supply chain network. First, we presented an integrated mathematical model that satisfies the minimum cost in the supply chain. To solve the presented mathematical model, we used a genetic algorithm with an excellent searching ability for complicated solution space. To represent the given model effectively, the matrix based real-number coding schema is used. The difference rate of the objective function value for the termination condition is applied. Computational experimental results show that the real size problems we encountered can be solved within a reasonable time.