survivable mapping algorithm by ring trimming (smart) for large ip-over-wdm networks

Survivable Mapping Algorithm by Ring Trimming (SMART) for large

IP-over-WDM networks

Maciej Kurant, Patrick ThiranSwiss Federal Institute of Technology -

Lausanne (EPFL), Switzerland

BroadNets 2004, October 25-29, San Jose

Survivability

How to deal with failures?

There are several methods• Protection vs restoration• WDM layer vs IP layer

We use only the IP restoration approach:(The failures are detected at the IP layer, and a new route is found dynamically.)

GL

GΦ

M

Connected Link-survivable mapping

We assume unlimited capacities of physical links.

The problem is not new…

[Sasaki00]G. H. Sasaki and C.-F. Su and D. Blight, “Simple layout algorithms to maintain network connectivity under faults,” Proceedings of the 2000 Annual Allerton Conference.

[Modiano02]E. Modiano and A. Narula-Tam, “Survivable lightpath routing: a new approach to the design of WDM-based networks,” IEEE Journal on Selected Areas in Communications, vol. 20, no. 4, 2002

[Giroire03]F. Giroire, A. Nucci, T. Taft, and C. Diot, “Increasing the Robustness of IP Backbones in the Absence of Optical Level Protection,” Proc. of IEEE INFOCOM 2003.

[Modiano03]L-W. Chen and E. Modiano, “Efficient Routing and Wavelength Assignment for Recongurable WDM Networks with Wavelength Converters,” Proc. of IEEE INFOCOM 2003.

…

[Crochat97]J. Armitage, O. Crochat and J. Y. Le Boudec, “Design of a Survivable WDM Photonic Network,” Proceedings of IEEE INFOCOM 97, April 1997.

Our solution

SMART - Survivable Mapping Algorithm by Ring Trimming

or “by Cycle Contraction”

The SMART algorithm (link-survivability example)

GL

GΦ

GL

GΦ

GL

GΦ

GCGC GC

A single node!

Iteration 1 Iteration 2 Iteration 3

a

b

cd

f

g

h

e

a

b

cd

f

g

h

e

a

b

cd

f

g

h

e

a

b

cd

f

g

h

e

f

g

h

e

d

e

d

Large scale example

Large scale example

Large scale example

Large scale example

Large scale example

Large scale example

Large scale example

Large scale example

Large scale example

SMART vs. Tabu Search (1)

• Tabu Search is widely used to solve the problem of survivability

• Our Tabu Search implementation followed the one in [Crochat97] Random (2‑node‑connected)

f-lattice (2‑node‑connected)

• Physical topology: f-lattice, f = 0…0.35

• Logical topology: random graphs of average degree 4

SMART vs. Tabu Search (2)

SMART finds a link-survivable mapping 10-30% more often than Tabu97 does.

SMART vs. Tabu Search (3)

(a) Run-times

0.001

0.01

0.1

1

10

100

1000

10000

100000

10 100 1000

N - number of vertices

Tim

e [s

]

Tabu97

SMART

O (N3.5)

O (N2.4)

11 hours

25 sec

Tabu97 run-time SMART run-time

1

10

100

1000

10000

10 100 1000

N - number of vertices

Y

(b) Y =

SMART vs. Simple Layout Algorithm (1)

• Simple Layout Algorithm [Sasaki00], similarly to SMART, breaks down the survivable mapping problem into a set of small and easy to solve subproblems – should be fast!

Random (2‑node‑connected)

f-lattice (2‑node‑connected)

• Physical topology: f-lattice, f = 0…0.35

• Logical topology: random graphs of average degree 4

SMART vs. Simple Layout Algorithm (2)

Simple Layout Algorithm is about 3 times faster than SMART.

SMART vs. Simple Layout Algorithm (3)

# of topologies mapped by SMART# of topologies mapped by Simple Layout Algorithm

1

6

11

16

21

26

31

36

41

15 25 35 45 55 65

N - number of vertices

Y

Y =

1) Single-link failures 2) Span failures3) Node failures4) Double-link failures

Applications of SMART

Double-link failures (1)

Idea:

Take 3-edge connected structures instead of cycles.

Conclusions

• SMART is 2-3 orders of magnitude faster than other heristics, and more scalable

• SMART works well with many types of failures (single link, span, node and double link)

Future work:• Formal analysis of SMART • Introduction of limited capacities of physical links

Thank you!

Double-link failures(any two links may fail)

Application 4

Double-link failures (2)

1

2

4 7

8

3 6

5

9

11

10 14

13

12

NSFNETNSFNET3EC

Random graph (3-edge-connected)

1

2

4 7

8

3 6

5

9

11

10 14

13

12

Logical topology:

Physical topology:

Double-link failures (3)

0

0.2

0.4

0.6

0.8

1

5 6 7

Average degree of the logical topology

Fra

ctio

n of

map

ped

topo

logi

es

Shortest Path

SMART

SMART - Double-link failure extension