• Title/Summary/Keyword: optimization scheme

Search Result 1,157, Processing Time 0.03 seconds

MAP Load Control and Route Optimization in HMIPv6 (HMIPv6에서의 MAP의 부하 제어 및 경로 최적화)

  • Nam, Sung-Hyun;Lee, Kyung-Geun
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.45 no.12
    • /
    • pp.120-127
    • /
    • 2008
  • HMIPv6 draws lots of attentions in recent years for providing an efficient handover and reducing the signaling overhead. HMIPv6 employs MAP(Mobility Anchor Point) in order to minimize a signaling overhead and a local mobility management. MAP completes an efficient mobility management in HMIPv6 network environment with frequent handover. However, HMIPv6 causes load concentration at a paricular MAP and may have unnecessary latency between HN(Mobile Node) and CN(Correspondent Node) within the same network. A MAP may also disturb the route optimization in HMIPv6 network because all packets must be transmitted through a MAP. In this paper, we propose a scheme to optimize the route in HMIPv6 networks according to MAP load. We configure a threshold in order to support the better service into MAP domain. The packets do not pass through MAP and are directly transmitted to AR(Access Router) if the number of current MNs attached to the MAP exceed the desired threshold. We simulate the performance of the proposed scheme and compare with HMIPv6. Resultly, the proposed scheme reduces signaling costs and mitigates concentration of a paticular MAP as well.

An Efficient Data Replacement Algorithm for Performance Optimization of MapReduce in Non-dedicated Distributed Computing Environments (비-전용 분산 컴퓨팅 환경에서 맵-리듀스 처리 성능 최적화를 위한 효율적인 데이터 재배치 알고리즘)

  • Ryu, Eunkyung;Son, Ingook;Park, Junho;Bok, Kyoungsoo;Yoo, Jaesoo
    • The Journal of the Korea Contents Association
    • /
    • v.13 no.9
    • /
    • pp.20-27
    • /
    • 2013
  • In recently years, with the growth of social media and the development of mobile devices, the data have been significantly increased. MapReduce is an emerging programming model that processes large amount of data. However, since MapReduce evenly places the data in the dedicated distributed computing environment, it is not suitable to the non-dedicated distributed computing environment. The data replacement algorithms were proposed for performance optimization of MapReduce in the non-dedicated distributed computing environments. However, they spend much time for date replacement and cause the network load for unnecessary data transmission. In this paper, we propose an efficient data replacement algorithm for the performance optimization of MapReduce in the non-dedicated distributed computing environments. The proposed scheme computes the ratio of data blocks in the nodes based on the node availability model and reduces the network load by transmitting the data blocks considering the data placement. Our experimental results show that the proposed scheme outperforms the existing scheme.

An Effective mesh smoothing technique for the mesh constructed by the mesh compression technique (격자압축을 이용해 구성된 격자의 효과적인 격자유연화 방법)

  • 홍진태;이석렬;양동열
    • Proceedings of the Korean Society for Technology of Plasticity Conference
    • /
    • 2003.05a
    • /
    • pp.331-334
    • /
    • 2003
  • In the finite element simulation of hot forging processes using hexahedron, remeshing of a flash is very difficult. The mesh compression method is a remeshing technique to construct an effective hexahedral mesh. However, because mesh is distorted during the compression procedure or the mesh compression method, mesh smoothing is necessary to improve the mesh Qualify. in this study, several geometric mesh smoothing techniques and a matrix norm optimization technique are applied and compared which is more adaptive to the mesh compression method.

  • PDF

New learning algorithm to solve the inverse optimization problems

  • Aoyama, Tomoo
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2002.10a
    • /
    • pp.42.2-42
    • /
    • 2002
  • We discuss a neural network solver for the inverse optimization problem. The problem is that find functional relations between input and output data, which are include defects. Finding the relations, predictions of the defect parts are also required. The part of finding the defects in the input data is an inverse problem . We consider the meanings to solve the problem on the neural network system at first. Next, we consider the network structure of the system, the learning scheme of the network, and at last, examine the precision on the numerical calculations. In the paper, we proposed the high-precision learning method for plural three-layer neural network system that is series-connect...

  • PDF

A Development on the Optimization Algorithm for MDCT/IMDCT of MPEG-2 AAC (MPEG-2 AAC의 MDCT/IMDCT를 위한 최적 알고리즘 개발)

  • 김병규;이강현
    • Proceedings of the IEEK Conference
    • /
    • 1999.06a
    • /
    • pp.538-541
    • /
    • 1999
  • MPEG-2 AAC(Advanced Audio Coding) is the most advanced coding scheme available for high quality audio coding. This MPEG-2 AAC audio Standard allows for ITU-R ‘indistinguishable’ quality according to at data rates of 320 kb/s for five full-bandwidth channel audio signals. The compression ratio is around a factor of 1.4 better compared to MPEG Layer 3, you get the same quality at 70% of the bitrate. This paper suggest optimization method for MDCT/IMDCT (Modified Discrete Cosine Transform/Inverse Modified Discrete Cosine Transform) in Encoder and Decoder for AAC.

  • PDF

A SYNCRO-PARALLEL NONSMOOTH PGD ALGORITHM FOR NONSMOOTH OPTIMIZATION

  • Feng, Shan;Pang, Li-Ping
    • Journal of applied mathematics & informatics
    • /
    • v.24 no.1_2
    • /
    • pp.333-342
    • /
    • 2007
  • A nonsmooth PGD scheme for minimizing a nonsmooth convex function is presented. In the parallelization step of the algorithm, a method due to Pang, Han and Pangaraj (1991), [7], is employed to solve a subproblem for constructing search directions. The convergence analysis is given as well.

An Enhanced Mobile IP Handoff Mechanism using Routing Optimization and Binding Extension (경로설정 최적화와 바인딩 확장을 이용한 개선된 Mobile IP 핸드오프 기법)

  • 오현우
    • Proceedings of the Korea Society for Simulation Conference
    • /
    • 1999.10a
    • /
    • pp.127-132
    • /
    • 1999
  • A mobile IP is proposed to support host mobility over the current Internet. One of the most important issues on the host mobility is location and routing schemes that allow mobile hosts to move effectively from one site to another. In a Mobile IP environment, frequent handoffs are likely to degrade the performance by minimizing the loss of datagrams during handoffs. The handoff scheme is using routing optimization and binding extension to improve the performance by minimizing the average transfer delay of messages and packet loss. Simulation details show the improvement of transport delays and packet loss rate.

  • PDF

Functions of Chaos Neuron Models with a Feedback Slaving Principle

  • Inoue, Masayoshi
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1993.06a
    • /
    • pp.1009-1012
    • /
    • 1993
  • An association memory, solving an optimization problem, a Boltzmann machine scheme learning and a back propagation learning in our chaos neuron models are reviewed and some new results are presented. In each model its microscopicrule (a parameter of a chaos system in a neuron) is subject to its macroscopic state. This feedback and chaos dynamics are essential mechanisms of our model and their roles are briefly discussed.

  • PDF

A Study on The Restoration of Substation using Genetic Algorithm (유전 알고리즘을 이용한 변전소 복구 방안에 관한 연구)

  • Park, Young-Moon;Won, Jong-Ryul
    • Proceedings of the KIEE Conference
    • /
    • 1996.07b
    • /
    • pp.820-822
    • /
    • 1996
  • This paper proposes a method for seeking the scheme of substation restoration by using genetic algorithm. Genetic algorithm (GA), first introduced by John Holland, is becoming an important tool in machine learning and function optimization. GA is a searching or optimization algorithm based on Darwinian biological evolution principle. As a test system, we assume a simple substation system and for the transformer fault, the result is obtained.

  • PDF

Whale Optimization Algorithm and Blockchain Technology for Intelligent Networks

  • Sulthana, Shazia;Reddy, BN Manjunatha
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.7
    • /
    • pp.157-164
    • /
    • 2022
  • The proposed privacy preserving scheme has identified the drawbacks of existing schemes in Vehicular Networks. This prototype enhances the number of nodes by decreasing the cluster size. This algorithm is integrated with the whale optimization algorithm and Block Chain Technology. A set of results are done through the NS-2 simulator in the direction to check the effectiveness of proposed algorithm. The proposed method shows better results than with the existing techniques in terms of Delay, Drop, Delivery ratio, Overhead, throughout under the denial of attack.