• Journal of KIISE:Information Networking
• /
• v.30 no.4
• /
• pp.545-558
• /
• 2003

It is expected that per-user customized services are widely used in next generation Personal Communication Network. The ultimate goal for personalized service is the Virtual home Environment (VHE) providing ´same-look-and-feel´ services for the subscriber wherever he roams to. To provide personalized services for each call, per-user service profiles are frequently referenced, so efficient service profile management is essentially required. To realized the VHE, typically two schemes, can be employed; One is Intelligent Network based service control and the other is a full replication scheme that always replicates profile in user´s current zone. The first scheme is referred as Central scheme and th second scheme is the modified replication scheme of IMT-2000, we refer to as Follow-Me Replication Unconditional (FMRU). Since the Central scheme only depends on the service cal rate and the FMRU is merely dependent on the movement rate, it is apparent that FMRU scheme outperforms the Central scheme if the call to mobility ratio (CMR) is large, and vice versa. In this paper, we propose a new service profile replication schemes, Adaptive Follow-Me Replication (AFMR) that determine replication automatically according to the user´s CMR. We compared the performance of the AFMR with the non-adaptive Follow-Me Replication unconditional on Demand (FMRUD) scheme. Performance results indicate that as the CMR of a user changes AFMR adapts well compared to the existing schemes.

• The KIPS Transactions:PartA
• /
• v.13A no.3 s.100
• /
• pp.241-252
• /
• 2006

In cluster file systems, the availability of files has been supported by replicating entire files or generating parities on parity servers. However, those methods require very large temporal and spatial cost, and cannot handle massive failures situation on the file system. So we propose HA-PVFS, a cluster file system supporting high data availability adaptive to temporal locality. HA-PVFS restricts replication or parity generation to some important files, for that it employs an efficient algorithm to estimate file access patterns from limited information. Moreover, in order to minimize the performance degradation of the file system, it uses delayed update method and relay replication.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.4 s.36
• /
• pp.93-102
• /
• 2005

Excessive traffic of P2P applications in the limited communication environment is considered as a network bandwidth problem. Moreover, Though P2P systems search a resource in the phase of search using weakly connected systems(peers' connection to P2P overlay network is very weakly connected), it is not guaranteed to download the very peer's resource in the phase of download. In previous P2P search algorithm (1), we had adopted the heuristic peer selection method based on Random Walks to resolve this problems. In this paper, we suggested an adaptive P2P search algorithm based on the previous algorithm(1) to reform the node distribution rate which is affected in unit peer ability. Also, we have adapted the discriminative replication method based on a query ratio to reduce traffic amount additionally. In the performance estimation result of this suggested system, our system works on a appropriate point of compromise in due consideration of the direction of searching and distribution of traffic occurrence.

• Journal of the Korea Society of Computer and Information
• /
• v.8 no.1
• /
• pp.51-59
• /
• 2003

It is effective to be located in the double nodes in the distributed object replication systems, then object which nodes share is the same contents. The nodes store an access information on their local cache as it access to the system. and then the nodes fetch and use it, when it needed. But with time the coherence Problems will happen because a data carl be updated by other nodes. So keeping the coherence of the system we need a mechanism that we managed the to improve to improve the performance and availability of the system effectively. In this paper to keep coherence in the shared memory condition, we can set the limited parallel performance without the additional cost except the coherence cost using it to keep the object at the proposed adaptive duplication object(ADO) algorithms. Also to minimize the coherence maintenance cost which is the bi99est overhead in the duplication method, we must manage the object effectively for the number of replication and location of the object replica which is the most important points, and then it determines the cos. And that we must study the adaptive duplication object management mechanism which will improve the entire run time.

• The KIPS Transactions:PartC
• /
• v.9C no.6
• /
• pp.911-918
• /
• 2002

An important issue in the design of future Personal Communication Service (PCS) networks is the efficient management of location information. In this paper, we propose an adaptive distributed dynamic location management algorithm that stores the position of the mobile terminal in k of the n location information databases (LIDs). The proposed algorithm chooses adaptively k. replication factor according to both the space locality of LIDs in wireless mobile networks and the location query popularity to local mobile terminal from remote mobile terminals. The performance of proposed algorithm is evaluated by both an analytical model and a simulation. Based on the results of performance evaluation, we know that the performance of the proposed algorithm is better than that of Krishnamurthi's algorithm regardless of call-mobility ratio.

• MALSORI
• /
• no.57
• /
• pp.175-189
• /
• 2006

Because a packet loss brings about degradation of speech quality, VoIP speech coders have PLC (Packet Loss Concealment) mechanism. G.711, which is a mandatory VoIP speech coder, also has the PLC algorithm based on pitch period replication. However, it is not robust to burst losses. Thus, we propose two methods to improve the performance of the original PLC algorithm in G.711. One adaptively utilizes voiced/unvoiced information of adjacent good frames regarding to the current lost frame. The other is based on adaptive gain control according to energy variation across the frames. We evaluate the performance of the proposed PLC algorithm by measuring a PESQ value under different random and burst packet loss simulating conditions. It is shown from the experiments that the performance of the proposed PLC algorithm outperforms that of PLC employed in ITU-T Recommendation G.711.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.8 no.5
• /
• pp.187-195
• /
• 2008

In MANET, it is important to efficiently manage data objects and traffic to improve network throughput and response time. This paper proposes a connection-degree based data object search and replication scheme in mobile ad-hoc networks. In this method, information about the path data object providers is stored at the cache of a cluster header at which lots of queries arrive, so that, to reduce the load of the cluster header, replicas can be created at its neighboring nodes. The method proposes an algorithm that picks up a cluster header among mobile nodes and makes it possible to search for and utilize adaptive and up-to-date information in MANET. The method is expected to be effective since it enables access to data objects in spite of broken links among mobile nodes with an enhancement in network response time of searching and a decrease in communication costs. The efficiency of this system was verified via simulation.

• Journal of Electrical Engineering and Technology
• /
• v.8 no.3
• /
• pp.649-657
• /
• 2013

DTN flooding based routing protocol replicate the message copy to increase the delivery like hood that overloads the network resources. The probabilistic routing protocols reduce replication cost by forwarding the message to a node that holds high predictability value to meet its destination. However, the network traffic converges to high probable nodes and produce congestion that triggers the drop of previously stored messages. In this paper, we have proposed a routing protocol called as Connection frequency Buffer Aware Routing Protocol (CFBARP) that uses an adaptive method to maintain the information about the available buffer space at the receiver before message transmission. Furthermore, a frequency based method has been employed to determine the connection recurrence among nodes. The proposed strategy has performed well in terms of reducing message drop, message relay while increases the delivery probability.