• Journal of KIISE:Information Networking
• /
• v.34 no.2
• /
• pp.120-133
• /
• 2007

A multicast tree includes several, possibly a large number of, paths connecting source-receiver pairs, and network failure may disable part of the multicast tree. Reconstruction of the entire multicast tree to recover from a component failure is highly undesirable, because some group members have to suffer service disruptions even though the communication paths to/from them are not affected by the failure. To limit reconfiguration region and to maximize the likelihood of successful reconfiguration, we propose and evaluate a pre-planned reconfiguration policy for QoS multicast sessions. Specifically, we equip a reconfiguration path (RP) with each end-to-end path that connects a source-receiver pair in the multicast tree, and reserve resources in advance along the RPs. Efficient resource-sharing techniques are applied to reduce the amount of resources reserved for RPs but not used in the absence of failures. This way, we prevent uncontrolled competition among different multicast sessions which may simultaneously try to recover from failures. We evaluate the performance of the proposed scheme using simulation on randomly-generated networks. We use the shortest-path routing for QoS multicast sessions, and simulate both source-based and shared multicast trees. The evaluation results indicates that successful pre-planned reconfiguration can be achieved for all group members with reasonable overhead. Our scheme is also shown to adapt well to dynamic changes of group membership.

• ETRI Journal
• /
• v.36 no.2
• /
• pp.214-223
• /
• 2014

A fully-integrated penta-band reconfigurable power amplifier (PA) is developed for handset Tx applications. The output structure of the proposed PA is composed of the fixed output matching network, power and frequency reconfigurable networks, and post-PA distribution switches. In this work, a new reconfiguration technique is proposed for a specific band requiring power and frequency reconfiguration simultaneously. The design parameters for the proposed reconfiguration are newly derived and applied to the PA. To reduce the module size, the switches of reconfigurable output networks and post-PA switches are integrated into a single IC using a $0.18{\mu}m$ silicon-on-insulator CMOS process, and a compact size of $5mm{\times}5mm$ is thus achieved. The fabricated W-CDMA PA module shows adjacent channel leakage ratios better than -39 dBc up to the rated linear power and power-added efficiencies of higher than around 38% at the maximum linear output power over all the bands. Efficiency degradation is limited to 2.5% to 3% compared to the single-band reference PA.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.11A
• /
• pp.1064-1072
• /
• 2005

For the efficient operation of sensor networks, it is very important to design sensor networks for sensors to utilize their energies in very effective ways. Cluster-based routing schemes such as LEACH can achieve their energy efficiencies by delivering data between cluster heads and sensor nodes. In those cluster-based schemes, cluster reconfiguration algorithm is one of the most critical issues to achieve longer operation lifetime of sensor networks. In this paper, we propose a new energy efficient cluster reconfiguration algorithm. Proposed method does not require any location or energy information of sensors, and can configure clusters with fair cluster regions such that all the sensors in a sensor network can utilize their energies equally. The performances of the proposed scheme have been compared with LEACH and LEACH-C.

• Journal of Internet Computing and Services
• /
• v.7 no.6
• /
• pp.87-103
• /
• 2006

Advances in computer and network technology provide new computing environment that were only possible with supercomputers before. In order to provide the environment, a distributed runtime system has to be provided, but most of the conventional distributed runtime systems lack in providing dynamic and flexible system reconfiguration depending on workload variance, due to a static architecture of fixed master node and slave working nodes. This paper proposes and implements a new model for distributed job allocation and management which is a distributed runtime system is P2P environment for flexible and dynamic system reconfiguration. The implemented systems enables job program transfer and management, remote compile and execution among cooperative developers based on P2P standard protocol Jxta platform. Since it makes dynamic and flexible system reconfiguration possible, the proposed method has some advantages in that it can collect and utilize idle computing resources immediately at a needed time for distributed job processing. Moreover, the implemented system's effectiveness and performance increase are shown by applying and processing the crawler jobs, in a distributed way, for collecting a large amount of data needed for internet search.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.24 no.12
• /
• pp.1688-1696
• /
• 2020

The paradigm of Internet-of-things(IoT) systems is changing from a cloud-based system to an edge-based system to solve delays caused by network congestion, server overload and security issues due to data transmission. However, edge-based IoT systems have fatal weaknesses such as lack of performance and flexibility due to various limitations. To improve performance, application-specific hardware can be implemented in the edge device, but performance cannot be improved except for specific applications due to a fixed function. This paper introduces a edge-centric metamorphic IoT(mIoT) platform that can use a variety of hardware through on-demand partial reconfiguration despite the limited hardware resources of the edge device, so we can increase the performance and flexibility of the edge device. According to the experimental results, the edge-centric mIoT platform that executes the reconfiguration algorithm at the edge was able to reduce the number of server accesses by up to 82.2% compared to previous studies in which the reconfiguration algorithm was executed on the server.

• Journal of Internet Computing and Services
• /
• v.9 no.4
• /
• pp.29-41
• /
• 2008

Currently, IETF MANEMO(Mobile Adhoc for NEMO) working group is working on standardization supporting internal routing in nested NEMO networks. Nested NEMO has a independent topology feature that Mobile IP and basic NEMO protocol did not caused. This is the reason that causes exceptional mobility pattern. Such mobility patterns also trigger each other reconfiguration requirements. This paper classified and analyzed probable new mobility patterns in nested NEMO network. In concludion, we derived configuration problem from the new mobility patterns and suggested differential reconfiguration requirements through analytical approach.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.05a
• /
• pp.841-844
• /
• 2009

Recently our society is changing from an information era to an ubiquitous era. The centralization of an ubiquitous city has been developing among the countries and cities competitively. At this point, a reconfiguration of proper network environment is very important factor for a city competitive power. The centralization of an ubiquitous city is progressing with two kinds of category divided into existing cities and new cities. For example, Unlike new cities, the existing cities should consider the physical space restriction of communication network configuration because they can not design an underground cord lining. This paper describes the comparison and analysis of ubiquitous proceeding cases between the existing cities and new cities. And also, we investigated infrastructure features of proceeding ubiquitous city which is regarded as a reviving concept for the existing cities. In addition, a political proposal of wireless network configuration is suggested to solve these problems for the ubiquitous city.

• Journal of Navigation and Port Research
• /
• v.36 no.4
• /
• pp.305-311
• /
• 2012

The market competition of express package deliveries in Korea is severe because a large number of companies have entered into the market. This study thus suggests an approach to the reconfiguration of express service networks with respect to the strategy partnership of closing/keeping service centers among companies involved and the adjustments of their cutoff times. For this we propose an integer programming model and a genetic algorithm based solution procedure for allowing companies involved to maximize their incremental profit. An illustrative numerical example is presented to demonstrate the practicality and efficiency of the proposed model.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.29 no.7
• /
• pp.14-21
• /
• 2015

Distribution systems are operated in radial structure, but temporal loop structure could be founded the live load transfer. Main purposes of reconfiguration of distribution network are load balancing, loss minimization and voltage drop maintaining. In the loop structure, huge loop current can be flowed between two substations in case of large voltage angle difference. Protection devices of distribution line can be triped by this huge loop current. So, precise calculation of loop current is very important for secure switching. This paper proposes a novel calculation method of loop current using the voltage angle differences measured at the tie switches. Feasibility of the propose method has been verified by various case studies based on Matlab simulation.

• Proceedings of the KIEE Conference
• /
• 2002.07a
• /
• pp.121-123
• /
• 2002

In this paper, we preposed a chaos optimization method to reduce computational effort and enhance optimality of the solution in feeder reconfiguration problem. Chaos method in optimization problem searches the global optimal solution on the regularity of chaotic motions and more easily escapes from local or near optimal solution than stochastic optimization algorithms. The chaos optimization method is tested on 15 buses and 32 buses distribution systems, and the test results indicate that it is able to determine appropriate switching options for global optimum configuration with less computation.