Okbin Lee

The design and analysis of an efficient load balancing algorithm employing the symmetric balanced incomplete block design

In order to maintain load balancing in a distributed network, each node should obtain workload information from all the nodes in the network. To accomplish this, this processing requires O(v^2) communication complexity, where v is the number of nodes. First, we present a new synchronous dynamic distributed load balancing algorithm on a (v,k+1,1)-configured network applying a symmetric balanced incomplete block design, where v=k^2+k+1. Our algorithm designs a special adjacency matrix and then transforms it to (v,k+1,1)-configured network for an efficient communication. It requires only O(vv) communication complexity and each node receives workload information from all the nodes without redundancy since each link has the same amount of traffic for transferring workload information. Later, this algorithm is revised for distributed networks and is analyzed in terms of efficiency of load balancing.

A parallel routing algorithm on recursive cube of rings networks employing Hamiltonian circuit Latin square

Recursive cube of rings (RCR) networks [Y. Sun, P. Cheung, X. Lin, Recursive cube of rings: a new topology for interconnection networks, IEEE Trans. Parallel Dist. Syst. 11 (3) (2000) 275-286] can be widely used in the design and implementation of parallel processing architectures. In this paper, we investigate the routing of a message on RCR networks, that is a key to the performance of this network. We would like to transmit k+1 packets from a source node to a destination node simultaneously along paths on RCR networks, the ith packet will traverse along the ith path (1=

An efficient load balancing algorithm employing a symmetric balanced incomplete block design

In order to maintain load balancing in distributed system, should obtain workload information from all the nodes on network. It requires O(v2) communication overhead, where v is the number of nodes. In this paper, we present a new synchronous dynamic distributed load balancing algorithm on a (v, k + 1, 1)-configured network applying symmetric balanced incomplete block design, where v = k2 + k + 1. Our algorithm needs only O(v√v) message overhead and each node receives workload information from all the nodes without redundancy. Therefore, load balancing is maintained since every link has the same amount of traffic for transferring workload information.

Application of load balancing based on symmetric balanced incomplete block design to random networks

In a load balancing algorithm [O. Lee, M. Anshel, I. Chung, Design of an efficient load balancing algorithm on distributed networks by employing symmetric balanced incomplete block design, IEE Proceedings - Communications 151 (6) (2004) 535-538] based on the SBIBD (Symmetric Balanced Incomplete Block Design), each node receives global workload information by only two round message exchange with O(vv) traffic overhead, where v is the number of nodes. It is very efficient and works well only when v=p^2+p+1 is used for a prime number p. In this paper, we generated a special incidence structure using the SBIBD and then propose a new load balancing algorithm, which executes well for an arbitrary number of nodes. To accomplish this, we add a number of links to nodes in order for each node to receive more than 80% of the workload information by two round message exchange. For performance of our algorithm, we carried out an experiment for the number of nodes, w, which was up to 5000. Traffic overhead is less than ww in a round and standard deviation of traffic overhead shows that each node has a mostly well-balanced amount of traffic.

The design of a dynamic efficient load balancing algorithm on distributed networks

In order to maintain load balancing in a distributed network, each node should obtain workload information from all the nodes in the network. To accomplish this, this processing requires O(v2) communication complexity, where v is the number of nodes. First, we present a new synchronous dynamic distributed load balancing algorithm on a (v,k+1,1)-configured network applying a symmetric balanced incomplete block design, where v=k2+k+1. Our algorithm designs a special adjacency matrix and then transforms it to (v,k+1,1)-configured network for an efficient communication. It requires only

Application of Block Design to a Load Balancing Algorithm on Distributed Networks

O(v \sqrt v)

Application of Fiat-Shamir Identification Protocol to Design of a Secure Mobile Agent System

communication complexity and each node receives workload information from all the nodes without redundancy since each link has the same amount of traffic for transferring workload information. Later, this algorithm is reconstructed on distributed networks, where v is an arbitrary number of nodes and is analyzed in terms of efficiency of load balancing.

An Efficient Load Balancing Algorithm on Distributed Networks

In order to maintain load balancing in a distributed system, we should obtain workload information from all the nodes in the network. This processing requires O(v 2) communication complexity, where v is the number of nodes. In this paper, we present a new synchronous dynamic distributed load balancing algorithm on a (v,k+1,1)-configured network applying a symmetric balanced incomplete block design, where v=k 2+k+1. Our algorithm needs only \(O(v\sqrt{v})\) communication complexity and each node receives workload information from all the nodes without redundancy. Later, for the arbitrary number of nodes, the algorithm will be designed.

A Design of Secure Mobile Agent Systems Employing ID based Digital Multi-Signature Scheme

Even though an agent system contributes largely to mobile computing on distributed network environment, it has a number of significant security problems. In this paper, we analyze security attacks to this system presented by NIST[3]. In order to protect it from them, we suggest a security protocol for a mobile agent system by employing Identity-based key distribution and digital multi-signature scheme. To solve the problems described on NIST, securities of mobile agent and agent platform should be accomplished. Comparing with other protocols, our protocol performs both of these securities, while other protocols mention only one of them. Also, it is designed to guarantee the liveness of agent, and to detect message modification immediately by verifying the execution of agent correctly.

An Algorithm of SBIBD based Load Balancing Applicable to a Random Network

In order to maintain load balancing in a distributed system, we should obtain workload information from all the nodes on the network. This processing requires O(v 2) communication complexity, where v is the number of nodes. In this paper, we present a new synchronous dynamic distributed load balancing algorithm based on (v,k+1,1) design, where v=k 2+k+1. Our algorithm needs only \(O(v\sqrt{v})\) communication complexity and each node receives workload information from all the nodes without redundancy. And load balancing is maintained so that every node has the same amount of traffic for transferring workload information.