Optical Flow Switching with time deadlines for high-performance applications
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2009. === Includes bibliographical references (p. 83-87). === This thesis focuses on the design and analysis of scheduling approaches for Optical Flow Switching (OFS) serving high performan...
Main Author: | |
---|---|
Other Authors: | |
Format: | Others |
Language: | English |
Published: |
Massachusetts Institute of Technology
2010
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/53148 |
id |
ndltd-MIT-oai-dspace.mit.edu-1721.1-53148 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-MIT-oai-dspace.mit.edu-1721.1-531482019-05-02T15:56:40Z Optical Flow Switching with time deadlines for high-performance applications OFS with time deadlines for high-performance applications Ganguly, Anurupa (Anurupa R.) Vincent W.S. Chan. Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. Electrical Engineering and Computer Science. Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2009. Includes bibliographical references (p. 83-87). This thesis focuses on the design and analysis of scheduling approaches for Optical Flow Switching (OFS) serving high performance applications with very stringent time deadline constraints. In particular, we attempt to meet setup times only slightly longer than one roundtrip time with networks at moderate to high loading. In this work, we propose three possible scheduling mechanisms for OFS connection setup in a WDM network: (i) a simple algorithm, which awards pre-emptive priority to applications requiring time deadline performance; (ii) a multi-path probing mechanism using only coarse average loading information (i.e., no detailed network state information) but without pre-emption; and (iii) a multi-path probing mechanism using periodically updated network state information and without pre-emption. The updating scheme calls for a slow control plane, which refreshes and broadcast network states only periodically on the order of seconds or longer. Our results show that for a low blocking probability, the update interval must be a fraction of the mean service time of transactions. We conclude that this algorithm, a combination of both slow centralized and fast distributed processes, delivers an efficient and scalable control design for a high-speed transport network of the future. by Anurupa Ganguly. M.Eng. 2010-03-25T15:07:12Z 2010-03-25T15:07:12Z 2009 2009 Thesis http://hdl.handle.net/1721.1/53148 505538407 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 87 p. application/pdf Massachusetts Institute of Technology |
collection |
NDLTD |
language |
English |
format |
Others
|
sources |
NDLTD |
topic |
Electrical Engineering and Computer Science. |
spellingShingle |
Electrical Engineering and Computer Science. Ganguly, Anurupa (Anurupa R.) Optical Flow Switching with time deadlines for high-performance applications |
description |
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2009. === Includes bibliographical references (p. 83-87). === This thesis focuses on the design and analysis of scheduling approaches for Optical Flow Switching (OFS) serving high performance applications with very stringent time deadline constraints. In particular, we attempt to meet setup times only slightly longer than one roundtrip time with networks at moderate to high loading. In this work, we propose three possible scheduling mechanisms for OFS connection setup in a WDM network: (i) a simple algorithm, which awards pre-emptive priority to applications requiring time deadline performance; (ii) a multi-path probing mechanism using only coarse average loading information (i.e., no detailed network state information) but without pre-emption; and (iii) a multi-path probing mechanism using periodically updated network state information and without pre-emption. The updating scheme calls for a slow control plane, which refreshes and broadcast network states only periodically on the order of seconds or longer. Our results show that for a low blocking probability, the update interval must be a fraction of the mean service time of transactions. We conclude that this algorithm, a combination of both slow centralized and fast distributed processes, delivers an efficient and scalable control design for a high-speed transport network of the future. === by Anurupa Ganguly. === M.Eng. |
author2 |
Vincent W.S. Chan. |
author_facet |
Vincent W.S. Chan. Ganguly, Anurupa (Anurupa R.) |
author |
Ganguly, Anurupa (Anurupa R.) |
author_sort |
Ganguly, Anurupa (Anurupa R.) |
title |
Optical Flow Switching with time deadlines for high-performance applications |
title_short |
Optical Flow Switching with time deadlines for high-performance applications |
title_full |
Optical Flow Switching with time deadlines for high-performance applications |
title_fullStr |
Optical Flow Switching with time deadlines for high-performance applications |
title_full_unstemmed |
Optical Flow Switching with time deadlines for high-performance applications |
title_sort |
optical flow switching with time deadlines for high-performance applications |
publisher |
Massachusetts Institute of Technology |
publishDate |
2010 |
url |
http://hdl.handle.net/1721.1/53148 |
work_keys_str_mv |
AT gangulyanurupaanurupar opticalflowswitchingwithtimedeadlinesforhighperformanceapplications AT gangulyanurupaanurupar ofswithtimedeadlinesforhighperformanceapplications |
_version_ |
1719031915856527360 |