Elements of Dynamic Lightpath

Dynamic Lightpath Establishment

Establishment

• Traffic models • Topology and resource discovery, maintaining state information

– Static – traffic requests fixed, known in advance
– Incremental – traffic arrives over time, remains indefinitely • Routing
– Dynamic – traffic arrives and departs over time – Route calculation
• Dynamic lightpath establishment – Route selection
– Dynamic traffic model
– Lightpath requests may be blocked • Wavelength assignment
• Lack of resources
• Wavelength continuity constraint
• Signaling and resource reservation
• Dynamic conflicts, inaccurate state information

Topology and Resource Discovery Routing

• Static vs. adaptive
– Static
• routing independent of network state
• Type of state information • route only depends on physical toplogy
– Global vs. local information – Adaptive
• Full physical topology • routing depends on state of the network
• Partial topology • Available state information
– Amount of information on each link – Global
• Number of available wavelengths on each physical fiber link • full link-state information available
• Exact wavelengths available on each physical fiber link – Limited
– Correctness of information • information available only for specific links
• Method of distribution • limited information available for all links
– Periodic broadcast – each node broadcasts link information to all other • Centralized/source routing vs. hop-by-hop routing
nodes
– Centralized/source routing
– Probe-based – source node sends probe message along desired route to
gather information • entire route calculated by single entity
• requires knowledge of full physical topology
• Centralized vs. distributed
• e.g. link-state routing
– Centralized: single node maintains global information
– Hop-by-hop routing
– Distributed: each node maintains global or local information
• each node on path can make independent decision regarding next hop
• doesn’t require full physical topology information
• e.g. distance vector routing

Routing Approaches – Fixed

Wavelength Assignment
Route Calculation

• Prior to routing or during routing • Fixed routing – fixed route calculation/fixed route selection
– Select wavelength – Fixed route is predetermined for each source-destination pair
– Attempt to find route on that wavelength – Route depends only on physical topology (and possibly on known
traffic information)
• After routing
• Fixed-alternate path routing – fixed route calculation/adaptive
– Select route route selection
– Determine available wavelength on that route – Several fixed routes are predetermined for each source-destination
• Wavelength assignment heuristics pair
– Random, first-fit, etc. – The set of fixed routes depends only on physical topology
– Selection of route from fixed set may be adaptive and may depend
on network state information (global or limited information)
• Shortest route first
• Least congested route first
– Most free wavelengths on entire route
• Least congested with local information
– Most free wavelengths on first k hops of route

1
 Adaptive Routing Based on Local
Adaptive Routing Approaches
Information

• Link-state routing (e.g. OSPF – Open Shortest Path First) • Deflection routing
– Broadcast of link-state information (periodic or when state changes) – Each node maintains
– Full physical topology information available to all nodes • Physical topology
– Full or partial wavelength availability information available • Local link-state information
– Source node calculates full route – Available wavelengths on each outgoing link
– Use constraint-based shortest-path-first routing algorithm, e.g. • Static routing table based on physical topology
Djikstra’s algorithm – Destination, next-hop, next-hop alternative
• Distance-vector routing – Hop-by-hop routing
– Each node maintains routing table for each wavelength layer – At each node, attempt each next-hop link until one is found with an
• Destination, next-hop, distance to destination available wavelength (available on all links traversed so far),
avoiding nodes already visited
– Tables are exchanged periodically with immediate neighbors
– Doesn’t require maintenance of global link state information
– Hop-by-hop routing – each node only knows the next hop
– May result in longer routes

Source-Initiated (forward) Reservation

Signaling and Resource
(SIR)
Reservation
• Control messages reserve resources and configure OXCs • Control message sent by source along desired route (hop-by-hop)
– In-band – control messages sent along established data channels • Resources reserved as control message moves towards destination
– Out-of-band – control messages sent on a separate network from • With global state information (specific wavelengths available on
data (may use specific wavelength dedicated to control each link)
information)
– Select wavelength at source
• Reservation approaches – Reserve only selected wavelength on each link
– Parallel reservation – separate control message sent to each node
in selected route λ1 λ3
• assumes centralized or source routing
• assumes knowledge of wavelength availability on each link source A B C D destination
– Hop-by-hop reservation – single control message traverses all Reserve λ2
nodes in selected route Reserve λ2
• may have centralized/source routing or hop-by-hop routing Reserve λ2
• specific wavelength may or may not be known
ACK λ2
ACK λ2
ACK λ2

Source-Initiated (forward) Reservation Source-Initiated (forward) Reservation

(SIR) (SIR)

• Without global state information – greedy method • Without global information – Non-greedy methods
– Reserve all feasible wavelengths on each link along selected route – Select only a single wavelength at the source
• Feasible wavelength – wavelength which is available on all links • higher blocking probability
traversed by the control message so far
– Destination selects one wavelength from set of feasible wavelengths on path
• may use holding policy – if selected wavelength is not available
on a given link, wait until it becomes available
– Destination sends control message towards source to release unused
wavelengths – Partition wavelengths into groups – select one group at source and
reserve only feasible wavelengths in that set on each link in the
λ1 λ3 path
source A B C D destination
Res λ2 λ3 λ4
Res λ2 λ3 λ4

Rel λ3 Res λ2 λ4
Rel λ3 Rel λ4
Rel λ4 ACK λ2
Rel λ4 ACK λ2
ACK λ2

2
 Destination-Initiated (backward) Destination-Initiated (backward)
Reservation (DIR) Reservation (DIR)

• DIR algorithm
• Reduces time that reserved wavelength is idle
– 1) Control message sent from source to destination along route
• Does not reserve any resources • Reduces overall amount of resources reserved
• Gathers link state information along route – which wavelengths are • May have higher blocking due to conflicts
available on each link – selected wavelength may be taken by other connections prior to
– 2) Destination node selects wavelength reservation
λ1 λ3
– 3) Control message sent from destination to source along reverse route
destination
• Reserves selected wavelength on each link in route source A B C D
λ1 λ3 Available λ2λ3λ4
destination
source A B C D Available λ2λ3λ4
Available λ2λ3λ4 Available λ2λ4
Available λ2λ3λ4 vulnerable
period
Available λ2λ4
Reserve λ2
Reserve λ2
Reserve λ2 Reserve λ2
Reserve λ2
Reserve λ2

Intermediate Node Initiated

Other Signaling Methods Reservation (IIR)

• Intermediate Node Initiated Reservation (IIR)

IIR
– Run DIR along first half of path from source to intermediate node λ1, λ2, λ3 λ1, λ2, λ4
– Run SIR along second half of path from intermediate node to 1 available 2 available 3
destination
– Reserves fewer resources than SIR Reserve
– Reduces time to reserve resource compared to DIR λ1, λ2

• Label Prioritization λ1, λ

2

– Each wavelength on each link has three states erve

Res λ1
• Idle – wavelength not being used firm
C on
mλ
1
• Reserved – wavelength is used C onfir
• Tagged – wavelength not used, but has been “tagged” by a
passing DIR control message • Reservation is initiated at node 2
• Two wavelengths are reserved