dc.contributor.advisor | John M. Wozencraft. | en_US |
dc.contributor.author | Ros Perán, Francisco de Asis | en_US |
dc.date.accessioned | 2005-08-04T15:49:53Z | |
dc.date.available | 2005-08-04T15:49:53Z | |
dc.date.issued | 1979 | en_US |
dc.identifier.uri | http://hdl.handle.net/1721.1/16020 | |
dc.description | Thesis (Ph.D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1979. | en_US |
dc.description | MICROFICHE COPY AVAILABLE IN ARCHIVES AND ENGINEERING. | en_US |
dc.description | Vita. | en_US |
dc.description | Includes bibliographical references. | en_US |
dc.description.statementofresponsibility | by Francisco de Asís Ros Peran. | en_US |
dc.format.extent | 329 leaves | en_US |
dc.format.extent | 16444745 bytes | |
dc.format.extent | 16444500 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | application/pdf | |
dc.language.iso | eng | en_US |
dc.publisher | Massachusetts Institute of Technology | en_US |
dc.relation.ispartofseries | Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. | en_US |
dc.rights | M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission. | en_US |
dc.rights.uri | http://dspace.mit.edu/handle/1721.1/7582 | |
dc.subject | Electrical Engineering and Computer Science | en_US |
dc.subject.lcsh | Computer networks | en_US |
dc.subject.lcsh | Algorithms | en_US |
dc.subject.lcsh | Linear programming | en_US |
dc.subject.lcsh | Information theory | en_US |
dc.title | Routing to minimize the maximum congestion in a communication network | en_US |
dc.type | Thesis | en_US |
dc.description.degree | Ph.D. | en_US |
dc.contributor.department | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science | |
dc.identifier.oclc | 07201156 | en_US |