Fast scheduling for optical flow switching
Optical Flow Switching (OFS) is a promising architecture to provide end users with large transactions with cost-effective direct access to core network bandwidth. For very dynamic sessions that are bursty and only last a short time (~1S), the network management and control effort can be substantial,...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
Institute of Electrical and Electronics Engineers (IEEE)
2012
|
| Online Access: | http://hdl.handle.net/1721.1/71913 https://orcid.org/0000-0002-8274-6636 https://orcid.org/0000-0002-9646-2802 |
| _version_ | 1826197130465771520 |
|---|---|
| author | Zhang, Lei Chan, Vincent W. S. |
| 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 Zhang, Lei Chan, Vincent W. S. |
| author_sort | Zhang, Lei |
| collection | MIT |
| description | Optical Flow Switching (OFS) is a promising architecture to provide end users with large transactions with cost-effective direct access to core network bandwidth. For very dynamic sessions that are bursty and only last a short time (~1S), the network management and control effort can be substantial, even unimplementable, if fast service of the order of one round trip time is needed. In this paper, we propose a fast scheduling algorithm that enables OFS to set up end-to-end connections for users with urgent large transactions with a delay of slightly more than one round-trip time. This fast setup of connections is achieved by probing independent paths between source and destination, with information about network regions periodically updated in the form of entropy. We use a modified Bellman-Ford algorithm to select the route with the least blocking probability. By grouping details of network states into an average entropy, we can greatly reduce the amount of network state information gathered and disseminated, and thus reduce the network management and control burden to a manageable amount; we can also avoid having to make detailed assumptions about the statistical model of the traffic. |
| first_indexed | 2024-09-23T10:43:18Z |
| format | Article |
| id | mit-1721.1/71913 |
| institution | Massachusetts Institute of Technology |
| language | en_US |
| last_indexed | 2024-09-23T10:43:18Z |
| publishDate | 2012 |
| publisher | Institute of Electrical and Electronics Engineers (IEEE) |
| record_format | dspace |
| spelling | mit-1721.1/719132022-09-27T14:28:53Z Fast scheduling for optical flow switching Zhang, Lei Chan, Vincent W. S. Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Chan, Vincent W. S. Zhang, Lei Chan, Vincent W. S. Optical Flow Switching (OFS) is a promising architecture to provide end users with large transactions with cost-effective direct access to core network bandwidth. For very dynamic sessions that are bursty and only last a short time (~1S), the network management and control effort can be substantial, even unimplementable, if fast service of the order of one round trip time is needed. In this paper, we propose a fast scheduling algorithm that enables OFS to set up end-to-end connections for users with urgent large transactions with a delay of slightly more than one round-trip time. This fast setup of connections is achieved by probing independent paths between source and destination, with information about network regions periodically updated in the form of entropy. We use a modified Bellman-Ford algorithm to select the route with the least blocking probability. By grouping details of network states into an average entropy, we can greatly reduce the amount of network state information gathered and disseminated, and thus reduce the network management and control burden to a manageable amount; we can also avoid having to make detailed assumptions about the statistical model of the traffic. 2012-07-31T15:22:18Z 2012-07-31T15:22:18Z 2010-12 Article http://purl.org/eprint/type/ConferencePaper 978-1-4244-5637-6 978-1-4244-5636-9 1930-529X http://hdl.handle.net/1721.1/71913 Zhang, Lei, and Vincent Chan. “Fast Scheduling of Optical Flow Switching.” IEEE, 2010. 1–6. © Copyright 2010 IEEE https://orcid.org/0000-0002-8274-6636 https://orcid.org/0000-0002-9646-2802 en_US http://dx.doi.org/10.1109/GLOCOM.2010.5683194 2010 IEEE Global Telecommunications Conference 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) IEEE |
| spellingShingle | Zhang, Lei Chan, Vincent W. S. Fast scheduling for optical flow switching |
| title | Fast scheduling for optical flow switching |
| title_full | Fast scheduling for optical flow switching |
| title_fullStr | Fast scheduling for optical flow switching |
| title_full_unstemmed | Fast scheduling for optical flow switching |
| title_short | Fast scheduling for optical flow switching |
| title_sort | fast scheduling for optical flow switching |
| url | http://hdl.handle.net/1721.1/71913 https://orcid.org/0000-0002-8274-6636 https://orcid.org/0000-0002-9646-2802 |
| work_keys_str_mv | AT zhanglei fastschedulingforopticalflowswitching AT chanvincentws fastschedulingforopticalflowswitching |