A failsafe distributed protocol for minimum delay routing

A failsafe distributed protocol for minimum delay routing

Bibliography: p. 695.

গ্রন্থ-পঞ্জীর বিবরন
অন্যান্য লেখক:	Massachusetts Institute of Technology. Laboratory for Information and Decision Systems.
ভাষা:	eng
প্রকাশিত:	Laboratory for Information and Decision Systems, Massachusetts Institute of Technology 2002
বিষয়গুলি:	TK7855.M41 E3845 no.1099 Data transmission systems
অনলাইন ব্যবহার করুন:	http://hdl.handle.net/1721.1/929

অনুরূপ উপাদানগুলি

A failsafe distributed routing protocol
প্রকাশিত: (2002)

Failsafe distributed optimal routing in data-communication networks
প্রকাশিত: (2002)

Distributed asynchronous optimal routing in data networks
প্রকাশিত: (2002)

Second derivative algorithms for minimum delay distributed routing in networks
প্রকাশিত: (2002)

Second derivative algorithms for minimum delay distributed routing in networks
প্রকাশিত: (2002)

Optimal distributed routing for virtual line-switched data networks
প্রকাশিত: (2002)

Delays in acyclical distributed decisionmaking organizations
প্রকাশিত: (2003)

A conflict sense routing protocol and its performance for hypercubes
প্রকাশিত: (2003)

Some issues in distributed asynchronous routing in virtual circuit data networks
প্রকাশিত: (2003)

A distributed algoritm for minimum weight directed spanning trees
প্রকাশিত: (2003)

On distributed network protocols for changing topologies
প্রকাশিত: (2003)

Distributed network protocols for changing topologies : a counterexample
প্রকাশিত: (2003)

The auction algorithm for the minimum cost network flow problem
প্রকাশিত: (2003)

Parallel primal-dual methods for the minimum cost flow problem
প্রকাশিত: (2003)

A generic auction algorithm for the minimum cost network flow problem
প্রকাশিত: (2003)

Parallel asynchronous primal-dual methods for the minimum cost flow problem
প্রকাশিত: (2003)

Relaxation methods for minimum cost ordinary and generalized network flow problems
প্রকাশিত: (2003)

An auction/sequential shortest path algorithm for the minimum cost network flow problem
প্রকাশিত: (2003)

Dynamic routing in reentrant FMS
প্রকাশিত: (2003)

The throughput of wavelength routing networks
প্রকাশিত: (2003)

RELAX-IV : a faster version of the RELAX code for solving minimum cost flow problems
প্রকাশিত: (2003)

The efficiency of greedy routing in hypercubes and butterflies
প্রকাশিত: (2002)

Wavelength routing for all-optical networks
প্রকাশিত: (2003)

Broadcasting topology and routing information in computer networks
প্রকাশিত: (2003)

Performance of hypercube routing schemes with or without buffering
প্রকাশিত: (2003)

Necessary and sufficient condition for BIBO stabilty commensurate delays
প্রকাশিত: (2003)

L1Ì³ sensitivity minimization for plants with commensurate delays
প্রকাশিত: (2003)

Full utilization, fairness and bounded access delay on high speed bus networks
প্রকাশিত: (2003)

Minimum variance control of discrete time multivariable ARMAX systems
প্রকাশিত: (2002)

RELAX: a computer code for minimum cost network flow problems
প্রকাশিত: (2003)

On the design of distributed organizational structures
প্রকাশিত: (2003)

On the distributions of optimized multiscale representations
প্রকাশিত: (2003)

A unified framework for primal-dual methods in minimum cost network flow problems
প্রকাশিত: (2003)

A recoverable protocol for loop-free distributed routing
প্রকাশিত: (2002)

Generation of architectures for distributed intelligence systems
প্রকাশিত: (2003)

Human organizations as distributed intelligence systems
প্রকাশিত: (2003)

On the communication complexity of distributed algebraic computation
প্রকাশিত: (2003)

Distributed detection by a large team of sensors in tandem
প্রকাশিত: (2003)

Parallel and distributed iterative algorithms : a selective survey
প্রকাশিত: (2003)

Channel reuse multiple access protocol for bidirectional bus networks
প্রকাশিত: (2003)