Algorithmic aspects of high speed switching
Thesis (Ph.D.)--Massachusetts Institute of Technology, Dept. of Civil and Environmental Engineering, 2002.
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Language: | eng |
| Published: |
Massachusetts Institute of Technology
2005
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1721.1/8373 |
| _version_ | 1826206095704588288 |
|---|---|
| author | Mneimneh, Saadeddine S |
| author2 | Kai-Yeung Siu. |
| author_facet | Kai-Yeung Siu. Mneimneh, Saadeddine S |
| author_sort | Mneimneh, Saadeddine S |
| collection | MIT |
| description | Thesis (Ph.D.)--Massachusetts Institute of Technology, Dept. of Civil and Environmental Engineering, 2002. |
| first_indexed | 2024-09-23T13:24:01Z |
| format | Thesis |
| id | mit-1721.1/8373 |
| institution | Massachusetts Institute of Technology |
| language | eng |
| last_indexed | 2024-09-23T13:24:01Z |
| publishDate | 2005 |
| publisher | Massachusetts Institute of Technology |
| record_format | dspace |
| spelling | mit-1721.1/83732019-04-11T12:37:05Z Algorithmic aspects of high speed switching Mneimneh, Saadeddine S Kai-Yeung Siu. Massachusetts Institute of Technology. Dept. of Civil and Environmental Engineering. Massachusetts Institute of Technology. Dept. of Civil and Environmental Engineering. Civil and Environmental Engineering. Thesis (Ph.D.)--Massachusetts Institute of Technology, Dept. of Civil and Environmental Engineering, 2002. Includes bibliographical references (p. 145-148). A major drawback of the traditional output queuing technique is that it requires a switch speedup of N, where N is the size of the switch. This dependence on N makes the switch non-scalable at high speeds. Input queuing has been suggested instead. The introduction of input queuing creates the necessity for developing switching algorithms to decide which packets to keep waiting at the input, and which packets to forward across the switch. In this thesis, we address various algorithmic aspects of switching. We prove in this thesis, that many of the practical switching algorithms still require a speedup to achieve even a weak notion of throughput. We propose two switching algorithms that belong to a family to which we refer in this thesis as priority switching. These two algorithms overcome some of the disadvantages in existing priority switching algorithms, such as the excessive amount of state information that needs to be maintained. We also develop a practical algorithm that belongs to a family to which we refer in this thesis as iterative switching. This algorithm achieves high throughput in practice and offers the advantage of not requiring more than one iteration, unlike other existing iterative switching algorithms which require multiple iterations to achieve high throughput. Finally, we address the issue of using switches in parallel to accommodate for the need of speedup. We study two settings of parallel switches, one with standard packet switching, and one with flow scheduling, in which flows cannot be split across multiple switches. by Saadeddine Mneimneh. Ph.D. 2005-08-23T19:36:18Z 2005-08-23T19:36:18Z 2002 2002 Thesis http://hdl.handle.net/1721.1/8373 50556726 eng 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 148 p. 10667634 bytes 10667392 bytes application/pdf application/pdf application/pdf Massachusetts Institute of Technology |
| spellingShingle | Civil and Environmental Engineering. Mneimneh, Saadeddine S Algorithmic aspects of high speed switching |
| title | Algorithmic aspects of high speed switching |
| title_full | Algorithmic aspects of high speed switching |
| title_fullStr | Algorithmic aspects of high speed switching |
| title_full_unstemmed | Algorithmic aspects of high speed switching |
| title_short | Algorithmic aspects of high speed switching |
| title_sort | algorithmic aspects of high speed switching |
| topic | Civil and Environmental Engineering. |
| url | http://hdl.handle.net/1721.1/8373 |
| work_keys_str_mv | AT mneimnehsaadeddines algorithmicaspectsofhighspeedswitching |