The Experts below are selected from a list of 42690 Experts worldwide ranked by ideXlab platform
Won-joo Hwang - One of the best experts on this subject based on the ideXlab platform.
-
ICOIN - Multicast Algorithms Using Status of Receivers in WDM Broadcast Network for CDN
Lecture Notes in Computer Science, 2004Co-Authors: Kyo-hong Jin, Jong-wook Jang, Won-joo HwangAbstract:Multicasting the multimedia content usually requires broader bandwidth than unicasting service and accordingly WDM Broadcast Network has been highly recommended for the infrastructure Network of CDN(Content Delivery Network). Multicast Service can be implemented by unicast scheduling algorithm, but unnecessary multiple transmissions of a multicast message may result in a waste of bandwidth. To reduce the number of transmissions, multicast service transmits only one message to all destinations, but this may result in excessive receiver waiting time due to complicated transfer scheduling protocol. Although the WDM Broadcast Network easily supports the multicast service, multicast group partitioning problem must be resolved to reduce the receiver’s waiting time and the number of transmissions. In this paper, we propose methods for partitioning a multicast group into smaller subgroups and for scheduling a separate transmission for each of these subgroups. The proposed algorithms reduce the receivers’ waiting time by using the previous status of receivers. We analyze the proposed algorithms comparing with the conventional research through the computer simulation.
Jose A. Ventura - One of the best experts on this subject based on the ideXlab platform.
-
TIME-RELAXED 1-FAULT TOLERANT Broadcast NetworkS
Parallel Processing Letters, 2009Co-Authors: Brian Q. Rieksts, Jose A. VenturaAbstract:In a 1-fault tolerant minimal Broadcast Network, a node of a Network, called the originator, has a message which is to be transmitted to all other nodes of the Network in minimum time regardless of the failure of a single communication line. In some instances, it is advantageous to use time-relaxed Broadcast Networks that require slightly more than the minimum transmission time, but have sparser edge sets. This paper presents a general compounding algorithm to construct sparse, time-relaxed, 1-fault tolerant Broadcast Networks. In the algorithm, copies of a Broadcast Network without faults are interconnected with additional edges according to the structure of a 1-fault tolerant Broadcast Network with two special properties. Both the 1-fault tolerant Broadcast Network and the Broadcast Network without faults may be time-relaxed. Computational results show that the algorithm yields sparser Networks by allowing additional time units.
-
A COMPOUNDING ALGORITHM FOR 1-FAULT TOLERANT Broadcast NetworkS
Asia-Pacific Journal of Operational Research, 2007Co-Authors: Brian Q. Rieksts, Jose A. VenturaAbstract:This theoretical paper presents a new construction algorithm for sparse 1-fault tolerant minimal Broadcast Networks (1-FTMBNs). To construct a large 1-FTMBN with the algorithm, identical nodes in copies of a Broadcast Network that is not fault tolerant are connected according to the edge structures of two known 1-FTMBNs with a special property. In most cases, computational results with this algorithm produce the best-known bounds on the cardinalities of the edge sets of the sparsest 1-FTMBNs with an odd number of nodes.
-
Construction of time-relaxed c -Broadcast Networks
Telecommunication Systems, 2003Co-Authors: Shiwoo Lee, Jose A. VenturaAbstract:C-Broadcasting is an information dissemination task where a message, originated at any node in a Network, is transmitted to all other nodes with the restriction that each node having the message can transmit it to almost c neighbors simultaneously. If the transmission time of the message is set to be one time unit, a minimal c-Broadcast Network (c-MBN) is a communication Network in which c-Broadcasting from any node can be accomplished in [logc+1n] time units, where n is the number of nodes and [logc+1n] is the fastest possible Broadcast time. If Networks are sparse, additional time units may be required to perform c-Broadcasting. A time-relaxed c-Broadcast Network, denoted as (t, c)-RBN, is a Network where c-Broadcasting from any node can be completed in [logc+1n]+t time units. In this paper, a Network compounding algorithm is proposed to construct large sparse (t, c)-RBNs by linking multiple copies of a time-relaxed Network of small size using the structure of another time-relaxed Network. Computational results are presented to show the effectiveness of the proposed algorithm.
-
An algorithm for constructing minimal c-Broadcast Networks
Networks, 2001Co-Authors: Shiwoo Lee, Jose A. VenturaAbstract:c-Broadcasting is a special process to disseminate a single message, originated at any node in a Network, to all other nodes of the Network by letting each informed node transmit the message to at most c neighbors simultaneously. A minimal c-Broadcast Network (c-mbn) is a communication Network in which c-Broadcasting can be completed in minimum time from any node. An optimal c-Broadcast Network (c-obn) is a c-mbn with the smallest number of edges. Previous studies showed that c-obn's are extremely difficult to find. A Network compounding algorithm is proposed to construct sparse c-mbn's with n1n2 − i nodes by connecting a subset of nodes from several copies of a c-mbn with n1 nodes using the structure of another c-mbn with n2 nodes, such that n1 ≥ 1 and 0 ≤ i < n2, satisfying ⌈logc+1(n1n2 − i)⌉ = ⌈logc+1n1⌉ + ⌈logc+1n2⌉. Computational results are also provided. © 2001 John Wiley & Sons, Inc.
-
CONSTRUCTION OF TIME-RELAXED MINIMAL Broadcast NetworkS
Parallel Processing Letters, 1999Co-Authors: Michael J. Dinneen, Jose A. Ventura, Mark C. Wilson, Golbon ZakeriAbstract:In Broadcasting, or one-to-all communication, a message originally held in one node of the Network must be transmitted to all the other nodes. A minimal Broadcast Network is a communication Network that can transmit a message originated at any node to all other nodes of the Network in minimum time. In this paper, we present a compound method to construct sparse, time-relaxed, minimal Broadcast Networks (t-mbn), in which Broadcasting can be accomplished in slightly more than the minimum time. The proposed method generates a new Network by connecting a subset of nodes from several copies of a t1-mbn using the structure of another t2-mbn. The objective is to construct a Network as sparse as possible satisfying the desired Broadcasting time constraint. Computational results illustrate the effectiveness of the proposed method.
Kyo-hong Jin - One of the best experts on this subject based on the ideXlab platform.
-
ICOIN - Multicast Algorithms Using Status of Receivers in WDM Broadcast Network for CDN
Lecture Notes in Computer Science, 2004Co-Authors: Kyo-hong Jin, Jong-wook Jang, Won-joo HwangAbstract:Multicasting the multimedia content usually requires broader bandwidth than unicasting service and accordingly WDM Broadcast Network has been highly recommended for the infrastructure Network of CDN(Content Delivery Network). Multicast Service can be implemented by unicast scheduling algorithm, but unnecessary multiple transmissions of a multicast message may result in a waste of bandwidth. To reduce the number of transmissions, multicast service transmits only one message to all destinations, but this may result in excessive receiver waiting time due to complicated transfer scheduling protocol. Although the WDM Broadcast Network easily supports the multicast service, multicast group partitioning problem must be resolved to reduce the receiver’s waiting time and the number of transmissions. In this paper, we propose methods for partitioning a multicast group into smaller subgroups and for scheduling a separate transmission for each of these subgroups. The proposed algorithms reduce the receivers’ waiting time by using the previous status of receivers. We analyze the proposed algorithms comparing with the conventional research through the computer simulation.
Chi-sung Laih - One of the best experts on this subject based on the ideXlab platform.
-
Conference key agreement protocol with non-interactive fault-tolerance over Broadcast Network
International Journal of Information Security, 2009Co-Authors: Jiin-chiou Cheng, Chi-sung LaihAbstract:Most conventional conference key agreement protocols have not been concerned with a practical situation. There may exist some malicious conferees who attempt to block conference initiation for some purposes, e.g. commercial, political or military benefit. Instances where conference must be launched immediately due to emergency, efficient detection of malicious behavior would be needed. Recently, Tzeng (IEEE Trans. Comput. 51(4):373–379, 2002) proposed a fault-tolerant conference key agreement protocol to address the issue where a conference key can be established among conferees even though malicious conferees exist. However, his protocol might be complex and inefficient during fault-detection. In the case where a malicious conferee exists and a fault-tolerant mechanism is launched, complicated interactions between conferees will be required. In this paper, we introduce a novel strategy, where any malicious conferee may be identified and removed from the conferee list without any interaction. With such a non-interactive fault-tolerance, conferences could be established and started efficiently. A complete example of our protocol will be given to describe the fascinating fault-tolerance. We analyse the security of our protocol regarding four aspects, i.e. correctness, fault-tolerance, active attack and passive attack. The comparisons of performance between our protocol and that of Tzeng are also shown. As a whole, the advantage of our protocol is superior to that of Tzeng under the situation where malicious conferees exist.
Jong-wook Jang - One of the best experts on this subject based on the ideXlab platform.
-
ICOIN - Multicast Algorithms Using Status of Receivers in WDM Broadcast Network for CDN
Lecture Notes in Computer Science, 2004Co-Authors: Kyo-hong Jin, Jong-wook Jang, Won-joo HwangAbstract:Multicasting the multimedia content usually requires broader bandwidth than unicasting service and accordingly WDM Broadcast Network has been highly recommended for the infrastructure Network of CDN(Content Delivery Network). Multicast Service can be implemented by unicast scheduling algorithm, but unnecessary multiple transmissions of a multicast message may result in a waste of bandwidth. To reduce the number of transmissions, multicast service transmits only one message to all destinations, but this may result in excessive receiver waiting time due to complicated transfer scheduling protocol. Although the WDM Broadcast Network easily supports the multicast service, multicast group partitioning problem must be resolved to reduce the receiver’s waiting time and the number of transmissions. In this paper, we propose methods for partitioning a multicast group into smaller subgroups and for scheduling a separate transmission for each of these subgroups. The proposed algorithms reduce the receivers’ waiting time by using the previous status of receivers. We analyze the proposed algorithms comparing with the conventional research through the computer simulation.
