Optimal Linear Broadcast

@article{Bitan1990OptimalLB,
  title={Optimal Linear Broadcast},
  author={Sara Bitan and Shmuel Zaks},
  journal={J. Algorithms},
  year={1990},
  volume={14},
  pages={288-315}
}
As the communication lines and switching hardware in distributed networks become much faster, a new trend of algorithms is needed to utilize it. Traditional broadcast algorithm send one packet along each communication line at a time, and propagate it by replicating and sending it on all the outgoing lines. This method does not use the high bandwidth or the switching hardware, and it overloads the processor. Our routing algorithms send several packets simultaneously on one communication line… 
View via Publisher
cs.technion.ac.il
7 Citations
Background Citations
1

Figures from this paper

7 Citations

Optimal Linear Broadcast Routing with Capacity Limitations

This work studies the problem of broadcast routing in high-speed networks with special switching hardware, in which the packets travel along linear routes, determined in the header of the packet.

New models and algorithms for future networks

A class of new models for distributed algorithms which make explicit the difference between switching and processing are introduced, which define new message and time complexity measures which, the authors believe, capture the costs in many high-speed networks more accurately then traditional measures.

Minimum-cost Line Broadcast in Paths

Linear multicasting in dynamic networks

Optimal Group Gossiping in Hypercubes under a Circuit-Switching Model

This paper considers the group-gossiping problem in n-cubes under a circuit-switching model and proposes an optimal group- gossiping algorithm for n- cubes under the model.

Token Transfer in a Faulty Network

This work considers various communication models depending on the ability of nodes to modify their behavior according to the outcome of previous transmissions and presents token transfer algorithms working fast and with probability of correctness exceeding 1 - n -e , where n is the number of nodes and e an arbitrary positive constant.

Fault-Tolerant Linear Broadcasting

This work estimates the minimum number of packets for which there exists an f-fault-tolerant linear broadcasting scheme in complete networks, and constructs schemes using few packets.

References

SHOWING 1-9 OF 9 REFERENCES

New models and algorithms for future networks

A class of new models for distributed algorithms which make explicit the difference between switching and processing are introduced, which define new message and time complexity measures which, the authors believe, capture the costs in many high-speed networks more accurately then traditional measures.

Paris: An approach to integrated high‐speed private networks

This paper describes a design of a high-speed packet switching system for integrated voice, video and data communications. The system makes use of a simplified network architecture in order to…

Distributed network protocols

  • A. Segall
  • Computer Science
    IEEE Trans. Inf. Theory
  • 1983
A series of known and new protocols for connectivity test, shortest path, and path updating are described and validated and extended to networks with changing topology.

The Design and Analysis of Computer Algorithms

This text introduces the basic data structures and programming techniques often used in efficient algorithms, and covers use of lists, push-down stacks, queues, trees, and graphs.

A distributed query protocol for high-speed networks

Linear Broadcast Routing

Technion -Computer Science Department -Tehnical Report CS0623

  • Technion -Computer Science Department -Tehnical Report CS0623
  • 1990

PARIS: An Approach to Private Integrated Networks

  • Journal of Analog and Digital Cabled Systems,
  • 1988

Distributed Networks Protocols

  • IEEE Trans. on Information Theory, IT
  • 1983