Routing to minimize the maximum congestion in a communication network
Thesis (Ph.D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1979.
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Language: | eng |
| Published: |
Massachusetts Institute of Technology
2005
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1721.1/16020 |
| _version_ | 1826207320281972736 |
|---|---|
| author | Ros Perán, Francisco de Asis |
| author2 | John M. Wozencraft. |
| author_facet | John M. Wozencraft. Ros Perán, Francisco de Asis |
| author_sort | Ros Perán, Francisco de Asis |
| collection | MIT |
| description | Thesis (Ph.D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1979. |
| first_indexed | 2024-09-23T13:47:50Z |
| format | Thesis |
| id | mit-1721.1/16020 |
| institution | Massachusetts Institute of Technology |
| language | eng |
| last_indexed | 2024-09-23T13:47:50Z |
| publishDate | 2005 |
| publisher | Massachusetts Institute of Technology |
| record_format | dspace |
| spelling | mit-1721.1/160202019-04-12T22:51:22Z Routing to minimize the maximum congestion in a communication network Ros Perán, Francisco de Asis John M. Wozencraft. Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science Electrical Engineering and Computer Science Computer networks Algorithms Linear programming Information theory Thesis (Ph.D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1979. MICROFICHE COPY AVAILABLE IN ARCHIVES AND ENGINEERING. Vita. Includes bibliographical references. by Francisco de Asís Ros Peran. Ph.D. 2005-08-04T15:49:53Z 2005-08-04T15:49:53Z 1979 Thesis http://hdl.handle.net/1721.1/16020 07201156 eng Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. 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. http://dspace.mit.edu/handle/1721.1/7582 329 leaves 16444745 bytes 16444500 bytes application/pdf application/pdf application/pdf Massachusetts Institute of Technology |
| spellingShingle | Electrical Engineering and Computer Science Computer networks Algorithms Linear programming Information theory Ros Perán, Francisco de Asis Routing to minimize the maximum congestion in a communication network |
| title | Routing to minimize the maximum congestion in a communication network |
| title_full | Routing to minimize the maximum congestion in a communication network |
| title_fullStr | Routing to minimize the maximum congestion in a communication network |
| title_full_unstemmed | Routing to minimize the maximum congestion in a communication network |
| title_short | Routing to minimize the maximum congestion in a communication network |
| title_sort | routing to minimize the maximum congestion in a communication network |
| topic | Electrical Engineering and Computer Science Computer networks Algorithms Linear programming Information theory |
| url | http://hdl.handle.net/1721.1/16020 |
| work_keys_str_mv | AT rosperanfranciscodeasis routingtominimizethemaximumcongestioninacommunicationnetwork |