Add to ORKGBibliography: p. 139.Prepared under National Science Foundation Grant NSF/ENG76-24447.Originally presented as the author's thesis, (M.S.) in the M.I.T. Dept. of Electrical Engineering and Computer Science, 1977.by John Christopher Poulos
This thesis gives a general discussion of routing for computer networks, followed by an overview of ...
ABSTRAKSI: Jaringan komunikasi telah berkembang sedemikian besar dan luas. Aplikasi dan layanan di j...
The authors consider the transmission of a message of size r from a source to a destination with gua...
One of the computer science papers most worth reading is Gallager’s algorithm for mini-mum delay rou...
Bibliography: p. 47."March 1981"" ARPA Grant No. ONR-N00014-75-C-1183" "National Science Foundation ...
Vita.Much research has been devoted to developing efficient routing algorithms for data networks, pa...
Bibliography: p. 695."May 1981." From: IEEE transactions on communications, Vol. COM-29, No. 5, May ...
Research supported by NSF Grant ENG-79-06332.Bibliography: leaf 37.by Eliezer M. Gafni
Bibliography: p. 35."September 1978."Supported by the Advanced Research Project Agency (monitored by...
We propose a class of algorithms for finding an optimal quasistatic routing in a communication netwo...
textAs the field of Delay Tolerant Networking continues to expand and receive more attention, a new ...
Bibliography: p. 146-148.Research supported by ARPA Contract N00014-75-C-1183, ONR Contract ONR-N)))...
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer S...
Vita.Two algorithms have been developed which provide a loop-free property for adaptive routing proc...
. This paper describes our experiment in simulation of a routing algorithm in ATM networks using dis...
This thesis gives a general discussion of routing for computer networks, followed by an overview of ...
ABSTRAKSI: Jaringan komunikasi telah berkembang sedemikian besar dan luas. Aplikasi dan layanan di j...
The authors consider the transmission of a message of size r from a source to a destination with gua...
One of the computer science papers most worth reading is Gallager’s algorithm for mini-mum delay rou...
Bibliography: p. 47."March 1981"" ARPA Grant No. ONR-N00014-75-C-1183" "National Science Foundation ...
Vita.Much research has been devoted to developing efficient routing algorithms for data networks, pa...
Bibliography: p. 695."May 1981." From: IEEE transactions on communications, Vol. COM-29, No. 5, May ...
Research supported by NSF Grant ENG-79-06332.Bibliography: leaf 37.by Eliezer M. Gafni
Bibliography: p. 35."September 1978."Supported by the Advanced Research Project Agency (monitored by...
We propose a class of algorithms for finding an optimal quasistatic routing in a communication netwo...
textAs the field of Delay Tolerant Networking continues to expand and receive more attention, a new ...
Bibliography: p. 146-148.Research supported by ARPA Contract N00014-75-C-1183, ONR Contract ONR-N)))...
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer S...
Vita.Two algorithms have been developed which provide a loop-free property for adaptive routing proc...
. This paper describes our experiment in simulation of a routing algorithm in ATM networks using dis...
This thesis gives a general discussion of routing for computer networks, followed by an overview of ...
ABSTRAKSI: Jaringan komunikasi telah berkembang sedemikian besar dan luas. Aplikasi dan layanan di j...
The authors consider the transmission of a message of size r from a source to a destination with gua...