Optical flow switching with time deadlines for high-performance applications
This paper 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 mod...
Autori principali: | , , |
---|---|
Altri autori: | |
Natura: | Articolo |
Lingua: | en_US |
Pubblicazione: |
Institute of Electrical and Electronics Engineers
2010
|
Accesso online: | http://hdl.handle.net/1721.1/58961 https://orcid.org/0000-0002-8274-6636 |
_version_ | 1826205406727241728 |
---|---|
author | Chan, Vincent W. S. Ganguly, Anurupa R. Weichenberg, Guy Elli |
author2 | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
author_facet | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Chan, Vincent W. S. Ganguly, Anurupa R. Weichenberg, Guy Elli |
author_sort | Chan, Vincent W. S. |
collection | MIT |
description | This paper 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. This paper proposes 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. |
first_indexed | 2024-09-23T13:12:28Z |
format | Article |
id | mit-1721.1/58961 |
institution | Massachusetts Institute of Technology |
language | en_US |
last_indexed | 2024-09-23T13:12:28Z |
publishDate | 2010 |
publisher | Institute of Electrical and Electronics Engineers |
record_format | dspace |
spelling | mit-1721.1/589612022-10-01T13:45:45Z Optical flow switching with time deadlines for high-performance applications Chan, Vincent W. S. Ganguly, Anurupa R. Weichenberg, Guy Elli Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Massachusetts Institute of Technology. Research Laboratory of Electronics Chan, Vincent W. S. Chan, Vincent W. S. Ganguly, Anurupa R. Weichenberg, Guy Elli This paper 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. This paper proposes 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. 2010-10-08T14:01:04Z 2010-10-08T14:01:04Z 2010-03 2009-11 Article http://purl.org/eprint/type/JournalArticle 978-1-4244-4148-8 1930-529X INSPEC Accession Number: 11170490 http://hdl.handle.net/1721.1/58961 Chan, V.W.S., A.R. Ganguly, and G. Weichenberg. “Optical Flow Switching with Time Deadlines for High-Performance Applications.” Global Telecommunications Conference, 2009. GLOBECOM 2009. IEEE. 2009. 1-8. ©2010 Institute of Electrical and Electronics Engineers. https://orcid.org/0000-0002-8274-6636 en_US http://dx.doi.org/10.1109/GLOCOM.2009.5426119 IEEE Global Telecommunications Conference, 2009. GLOBECOM 2009 Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use. application/pdf Institute of Electrical and Electronics Engineers IEEE |
spellingShingle | Chan, Vincent W. S. Ganguly, Anurupa R. Weichenberg, Guy Elli Optical flow switching with time deadlines for high-performance applications |
title | 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_short | Optical flow switching with time deadlines for high-performance applications |
title_sort | optical flow switching with time deadlines for high performance applications |
url | http://hdl.handle.net/1721.1/58961 https://orcid.org/0000-0002-8274-6636 |
work_keys_str_mv | AT chanvincentws opticalflowswitchingwithtimedeadlinesforhighperformanceapplications AT gangulyanurupar opticalflowswitchingwithtimedeadlinesforhighperformanceapplications AT weichenbergguyelli opticalflowswitchingwithtimedeadlinesforhighperformanceapplications |