• KIPS Transactions on Computer and Communication Systems
• /
• v.4 no.2
• /
• pp.37-40
• /
• 2015

In this paper, we present linear, varied and mixed edge labeling methods using 2-edge labeling on binomial trees. As a result of this paper, we can design the variable topologies to enable optimal broadcasting with binomial tree as spanning tree, if we use these edge labels as the jump sequence of a sort of interconnection networks, circulant graph, with maximum connectivity and high reliability.

• ETRI Journal
• /
• v.30 no.2
• /
• pp.341-343
• /
• 2008

This letter presents an angular minimum spanning tree (AMST) algorithm for topology control in multi-hop wireless ad hoc networks. The AMST algorithm builds up an MST for every angular sector of a given degree around each node to determine optimal transmission power for connecting to its neighbors. We demonstrate that AMST preserves both local and network-wide connectivity. It also improves robustness to link failure and mitigates transmission power waste.

• ETRI Journal
• /
• v.30 no.6
• /
• pp.856-858
• /
• 2008

Odd networks were introduced in the context of graph theory. However, their potential as fault-tolerant multiprocessor networks has been shown. Broadcasting is one of the most important communication primitives used in multiprocessor networks. In this letter, we introduce efficient one-to-all broadcasting schemes of odd networks for one-port and all-port models. We show the broadcasting time of the former is 2d-2 and that of the latter is d-1. The total time steps taken by the proposed algorithms are optimal.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.42 no.1
• /
• pp.27-34
• /
• 2005

In this paper, we propose the Q-edge labeling method related to the graph embedding problem in binomial trees. This result is able to design a new reliable interconnection networks with maximum connectivity using Q-edge labels as jump sequence of circulant graph. The circulant graph is a generalization of Harary graph which is a solution of the optimal problem to design a maximum connectivity graph consists of n vertices End e edgies. And this topology has optimal broadcasting because of having binomial trees as spanning tree.

• ETRI Journal
• /
• v.31 no.3
• /
• pp.330-332
• /
• 2009

Broadcasting is one of the most important communication primitives used in multiprocessor networks. In this letter, we demonstrate that the broadcasting algorithm proposed by Madabhushi and others is incorrect. We introduce efficient one-to-all broadcasting schemes of even networks for one-port and all-port models. The broadcasting time of the one-port model is 2d-3 and that of the all-port model is d-1. The total time steps taken by the proposed algorithms are optimal.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.33 no.2
• /
• pp.103-114
• /
• 2008

Overlay Multicast is a promising approach to overcome the implementation problem of IP multicast. Real time services like Internet broadcasting are provided by the overlay multicast technology due to the complex nature and high cost of IP multicast. To reduce frequent updates of multicast members and to support real time service without delay, we suggest a reliable overlay multicast tree based on members' sojourn probabilities. Path reliabilities from a source to member nodes are considered to maximize the reliability of an overlay multicast tree. The problem is formulated as a binary integer programming with degree and delay bounds. A tabu search heuristic is developed to solve the NP-complete problem. Outstanding results are obtained which is comparable to the optimal solution and applicable in real time.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.24 no.2
• /
• pp.99-104
• /
• 2024

In the deficiency of an exact solution yielding algorithm, approximate algorithms remain as a solely viable option to the Minimum Linear Arrangement(MinLA) problem of Binary tree. Despite repeated attempts by a number of algorithm on k = 10, only two of them have been successful in yielding the optimal solution of 3,696. This paper therefore proposes an algorithm of O(n) complexity that delivers the exact solution to the binary tree. The proposed algorithm firstly employs an In-order search method by which n = 2^k - 1 number of nodes are assigned with a distinct number. Then it reassigns the number of all nodes that occur on level 2 ≤ 𝑙 ≤ k-2, (k = 5) and 2 ≤ 𝑙 ≤ k-3, (k = 6), including that of child of leaf node. When applied to k=5,6,7, the proposed algorithm has proven Chung[14]'s S^(k)_min=2^k-1+4+S^(k-1)_min+2S^(k-2)_min conjecture and obtained a superior result. Moreover, on the contrary to existing algorithms, the proposed algorithm illustrates a detailed assignment method. Capable of expeditiously obtaining the optimal solution for the binary tree of k > 10, the proposed algorithm could replace the existing approximate algorithms.

• The Journal of the Korea Contents Association
• /
• v.8 no.8
• /
• pp.1-8
• /
• 2008

Overlay Multicast is an effective method for optimal utilization of system resources and network bandwidth without a need for hardware customization. It is an effective method of providing Personal Internet Broadcasting Service for better Quality of Service to many users. In this paper, we propose a multicast tree that uses Local Swap method. In order to prove the effectiveness of the new technique suggested here, using the proposed method and personal internet broadcasting service, information is abstracted, compared and analyzed under various overlay multicast algorithm conditions. We have proved that the suggested local swap technique is more effective by comparing it with other existing techniques in various methods such as using various overlay based multicast algorithm simulation.

• The Journal of Information Systems
• /
• v.8 no.1
• /
• pp.109-129
• /
• 1999

This study deals with the problem of information dissemination in a communication network, which is defined to be the process whereby a set of messages, generated by an originator, is transmitted to all the members within the network. Since this type of message generally includes control data to manage the network or global information that all members should know, it is to be required to transmit it to all the members as soon as possible. In this study, it is assumed that a member can either transmit or receive a message and an informed member can transmit it to only one of its neighbors at time. This type of transmission is called 'local broadcasting' Several schemes of call sequencing are designed for a general-type network with nonuniform edge transmission times, and then computer simulations are performed. Some heuristics for information dissemination are proposed and tested. For this, optimal call sequence in a tree-type network, sequencing theory and graph theory are applied. The result shows that call sequencing based on the shortest path tree is the most desirable.

• Proceedings of the Korea Contents Association Conference
• /
• 2007.11a
• /
• pp.270-273
• /
• 2007

The overlay multicast that has been recently presented as an alternative for the IP multicast has been getting much persuasion by the advancement of the network techniques to enforce routing in application-level. But, The overlay multicast is a problem of delay and the load of the traffic control. In this paper, we suggested to an effective transmission routing tree between users based on overlay multicast of Internet broadcasting Service. And we evaluated an optimal value of transmission delay about Internet broadcasting using this suggest model.