A recoverable protocol for loop-free distributed routing

A recoverable protocol for loop-free distributed routing

Bibliography: leaf 25.

Bibliographic Details
Other Authors:	Gallager, Robert G.
Language:	eng
Published:	Laboratory for Information and Decision Systems, Massachusetts Institute of Technology 2002
Subjects:	TK7855.M41 E3845 no.848 Algorithms Computer network protocols
Online Access:	http://hdl.handle.net/1721.1/863

Similar Items

A failsafe distributed routing protocol
Published: (2002)

A reliable broadcast protocol
Published: (2003)

A conflict sense routing protocol and its performance for hypercubes
Published: (2003)

Some issues in distributed asynchronous routing in virtual circuit data networks
Published: (2003)

On distributed network protocols for changing topologies
Published: (2003)

Distributed network protocols for changing topologies : a counterexample
Published: (2003)

Asymptotic optimality of shortest path routing
Published: (2003)

The throughput of wavelength routing networks
Published: (2003)

Dynamic routing in reentrant FMS
Published: (2003)

The efficiency of greedy routing in hypercubes and butterflies
Published: (2002)

Wavelength routing for all-optical networks
Published: (2003)

Performance of hypercube routing schemes with or without buffering
Published: (2003)

Broadcasting topology and routing information in computer networks
Published: (2003)

Closed-loop structural stability for linear-quadratic optimal systems
Published: (2002)

Distributed asynchronous deterministic and stochastic gradient optimization algorithms
Published: (2002)

A distributed algoritm for minimum weight directed spanning trees
Published: (2003)

A failsafe distributed protocol for minimum delay routing
Published: (2002)

A distributed shortest path protocol
Published: (2002)

Control systems with rate and magnitude saturation for neutrally stable open loop systems
Published: (2003)

Second derivative algorithms for minimum delay distributed routing in networks
Published: (2002)

Second derivative algorithms for minimum delay distributed routing in networks
Published: (2002)

Channel reuse multiple access protocol for bidirectional bus networks
Published: (2003)

On the complexity of designing distributed protocols
Published: (2003)

Optimal distributed routing for virtual line-switched data networks
Published: (2002)

On the design of distributed organizational structures
Published: (2003)

On the distributions of optimized multiscale representations
Published: (2003)

Space-time characteristics of ALOHA protocols in high speed birdirectional bus networks
Published: (2003)

On the communication complexity of distributed algebraic computation
Published: (2003)

Generation of architectures for distributed intelligence systems
Published: (2003)

Delays in acyclical distributed decisionmaking organizations
Published: (2003)

Human organizations as distributed intelligence systems
Published: (2003)

DTQDB : a fair and fully utilized media access protocol for dual bus networks
Published: (2003)

On the average communication complexity of asynchronous distributed algorithms
Published: (2002)

An adaptive distributed Dijkstra shortest path algorithm
Published: (2003)

Communication complexity of distributed shortest path algorithms
Published: (2003)

On the average communication complexity of asynchronous distributed algorithms
Published: (2003)

Optimal distributed policies for choosing among multiple servers
Published: (2002)

Synthesis of distributed command and control for the outer air battle
Published: (2003)

Parallel and distributed iterative algorithms : a selective survey
Published: (2003)

Optimum configuration for distributed teams of two decision-makers
Published: (2003)