We are upgrading the repository! A content freeze is in effect until November 22nd, 2024 - no new submissions will be accepted; however, all content already published will remain publicly available. Please reach out to repository@u.library.arizona.edu with your questions, or if you are a UA affiliate who needs to make content available soon. Note that any new user accounts created after September 22, 2024 will need to be recreated by the user in November after our migration is completed.
A NEW COMBINED ROUTING AND FLOW CONTROL ALGORITHM FOR DATA COMMUNICATION NETWORKS
| dc.contributor.author | Yamout, Salam, 1963- | |
| dc.creator | Yamout, Salam, 1963- | en_US |
| dc.date.accessioned | 2013-03-28T10:09:06Z | |
| dc.date.available | 2013-03-28T10:09:06Z | |
| dc.date.issued | 1987 | en_US |
| dc.identifier.uri | http://hdl.handle.net/10150/276558 | |
| dc.description.abstract | The object of interest in this research is the evaluation of the combined routing and flow control scheme proposed by Muralidhar and Sundareshan. A slightly modified design using results from positive system theory is proposed as an attempt to improve the performance. Then a detailed performance evaluation of Muralidhar and Sundareshan's scheme and its modified version proposed here is conducted using discrete-event simulation. The application of positive system theory to the combined routing and flow control algorithm proposed by Muralidhar and Sundareshan proved to be quite effective in improving the overall performance only in the initial transient period. The fact that the improvement is restricted to a particular time period appears to be attributable to poor buffer management and certain other fundamental problems with Muralidhar and Sundareshan's scheme. These problems are identified and are described in detail. | |
| dc.language.iso | en_US | en_US |
| dc.publisher | The University of Arizona. | en_US |
| dc.rights | Copyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author. | en_US |
| dc.subject | Data transmission systems. | en_US |
| dc.subject | Packet switching (Data transmission) | en_US |
| dc.title | A NEW COMBINED ROUTING AND FLOW CONTROL ALGORITHM FOR DATA COMMUNICATION NETWORKS | en_US |
| dc.type | text | en_US |
| dc.type | Thesis-Reproduction (electronic) | en_US |
| dc.identifier.oclc | 18792615 | en_US |
| thesis.degree.grantor | University of Arizona | en_US |
| thesis.degree.level | masters | en_US |
| dc.identifier.proquest | 1332248 | en_US |
| thesis.degree.discipline | Graduate College | en_US |
| thesis.degree.discipline | Electrical and Computer Engineering | en_US |
| thesis.degree.name | M.S. | en_US |
| dc.identifier.bibrecord | .b16640299 | en_US |
| refterms.dateFOA | 2018-06-13T09:22:22Z | |
| html.description.abstract | The object of interest in this research is the evaluation of the combined routing and flow control scheme proposed by Muralidhar and Sundareshan. A slightly modified design using results from positive system theory is proposed as an attempt to improve the performance. Then a detailed performance evaluation of Muralidhar and Sundareshan's scheme and its modified version proposed here is conducted using discrete-event simulation. The application of positive system theory to the combined routing and flow control algorithm proposed by Muralidhar and Sundareshan proved to be quite effective in improving the overall performance only in the initial transient period. The fact that the improvement is restricted to a particular time period appears to be attributable to poor buffer management and certain other fundamental problems with Muralidhar and Sundareshan's scheme. These problems are identified and are described in detail. |
