A recoverable protocol for loop-free distributed routing

Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/863

Full metadata record

DC Field	Value	Language
dc.contributor	Massachusetts Institute of Technology. Laboratory for Information and Decision Systems.	-
dc.contributor	Merlin, Philip M	-
dc.contributor	Gallager, Robert G.	-
dc.contributor	Segall, Adrian.	-
dc.date	2002-06-21T03:38:56Z	-
dc.date	2002-06-21T03:38:56Z	-
dc.date	1978	-
dc.date.accessioned	2013-05-31T14:53:21Z	-
dc.date.available	2013-05-31T14:53:21Z	-
dc.date.issued	2013-05-31	-
dc.identifier	http://hdl.handle.net/1721.1/863	-
dc.identifier.uri	http://koha.mediu.edu.my:8181/jspui/handle/1721	-
dc.description	A. Segall, P.M. Merlin and R.G. Gallager.	-
dc.description	Bibliography: leaf 25.	-
dc.description	"September 1978." Suppported in part by Codex Corporation.	-
dc.description	Supported in part by the Advanced Research Project Agency (monitored by ONR) under Contract no. N00014-75-C-1183	-
dc.format	25 leaves	-
dc.format	application/pdf	-
dc.language	eng	-
dc.publisher	Laboratory for Information and Decision Systems, Massachusetts Institute of Technology	-
dc.relation	LIDS-P ; 848	-
dc.subject	TK7855.M41 E3845 no.848	-
dc.subject	Computer network protocols	-
dc.subject	Algorithms	-
dc.title	A recoverable protocol for loop-free distributed routing	-
Appears in Collections:	MIT Items

Files in This Item:

There are no files associated with this item.

DSpace JSPUI