Optical Switching

Chapter 3.6.2. - Deflection Routing

3.6.2   Deflection Routing

Deflection routing resolves contentions by exploiting the space domain. If two or
more packets need to be forwarded using the same output port in order to achieve
minimum distance routing, a contention occurs; this contention is resolved by forwarding
one of the packets to the desired output fiber and the others to alternative
switch outputs. The deflected packets will possibly follow longer paths to their
destinations and thus incur high delays. In addition, the sequence of packets may
be disturbed [1].

Deflection routing can be combined with buffering in order to keep the packet
loss rate below a certain threshold. Deflection routing without the use of optical
buffers is often referred to as hot-potato routing. When no buffers are employed,
the packets do not suffer queuing delays, but more packets need to be deflected;
therefore it is highly likely that packets will follow even longer paths to their
destinations. Simple deflection methods without buffers usually introduce severe
performance penalties in throughput, latency, and latency distribution [1].

The most important advantage of deflection routing as a contention resolution
method is that it is easy to implement and does not significantly add to the
complexity of the switch in terms of hardware components or control algorithms.
The effectiveness of this technique critically depends on the network topology;
meshed topologies with a high number of interconnections greatly benefit from
deflection routing, whereas minor advantages arise from more simple topologies
[1]. Additionally, deflection routing is suitable for networks where each node has
the same number of input and output ports, because in the opposite case new
packets arriving at a node may block transit packets.

The two most important issues in a deflection routing policy are the selection of
packets that will be deflected and the respective alternative ports. Alternative links
can be precomputed based, for example, on second shortest path algorithms, or they
can be dynamically determined based on the current network state. For instance,
packets may be deflected to links that are currently underutilized in order to
balance the network load [1]. Dynamic computation of routes yields better results
but incurs a high processing and signaling overhead.

When deflection routing is implemented, a potential problem that may arise is the
introduction of routing loops. If no action is taken to prevent loops, then a packet
may return to nodes that it has already visited and may remain in the network for
an indefinite amount of time. The looping of packets contributes to increased
delays and degraded signal quality for the looping packets, as well as an increased
load for the entire network [54]. Loops can be avoided by maintaining a hop counter
(or a time-to-live field) for each deflected packet. When this counter reaches a
certain threshold, the packet is discarded. This method of loop prevention increases
the processing burden on the switch control plane. Therefore, it would be desirable if
it could be performed entirely in the optical domain [55]. According to another
approach for loop prevention, the alternative ports are selected in a manner that
eliminates the possibility of routing loops. The computation of alternative routes
that meet this requirement is not an easy task for an irregular mesh network with
an arbitrary number of nodes.

Owing to the problems that may arise, deflection routing is not the first choice
among contention resolution schemes and cannot guarantee acceptable performance
levels without wavelength conversion and/or buffering [2].

UNLIMITED FREE
ACCESS
TO THE WORLD'S BEST IDEAS

SUBMIT
Already a GlobalSpec user? Log in.

This is embarrasing...

An error occurred while processing the form. Please try again in a few minutes.

Customize Your GlobalSpec Experience

Category: Fiber Optic Cables
Finish!
Privacy Policy

This is embarrasing...

An error occurred while processing the form. Please try again in a few minutes.