The efficiency of greedy routing in hypercubes and butterflies

The efficiency of greedy routing in hypercubes and butterflies

Includes bibliographical references (p. 24-26).

Bibliographic Details
Other Authors:	Massachusetts Institute of Technology. Laboratory for Information and Decision Systems.
Language:	eng
Published:	Massachusetts Institute of Technology, Laboratory for Information and Decision Systems 2002
Subjects:	TK7855.M41 E3845 no.1999
Online Access:	http://hdl.handle.net/1721.1/1173

Similar Items

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

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

An efficient algorithm for multiple simultaneous broadcasts in the hypercube
Published: (2002)

Optimal communication algorithms for hypercubes
Published: (2003)

Communication algorithms for isotropic tasks in hypercubes and wraparound meshes
Published: (2003)

Multinode broadcast in hypercubes and rings with randomly distributed length of packets
Published: (2002)

Transposition of banded matrices in hypercubes : a "nearly isotropic" task
Published: (2003)

Analysis of a greedy heuristic for finding small dominating sets in graphs
Published: (2002)

A note on the greedy approximation algorithm for the unweighted set covering problem
Published: (2003)

The throughput of wavelength routing networks
Published: (2003)

Dynamic routing in reentrant FMS
Published: (2003)

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

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

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

Efficient algorithms for globally optimal trajectories
Published: (2003)

Efficient implementations of 2-D noncausal IIR filters
Published: (2003)

Efficient algorithms for continuous-space shortest path problems
Published: (2003)

Efficient multiscale regularization with applications to the computation of optical flow
Published: (2003)

An efficient maximum entropy technique for 2-D isotropic random fields
Published: (2003)

An efficient maximum entropy technique for 2-D isotropic random fields
Published: (2003)

Asymptotic optimality of shortest path routing
Published: (2003)

Flow control and routing techniques for integrated voice and data networks
Published: (2002)

Equilibrium concepts in stochastic multicriteria optimization
Published: (2002)

Controller reduction by H[infinity]-balanced truncation
Published: (2002)

Signaling and uncertainty : c case study
Published: (2002)

Reduced-order control of systems for which balanced truncation in Hankel-norm optimal
Published: (2002)

Envelope detection of orthogonal signals with phase noise
Published: (2002)

A unified approach to the vehicle-merging problem
Published: (2002)

A note on the genericity of simultaneous stabilizability and pole assignability
Published: (2002)

Design of optical matched filters
Published: (2002)

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

Computational limitations of model based recognition
Published: (2002)

Capital accumulation in a stochastic decentralized economyy
Published: (2002)

Preferential defense strategies. :
Published: (2002)

LQG cost bounds in discrete-time H2/H-[infinity] control
Published: (2002)

Robust stability of linear dynamic systems with application to singular perturbation theory
Published: (2002)

Optimal control of noisy finite-state Markov processes
Published: (2002)

A functional expansion approach to the solution of nonlinear feedback systems
Published: (2002)

Variable metric methods and filtering theory
Published: (2002)

Parallel smoothing algorithms for causal and acausal systems
Published: (2002)