Massachusetts Institute of Technology
End-to-end data reliability in optical flow switching
Abstract
dc:description.abstractEver since optical fiber was introduced in the 1970s as a communications medium, optical networking has revolutionized the telecommunications landscape. With sustained exponential increase in bandwidth demand, innovation in optical networking needs to continue to ensure cost-effective communications in the future. Optical flow switching (OFS) has been proposed for future optical networks to serve large transactions in a cost-effective manner, by means of an all-optical data plane employing end-to-end lightpaths. Due to noise added in the transmission and detection processes, the channel has non-zero probability of bit errors that may corrupt the useful data or flows transmitted. In this thesis, we focus on the end-to-end reliable data delivery part of the Transport Layer protocol and propose effective and efficient algorithms to ensure error-free end-to-end communications for OFS. We will analyze the performance of each algorithm and suggest optimal algorithm(s) to minimize the total delay. We propose four classes of OFS protocols, then compare them with the Transport Control Protocol (TCP) over Electronic Packet Switching (EPS) and indicate under what values of the parameters: file size, bit error rate (BER), propagation delay and loading factor is OFS better than EPS. This analysis can serve as important guidelines for practical protocol designs for end-to- end data transfer reliability of OFS.
Degree
thesis:*- Department dc:contributor.department
- Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.
- Grantor dc:publisher
- Massachusetts Institute of Technology
- Year dc:date.issued
- 2011
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Li, Rui, Ph. D. Massachusetts Institute of Technology
- Advisor dc:contributor.advisor
-
- Vincent W.S. Chan and John M. Chapin.
Subjects
dc:subject × 1Rights
dc:rights- Statement 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.
- Licence dc:rights.uri
- Language dc:language.iso
- eng
Identifiers
dc:identifier.*- Handle dc:identifier.uri
- http://hdl.handle.net/1721.1/68505
- OAI identifier oai:identifier
- oai:dspace.mit.edu:1721.1/68505