• Journal of KIISE:Computing Practices and Letters
• /
• v.10 no.1
• /
• pp.49-56
• /
• 2004

Load imbalance is a serious impediment to achieving good performance in parallel processing. Global load balancing schemes cannot adequately manage to balance parallel tasks generated from a single application. Dynamic loop scheduling methods are known to be useful in balancing parallel loops on shared-memory multiprocessor machines. However, their centralized nature causes a bottleneck for the relatively small number of processors in a network of workstations because of order-of-magniture differences in communication overheads. Moreover, improvements of basis loops scheduling methods have not effectively dealt with irregularly distributed workloads in parallel loops, which commonly occur in applications for a network of workstation. In this paper, we present a new reconfigurable and decentralized balancing method for parallel loops on a network of workstations. Since our method supplements performance balancing with those tranditional load balancing methods, it minimizes the overall execution time.

• The KIPS Transactions:PartD
• /
• v.11D no.5
• /
• pp.1149-1158
• /
• 2004

Today the fastest growing communities of web users are mobile visitors who browse web page with wireless PDAs and cellular phones. However, most web pages are optimiaed exclusively for desktop clients on the broadband network and are inconvenient to users with small screen mobile devices. They display only a few lines of text and cannot run client-side programs or scripts due to lack of system resource. Even worse, their connections are usually slow to support most of the data-intensive applications. In this paper, we propose a pageslet scheme that makes it feasible to browse ordinary web pages on small screen mobile devices. It extracts broadcasting sections of user preference from broadcasting web pages and automatically reorganizes the extracted sections for convenient browsing on mobile devices.

• The KIPS Transactions:PartD
• /
• v.8D no.4
• /
• pp.377-386
• /
• 2001

In spatial database system, spatial view is supported for efficient access method to spatial database and is managed by materialization and non-materialization technique. In non-materialization technique, repeated execution on the same query makes problems such as the bottle-neck effect of server-side and overloads on a network. In materialization technique, view maintenance technique is very difficult and maintenance cost is too high when the base table has been changed. In this paper, the SVMT (Spatial View Materialization Technique) is proposed by using R-tree re-construction. The SVMT is a technique which constructs a spatial index according to the distribution ratio of objects in spatial view. This ratio is computed by using a SVHR (Spatial View Height in R-tree) and SVOC (Spatial View Object Count). If the ratio is higher than the average, a spatial view is materialized and the R-tree index is re-used. In this case, the root node of this index is exchanged a node which has a MBR (Minimum Boundary Rectangle) value that can contains the whole region of spatial view at a minimum size. Otherwise, a spatial view is materialized and the R-tree is re-constructed. In this technique, the information of spatial view is managed by using a SVIT (Spatial View Information Table) and is stored on the record of this table. The proposed technique increases the speed of response time through fast query processing on a materialized view and eliminates additional costs occurred from repeatable query modification on the same query. With these advantages, it can greatly minimize the network overloads and the bottle-neck effect on the server.

• Journal of KIISE:Information Networking
• /
• v.28 no.4
• /
• pp.586-601
• /
• 2001

We propose a mesh based multicast routing protocol referred to as HMMRP for ad-hoc networks. In HMMRP, a limited number of sources are selected as core sources, and the rest of the sources of a multicast group are connected to one of those core sources. The sources and the receivers of a multicast group are also connected through per source trees. In HMMRP, the data delivery mesh of a multicast group are composed of the nodes on these paths, and are reconfigured at regular intervals. Furthermore, each mesh member that lies on the paths between the sources and the core sources as well as be-tween the core sources and the receivers keeps checking if there is a symptom of mesh separation around itself. When a mesh member finds such symptom, it tries to patch itself to the mesh with a local flooding. As a result, the part of the data delivery mesh on those paths are kept connected with a lot higher probability than the rest of the data delivery mesh. That is, for a certain source receiver pair, it is very likely that at least there exists a data delivery path that route from the source to a core source and then to the receiver. Therefore, HMMRP may provide very high data delivery ratio without frequent entire data delivery mesh reconfiguration even when the nodal mobility is high. Simulation results show that HMMRP shows relatively little performance degradation with respect to mobility. Furthermore, the performance degradation with respect to mobility is even smaller when the size of the multicast group becomes larger.

• KIPS Transactions on Computer and Communication Systems
• /
• v.9 no.11
• /
• pp.256-264
• /
• 2020

Industrial Wireless Sensor Networks (IWSNs) is exploited to achieve various objectives such as improving productivity and reducing cost in the diversity of industrial application, and it has requirements such as low-delay and high reliability packet transmission. To accomplish the requirement, the network manager performs graph construction and resource allocation about network topology, and determines the transmission cycle and path of each node in advance. However, this network management scheme cannot treat mobile devices that cause continuous topology changes because graph reconstruction and resource reallocation should be performed as network topology changes. That is, despite the growing need of mobile devices in many industries, existing scheme cannot adequately respond to path failure caused by movement of mobile device and packet loss in the process of path recovery. To solve this problem, a network management scheme is required to prevent packet loss caused by mobile devices. Thus, we analyse the location and movement cycle of mobile devices over time using machine learning for predicting the mobility pattern. In the proposed scheme, the network manager could prevent the problems caused by mobile devices through performing graph construction and resource allocation for the predicted network topology based on the movement pattern. Performance evaluation results show a prediction rate of about 86% compared with actual movement pattern, and a higher packet delivery ratio and a lower resource share compared to existing scheme.

• Journal of Science and Technology Studies
• /
• v.9 no.2
• /
• pp.51-78
• /
• 2009

Usually, Technological failures have been recognized as a mundane and inevitable process of trial and error for finally achieving success, or pathological technologies clearly different from success. These approaches easily ignore that a failed technology also constructed complex technological networks with various actors for some times. Consequently, failed technologies failed not only technological realization, but also got a proper evaluation. This paper explore the emergence and decline of the city phone project (CT-2 technology), the very typical failure cases in the telecommunications industry at Korea. This story shows that the city phone project with low-price and low-technology could constructed a stable network at agreement the result from interaction between various actors, and then, changed because various actors gave technologies different meaning and desire. Finally, it suggests that collapse of its technological network was attributed to uncertain future and contingent, rather than technological limits.

• Journal of Advanced Navigation Technology
• /
• v.18 no.6
• /
• pp.594-599
• /
• 2014

The routinized wireless devices such as smart phone have promoted to expand the use of IEEE 802.11 groups. The challenge environments of the wireless network utilizes effectively and user-oriented seamless services that handover is the most desirable issues under the wireless circumstance. In data center software defined network (SDN) has provided the flow routing to reduce costs and complexities. Flow routing has directly offered control for network administrator and has given to reduce delay for users. Under the circumstance of being short of network facilities, SDNs give the virtualization of network environments and to support out of the isolation traffic conditions. It shows that the mechanism of handover makes sure seamless services for higher density of the network infrastructure which is SDN to support network service re-configurable.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.6
• /
• pp.85-94
• /
• 2015

In this paper, an enhanced QoS multicast routing scheduling scheme is proposed to adapt to a dynamic mobile traffic condition for wireless mesh networks (WMNs). It handles the network QoS by controlling the delay constraints for multimedia applications. The group size will be controlled according to both the current network state and QoS requirements. The dynamic reconstruction of QoS multicast tree can be obtained from preprocessing with both the partial multicast routing scheme and the traffic estimation. Performance evaluation of the proposed scheme is carried out on randomly generated graph derived from the wireless mesh network, by choosing the optimal value related to the appropriate delay bounds. Simulation results show that the proposed scheme can improve the performance of QoS multicast routing for WMNs.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2006.05a
• /
• pp.159-162
• /
• 2006

In ubiquitous computing environments, which can be connected to the networks any time any where, wearable computers frequently will be changed their network connection point. Therefore, the demand of the mobility support service becomes more important. The mobility support mechanism allows a wearable computer to continue the existing services without the modification for the network configuration of wearable computer even if wearable computer changes the network connection point during its moving. In this paper, we design the component based middlewear for the mobility supports of wearable computers, propose the method of the mobility support service. This method tunnels the existing data to wearable computer using Mobile IP protocol even if a wearable computer moves to other network after recomposing dynamically the mobility support component in wearable middlewear.

• 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.