On accessing multiple mirror servers in parallel
| dc.contributor.author | Abdel-Hamid, Yousry Salaheldin | |
| dc.contributor.supervisor | Gulliver, T. Aaron | |
| dc.date.accessioned | 2008-08-14T17:48:14Z | |
| dc.date.available | 2008-08-14T17:48:14Z | |
| dc.date.copyright | 2003 | en_US |
| dc.date.issued | 2008-08-14T17:48:14Z | |
| dc.degree.department | Dept. of Electrical and Computer Engineering | en_US |
| dc.degree.level | Master of Applied Science M.A.Sc. | en_US |
| dc.description.abstract | In this thesis, an extensive simulation study is done to gauge the performance of parallel access to multiple mirror sites on the Internet. The study is based on the Digital Fountain approach designed by J. Byers et al. in which Tornado codes are used to minimize decoding time at the expense of injecting extra packets into the system. In this study, both Reed-Solomon and Tornado codes are considered. The results indicate that randomly permuting the packets at every mirror site is not the optimal solution. A new technique, which staggers the packets, is shown to be superior. This study employs OPNET Modeler, which is a powerful event driven simulation tool. Simulations results show that using Reed-Solomon codes with staggered packet transmission provides dramatically improved system performance. | en_US |
| dc.identifier.uri | http://hdl.handle.net/1828/1063 | |
| dc.language | English | eng |
| dc.language.iso | en | en_US |
| dc.rights | Available to the World Wide Web | en_US |
| dc.subject | Packet switching | en_US |
| dc.subject | Data transmission | en_US |
| dc.subject | Computer networks | en_US |
| dc.subject.lcsh | UVic Subject Index::Sciences and Engineering::Applied Sciences::Computer science | en_US |
| dc.subject.lcsh | UVic Subject Index::Sciences and Engineering::Engineering::Electrical engineering | en_US |
| dc.title | On accessing multiple mirror servers in parallel | en_US |
| dc.type | Thesis | en_US |