Access Network Design for Optical Flow Switching

Weichenberg, Guy; Chan, Vincent W. S.; Médard, Muriel

doi:10.1109/glocom.2007.455

Cited by 7 publications

(3 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Other examples are where optical networks are used as the transport for grid computing and cloud computing. While in previous works [25][26][27] we focused on network physical architecture and cost of providing the OFS transport mechanism, this paper addresses a specialized class of OFS service that provides very fast setup times (~ one roundtrip delay) with no queueing. In contrast to optical burst switching, there is no collision due to contention, and thus this fast service does not need back-offs and retransmissions that results in long tails in the delay distribution, unless the network is very over provisioned and way under-utilized so no collisions ever occur.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Optical Flow Switching with Time Deadlines for High-Performance Applications

Chan

Ganguly

Weichenberg

2009

GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference

Self Cite

View full text Add to dashboard Cite

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.

show abstract

Section: Introductionmentioning

confidence: 99%

“…This eliminates intermediate router processing ((including access and metrorouter processing), a key idea behind a traditional IP routing paradigm. Efficient, dynamically assigned multi-access broadcast groups can be arranged for multiple transaction durations using a particular node architecture [27].…”

Section: Introductionmentioning

confidence: 99%

Optical Flow Switching with Time Deadlines for High-Performance Applications

Chan

Ganguly

Weichenberg

2009

GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference

Self Cite

View full text Add to dashboard Cite

show abstract

“…In [1, [4][5][6][8][9][10]14,[18][19][20][21][22][23][24][25], the authors have proposed and explored a new optical transport mechanism, Optical Flow Switching (OFS), to provide end-users with direct and cost-effective access to the core network bandwidth. To efficiently use network resources and make the network management and control system scalable, service holding times of wavelength channels are required to be on the order of hundreds of milliseconds or longer.…”

Section: -10mentioning

confidence: 99%

Fast Scheduling of Optical Flow Switching

Zhang

Chan

2010

2010 IEEE Global Telecommunications Conference GLOBECOM 2010

View full text Add to dashboard Cite

Optical Flow Switching (OFS) is a key enabler of future scalable optical networks. In the past decade, the OFS architecture has been studied to build an all-optical data plane to provide an end-to-end, cost-effective data transport to users with large transactions. Flow switching provides low-cost service to high-end users by relieving the IP routers on the edge of wide area networks from large transactions. However, the scheduling process of OFS presents possible queuing delays of several transaction durations. For some special applications with urgent time deadlines, the users want to bypass the queuing and pay more to use the network as soon as possible.In this thesis, we propose a fast scheduling algorithm which utilizes a probing approach to enable OFS to set up end-to-end connections for users with urgent transactions with a delay of slightly more than one round-trip time. A central control manager is used to periodically collect from network regions their most recent entropy evolutions of the network states and broadcast this information across the whole network in the control plane. With this information, fast setups of end-to-end all-optical connections for OFS are achieved by probing independent paths between source and destination, and reserving the available light paths along the way. A modified Bellman-Ford algorithm is designed to select the paths with the least blocking probabilities. By grouping details of network states into the average entropy, we can greatly reduce the information collected and disseminated by the centralized controller, making the network management and control system scalable to large networks.Since our algorithm makes no assumptions about network models or traffic statistics, it is robust against model variations, and any future changes in network topologies and traffic patterns. The technique can also be used in heterogeneous networks, in which networks from different domains are interconnected to provide a broader coverage.

show abstract