• The Transactions of the Korea Information Processing Society
• /
• v.6 no.9
• /
• pp.2332-2342
• /
• 1999

Multicast is an important system-level one-to-many collective communication service. A key issue in designing software multicast algorithms is to consider the trade-off between performance and portability. Based on the LogP model, the proposed parameterized communication model can more accurately characterize the communication network of parallel platforms, Under the parameterized model, we propose an efficient architecture-independent method. OPT-tree algorithm, to construct optimal multicast trees and also investigate architecture-dependent tuning on performance of the multicast algorithm to achieve the truly optimal performance when implemented in real networks. Specifically, OPT-mesh which is the optimized version of the parameterized multicast algorithm for wormhole-switched mesh networks is developed and compared with two other well-known network-dependent algorithms.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.1
• /
• pp.305-321
• /
• 2012

Since Internet Protocol (IP) is the most important protocol in Next Generation Networks (NGNs), 3rd Generation Partnership Project (3GPP) utilizes Session Initial Protocol (SIP) based on IP as the base protocol for negotiating sessions in IP Multimedia Subsystem (IMS). Different from traditional circuit-switched network, in IMS, the media traffic and signaling are delivered through IP transport. The media traffic may affect the signaling efficiency in core network, due to traffic collisions and best effort packets delivery. This paper proposes a novel path-migration mechanism for enhancing the traffic efficiency in integrated NGN-IMS. The simulation results show that the interference and traffic collision can be reduce by applying proposed path-migration mechanism and the signaling efficiency in core network can be improved with higher system capability and voice quality.

• Proceedings of the KIEE Conference
• /
• 1990.11a
• /
• pp.272-277
• /
• 1990

A soft switched matrix converter is proposed by adopting the zero voltage switching technique being used in some resonant pole inverters. High operating frequency with safe and efficient switching improves dynamic and spectral performances and simplifies protection logics and snubber networks. Further, it can be implemented using simple analog circuits, having similar transfer characteristics to those of the modern pulse width modulated matrix converters such as, maximum voltage transfer ratio and unity input displacement factor. Analyses, design and simulation results are presented to verify the operating principle.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1998.10a
• /
• pp.397-400
• /
• 1998

This paper has a dual purpose. First, we consider a relaxation algorithm which seems to be particularly suitable for multicasting routing problems. We show that the algorithm has polynomial complexity. Second, to measure the quality of solutions in comparison to the optimal solutions over a wide range of network sizes for which the computation of the optimal costs is too excessive, we also propose a random graph generation scheme in which an asymptotic lower bound on the expected optimal cost can be computed as a function of network node size.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.18 no.1
• /
• pp.45-54
• /
• 1993

Monitoring processor in a circuit switched network is considered. Monitoring processor monitors communication links offers a grade of service in each link to controller. Such an information is useful for an effective maintenance of system. Two links with asymmetric system parameters and multi-symmetric links are respectively considered. Each links is to be an independent M /M/ 1/ 1/ type. Markov modeling technique is used to represent a model of monitoring processor with FCFS steering protocol. Performance measures considered are ratio of monitored jobs in each link, availability of minitoring processor and throughput of virtual processor in each link. The value of the performance meausres are compared with existing and simulation results.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.6B
• /
• pp.523-532
• /
• 2003

GENMET(GEneralized Multihop Network) which is based on Wavelength-Division Multiplexsing(WDM) and can be used in order to construct the next generation lightwave network is a logical(virtual), packet-switched and multihop topology network. GENMET is a regular multihop network which is a generalization of Shuffle network and do Bruijn network As such, it has the advantage of simple routing which is critical in a high speed network Given a physical topology, different logical topologies can be derived for assigning wavelengths to the UserNodes. By appropriately assigning wavelengths, performance of the network, such as mean hop count, maximum throughput and mean packet delay can be improved. In this paper, we propose heuristic algorithms for effectively assigning a limited number of wavelengths to the given UserNodes. The Performance of proposed algorithm is compared with the random assignment and the lower bounds.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1997.10a
• /
• pp.252-256
• /
• 1997

The success of a fuzzy neural network(FNN) control system solving any given problem critically depends on the architecture of the network. Various attempts have been made in optimizing its structure using genetic algorithm automated designs. This paper presents a new approach to structurally optimized designs of FNN models. A messy genetic algorithm is used to obtain structurally optimized FNN models. Structural optimization is regarded important before neural networks based learning is switched into. We have applied the method to the problem of a numerical approximation

• Proceedings of the IEEK Conference
• /
• 1999.06a
• /
• pp.154-157
• /
• 1999

Photonic Slot Routing(PSR) is a promising approach to solve the fundamental scalability problem of all-optical packet switched WDM networks. In photonic slot routing, packets destined for the same subnetwork are aggregated to form a photonic slot which is jointly routed as a single unit of information through the network. The relative location of the nodes from bridge may cause to fairness problem in the unidirectional WDM ring network based on PSR. As photonic slots from different subnetworks can originate contentions at the bridge, packets may be dropped and retransmitted. Thus we evaluated the performance of PSR based WDM ring network in the point of fairness for each node and slot contentions at the bridge. Simulation results show that the PSR based WDM ring requires a slot access mechanism to guarantee the transmission fairness and efficient switch architecture to resolve slot contention at the bridge.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.121-124
• /
• 1999

In a packet-switched wireless cellular network, a packet destined to a mobile station is queued at a base station and then broadcast over the base station's cell. When an active mobile station leaves a cell, there re-main packets which are destined to the mobile and not yet delivered to it at the cell's base station. For application which are sensitive to packet losses, such back- logged packets must be forwarded to the new base station. Otherwise, an end-to-end retransmission may be required. However, an increase in packet delay is incurred by employing the packet forward scheme, since a packet may be forwarded many times before it is delivered to the destined mobile station. For an enhanced quality-of-service level, it is preferred to reduce tile packet delay time. In this paper, we develop an analytical approximation method for deriving mean packet delay times. Using the approximation and simulation methods, we investigate the effect of network parameters on the packet delay time.

• Journal of Communications and Networks
• /
• v.15 no.3
• /
• pp.321-328
• /
• 2013

In this paper, we present a technique for obtaining conflict-free schedules for real-time automation protocol for industrial Ethernet (RAPIEnet) switches. Mathematical model of the switch is obtained using graph theory. Initially network traffic entry and exit parts in a single RAPIEnet switch are identified, so that a bipartite conflict graph can be constructed. The obtained conflict graph is transformed to three kinds of matrices to be used as inputs for our simulation model, and selection of any of the matrix forms is application-specific. A greedy edge-coloring algorithm is used to schedule the network traffic and to solve the minimum coloring problem. After scheduling, empty slots are identified for forwarding the non real-time traffic of asynchronous devices. Finally, an algorithm for synchronizing the schedules of adjacent switches is proposed using edge-contraction and minors. All simulations were carried out using Matlab.