Minimum Time Broadcast Networks Tolerating a Logarithmic Number of Faults

1992 ◽  
Vol 5 (2) ◽  
pp. 178-198 ◽  
Author(s):  
Luisa Gargano ◽  
Ugo Vaccaro
Keyword(s):  
Minimum Time ◽  
Broadcast Networks ◽  
Logarithmic Number

Minimum-time line broadcast networks

Networks ◽  
1980 ◽  
Vol 10 (1) ◽  
pp. 59-70 ◽  
Author(s):  
Arthur M. Farley
Keyword(s):  
Minimum Time ◽  
Time Line ◽  
Broadcast Networks

CONSTRUCTION OF TIME-RELAXED MINIMAL BROADCAST NETWORKS

1999 ◽  
Vol 09 (01) ◽  
pp. 53-68 ◽  
Author(s):  
MICHAEL J. DINNEEN ◽  
JOSE A. VENTURA ◽  
MARK C. WILSON ◽  
GOLBON ZAKERI
Keyword(s):  
Communication Network ◽  
Time Constraint ◽  
Minimum Time ◽  
The Other ◽  
Computational Results ◽  
Broadcast Network ◽  
Broadcast Networks ◽  
Compound Method

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.

TIME-RELAXED 1-FAULT TOLERANT BROADCAST NETWORKS

2009 ◽  
Vol 19 (02) ◽  
pp. 335-353
Author(s):  
BRIAN Q. RIEKSTS ◽  
JOSE A. VENTURA
Keyword(s):  
Fault Tolerant ◽  
Minimum Time ◽  
Transmission Time ◽  
Communication Line ◽  
Computational Results ◽  
Additional Time ◽  
Broadcast Network ◽  
Broadcast Networks

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.

Developing Schedule With Linear Programming (Case Study: STTF II Project Komplek Sukamukti Banjaran)

2020 ◽  
Vol 4 (02) ◽  
pp. 34-45
Author(s):  
Naufal Dzikri Afifi ◽  
Ika Arum Puspita ◽  
Mohammad Deni Akbar
Keyword(s):  
Linear Programming ◽  
Objective Function ◽  
Project Scheduling ◽  
Time Limit ◽  
Minimum Time ◽  
Service Cost ◽  
Trade Off ◽  
Overtime Work ◽  
The Cost

Shift to The Front II Komplek Sukamukti Banjaran Project is one of the projects implemented by one of the companies engaged in telecommunications. In its implementation, each project including Shift to The Front II Komplek Sukamukti Banjaran has a time limit specified in the contract. Project scheduling is an important role in predicting both the cost and time in a project. Every project should be able to complete the project before or just in the time specified in the contract. Delay in a project can be anticipated by accelerating the duration of completion by using the crashing method with the application of linear programming. Linear programming will help iteration in the calculation of crashing because if linear programming not used, iteration will be repeated. The objective function in this scheduling is to minimize the cost. This study aims to find a trade-off between the costs and the minimum time expected to complete this project. The acceleration of the duration of this study was carried out using the addition of 4 hours of overtime work, 3 hours of overtime work, 2 hours of overtime work, and 1 hour of overtime work. The normal time for this project is 35 days with a service fee of Rp. 52,335,690. From the results of the crashing analysis, the alternative chosen is to add 1 hour of overtime to 34 days with a total service cost of Rp. 52,375,492. This acceleration will affect the entire project because there are 33 different locations worked on Shift to The Front II and if all these locations can be accelerated then the duration of completion of the entire project will be effective

Sign in / Sign up

Export Citation Format

Share Document