New models and algorithms for future networks

@article{Cidon1995NewMA,
  title={New models and algorithms for future networks},
  author={Israel Cidon and Inder S. Gopal and Shay Kutten},
  journal={IEEE Trans. Inf. Theory},
  year={1995},
  volume={41},
  pages={769-780},
  url={https://api.semanticscholar.org/CorpusID:1857500}
}
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.
View on ACM
iew3.technion.ac.il
88 Citations
Highly Influential Citations
7
Background Citations
17
Methods Citations
14
Results Citations
5

Figures from this paper

88 Citations

A fast topology maintenance algorithm for high-bandwidth networks

A fast time-driven algorithm for topology maintenance in high-speed networks is presented that uses only four time units for each broadcast by each computer and requires O(D) broadcasts per node before all nodes know the correct topology of the network.

New models and algorithms for programmable networks

    D. RazY. Shavitt
    Computer Science, Engineering
    2001 IEEE Open Architectures and Network…
  • 2001
A new model is presented that captures the hop-by-hop datagram forwarding mechanism deployed in today's IP networks, as well as the ability to perform complex computations in network elements as proposed in the active networks paradigm.

Broadcast in fast networks

A broadcast algorithm for such a network that is tolerant of failures in the form of message loss is presented, and the basic idea is to forward broadcast messages directly in hardware, thereby avoiding software- introduced delays.

Designing broadcasting algorithms in the postal model for message-passing systems

The impact of communication latencies on the design of broadcasting algorithms for fully connected message-passing systems is explored and a postal model that incorporates a communication latency parameter λ ≥ 1 is introduced.

Optimal Linear Broadcast

This paper presents algorithms that compute an optimal broadcast routing, using a bounded number of linear routes, and proves that a greedy algorithm solves the problem, and presents an improved algorithm for the same problem.

Multiple message broadcasting in the postal model

    A. Bar-NoyS. Kipnis
    Computer Science
    [1993] Proceedings Seventh International Parallel…
  • 1993
The authors provide two algorithms for broadcasting m messages in a message-passing system with n processors and communication latency lambda, and present algorithm PARTITION that takes at most 2m+f/sub lambda /(n)+O( lambda ) time, and algorithm D-D-TREES that Takes at most m+2f/ sub lambda / (n)+ O(lambda ) time.

Asynchronous resource discovery

The algorithm for ad-hoc resource discovery has near linear O(nα(n, n) message complexity and the algorithm efficiently deals with dynamic node additions to the system, thus addressing an open question of [3].

Optimal maintenance of a spanning tree

It is shown that keeping track of history enables significant improvements in the communication complexity of dynamic network protocols and implies the improvement of algorithms for these tasks.

Multiple Message Broadcasting in the Postal Model (Extended Abstract)

This paper provides two algorithms for broadcasting m messages in a message-passing system with 7) processors and communication latency A and D, and presents Algorithm PARTITION that takes at most 2nt+ fx(n) +O(X) time, and Algorithm D-DTREES that Takes at most nt + 2fx( n) + O( X) time.

Upper and lower bounds for routing schemes in dynamic networks

An algorithm and two lower bounds are presented for the problem of constructing and maintaining routing schemes in dynamic networks. The algorithm distributively assigns addresses to nodes and…
...

34 References

Broadcast in fast networks

A broadcast algorithm for such a network that is tolerant of failures in the form of message loss is presented, and the basic idea is to forward broadcast messages directly in hardware, thereby avoiding software- introduced delays.

Optimal Linear Broadcast

This paper presents algorithms that compute an optimal broadcast routing, using a bounded number of linear routes, and proves that a greedy algorithm solves the problem, and presents an improved algorithm for the same problem.

A modular technique for the design of efficient distributed leader finding algorithms

A general, modular technique for designing efficient leader finding algorithms in distributed, asynchronous networks is developed, and in some cases the message complexity of the resulting algorithms is better by a constant factor than that of previously known algorithms.

The impact of synchronous communication on the problem of electing a leader in a ring

The problem of electing a leader in a synchronous ring of n processors is considered and it is shown that if processor ID's are chosen from some countable set, then there is an algorithm which uses only O(n) messages in the worst case.

Tight lower and upper bounds for some distributed algorithms for a complete network of processors

One implication of the results is that finding a spanning tree in a complete network is easier than finding a minimum weight spanning Tree in such a network, which may require O(n)>(supscrpt>2</supsCrpt) messages.

The New Routing Algorithm for the ARPANET

The new ARPANET routing algorithm is an improvement over the old procedure in that it uses fewer network resources, operates on more realistic estimates of network conditions, reacts faster to…

Distributed control for PARIS

The control protocols of the PARIS experimental network are described, which is currently operational as a laboratory prototype and will also be deployed within the AURORA Testbed that is part of the NSF/DARPA Gigabit Networking program.

A correctness proof of a topology information maintenance protocol for a distributed computer network

The Topology Information Protocol that was implemented on the MERIT Computer Network is presented and explained; this protocol is quite general and could be implemented on any computer network.

Information Dissemination in Trees

An algorithm is presented which determines the amount of time required to pass, or to broadcast, a unit of information from an arbitrary vertex to every other vertex in a tree and it is shown that the subtree induced by the broadcast center of a tree is always a star with two or more vertices.

A new look at fault tolerant network routing

A number of results concerning the diameter of surviving route graphs are proved, including one of the most important contributions of this paper: a list of interesting and apparently difficult open problems.