Planning the Transformation of Network Topologies Young Yoon 1, Nathan Robinson 2, Vinod Muthusamy...
-
Upload
nelson-webb -
Category
Documents
-
view
212 -
download
0
Transcript of Planning the Transformation of Network Topologies Young Yoon 1, Nathan Robinson 2, Vinod Muthusamy...
![Page 1: Planning the Transformation of Network Topologies Young Yoon 1, Nathan Robinson 2, Vinod Muthusamy 3, Sheila McIlraith 2, Hans-Arno Jacobsen 2 1 Samsung.](https://reader036.fdocuments.us/reader036/viewer/2022072014/56649e8e5503460f94b91ce5/html5/thumbnails/1.jpg)
Planning the Transformation of
Network TopologiesYoung Yoon1, Nathan Robinson2, Vinod Muthusamy3,
Sheila McIlraith2, Hans-Arno Jacobsen2
1Samsung Electronics, 2University of Toronto,3IBM T.J. Watson Research Center
![Page 2: Planning the Transformation of Network Topologies Young Yoon 1, Nathan Robinson 2, Vinod Muthusamy 3, Sheila McIlraith 2, Hans-Arno Jacobsen 2 1 Samsung.](https://reader036.fdocuments.us/reader036/viewer/2022072014/56649e8e5503460f94b91ce5/html5/thumbnails/2.jpg)
The Need for Transforming a Topology
15
2
40
6 3
15
2
40
6 3
Old topology New topology
Message stream
P1
S1 S1
P1
S2
P2
S2
P2
Removable edge Goal edge
2
• Minimize the number of nodes• Optimizing path lengths or message latencies• Controlling node degrees• Provisioning sufficient network capacity
Topology Optimization Criteria• Google Pub/Sub (GooPS): Reconfigurable
messaging substrate for their public services• Yahoo! PNUTS
Large-scale data dissemination overlay network• Openflow : Supports rewiring virtual topologies
Real World Problems
![Page 3: Planning the Transformation of Network Topologies Young Yoon 1, Nathan Robinson 2, Vinod Muthusamy 3, Sheila McIlraith 2, Hans-Arno Jacobsen 2 1 Samsung.](https://reader036.fdocuments.us/reader036/viewer/2022072014/56649e8e5503460f94b91ce5/html5/thumbnails/3.jpg)
Transform “incrementally” using primitive transformation operators
k
j i
k
j i
Initial state Goal state
SHIFT(i, j, k)
r
g
Theorem: Can transform any acyclic connected graph to any other acyclic connected graph
Keeps the integrity of message delivery during the transformation
• No message loss• No message reordering• No transient loops
3
![Page 4: Planning the Transformation of Network Topologies Young Yoon 1, Nathan Robinson 2, Vinod Muthusamy 3, Sheila McIlraith 2, Hans-Arno Jacobsen 2 1 Samsung.](https://reader036.fdocuments.us/reader036/viewer/2022072014/56649e8e5503460f94b91ce5/html5/thumbnails/4.jpg)
Many Ways to Transform Incrementally
15
2
40
6 3
15
2
40
6 3
15
2
40
6 3
15
2
40
6 3
15
2
40
6 3
15
2
40
6 3
15
2
40
6 3
15
2
40
6 3
15
2
40
6 3
Start S1 S2 S3 S4 S5
S6 S7Goal
Removable edge
Goal edge
15
2
40
6 3
15
2
40
6 3
15
2
40
6 3
15
2
40
6 3
15
2
40
6 3
Start S1 S2 S3 Goal
4
![Page 5: Planning the Transformation of Network Topologies Young Yoon 1, Nathan Robinson 2, Vinod Muthusamy 3, Sheila McIlraith 2, Hans-Arno Jacobsen 2 1 Samsung.](https://reader036.fdocuments.us/reader036/viewer/2022072014/56649e8e5503460f94b91ce5/html5/thumbnails/5.jpg)
Incremental Topology Transformation (ITT) as an Automated Planning Problem
• Network topology is a connected UAG T = (V , E):– V is a set of vertices– E is a set of edges – ex (vi, vj) E , where v∈ i and vj V∈
• T = < TS, TG, O >– TS is the initial topology
– TG is the goal topology– O is a set of transformation operations
• Removable edge: e in a topology TS and not in TG
• Plan: A sequence of transformation operations that achieves TG from TS with the least cost
5
![Page 6: Planning the Transformation of Network Topologies Young Yoon 1, Nathan Robinson 2, Vinod Muthusamy 3, Sheila McIlraith 2, Hans-Arno Jacobsen 2 1 Samsung.](https://reader036.fdocuments.us/reader036/viewer/2022072014/56649e8e5503460f94b91ce5/html5/thumbnails/6.jpg)
The Key Domain Knowledge:End-to-End Path of a Goal Edge
1 5
42
3
r3
r2r1
Shift the removable edge on the end-to-end path between the nodes that constitute the goal edge.
g
6
![Page 7: Planning the Transformation of Network Topologies Young Yoon 1, Nathan Robinson 2, Vinod Muthusamy 3, Sheila McIlraith 2, Hans-Arno Jacobsen 2 1 Samsung.](https://reader036.fdocuments.us/reader036/viewer/2022072014/56649e8e5503460f94b91ce5/html5/thumbnails/7.jpg)
Breaking into Sub-Problems to Assess Disruption to Message Flows
15
2
40
6 3
7
Start Topology15
26
1
2
40
3
15
2
40
6 3
Goal Topology
Sub-problem 1
Sub-problem 2
![Page 8: Planning the Transformation of Network Topologies Young Yoon 1, Nathan Robinson 2, Vinod Muthusamy 3, Sheila McIlraith 2, Hans-Arno Jacobsen 2 1 Samsung.](https://reader036.fdocuments.us/reader036/viewer/2022072014/56649e8e5503460f94b91ce5/html5/thumbnails/8.jpg)
The Effect of Sub-problem Solving Ordering
8
15
2
40
6 3
15
2
40
6 3
Incurs11 routingstate updates
Sub-problem 1 Sub-problem 2
15
2
40
6 3
15
2
40
6 3
Incurs5 routingstate updates
Sub-problem 2 Sub-problem 1
![Page 9: Planning the Transformation of Network Topologies Young Yoon 1, Nathan Robinson 2, Vinod Muthusamy 3, Sheila McIlraith 2, Hans-Arno Jacobsen 2 1 Samsung.](https://reader036.fdocuments.us/reader036/viewer/2022072014/56649e8e5503460f94b91ce5/html5/thumbnails/9.jpg)
New Planner: Combined
• Pair goal and removable edges (to find the trajectory)
• Randomly generate k trajectory orderings• Select an ordering by routing state updates• For each trajectory, shift removable edge
incrementally– If a shift action breaks the end-to-end path of other
goal edges, • Find another end-to-end path for those goal edges• Re-compute the goal and removable edge pairing
9
![Page 10: Planning the Transformation of Network Topologies Young Yoon 1, Nathan Robinson 2, Vinod Muthusamy 3, Sheila McIlraith 2, Hans-Arno Jacobsen 2 1 Samsung.](https://reader036.fdocuments.us/reader036/viewer/2022072014/56649e8e5503460f94b91ce5/html5/thumbnails/10.jpg)
New Planner: Best First Search
• Keep an open list (OL) of states to explore• Expand the state with the least estimated cost
– Heuristics: Distance from removable edge to goal edges in terms of shift movements
• Uses restarts to promote exploration– Expand the next best state of OL, if the state
exploration limit is reached
10
![Page 11: Planning the Transformation of Network Topologies Young Yoon 1, Nathan Robinson 2, Vinod Muthusamy 3, Sheila McIlraith 2, Hans-Arno Jacobsen 2 1 Samsung.](https://reader036.fdocuments.us/reader036/viewer/2022072014/56649e8e5503460f94b91ce5/html5/thumbnails/11.jpg)
Key Evaluation Results • Parallel experiment execution on two Intel
Xeon quad-core 3 GHz• Randomly generated test problems: Nodes: 20-400, Degree of change: 10%-60%,
Maximum degree: 5, Maximum diameter: 15, Varying distributions of node degrees
11# of Plan Actions vs. Network Size Solution Time vs. Network Size
Set-up• LAMA and PROBE
30 nodes 10% change: 8 actions in 3.64s ~18.33s> 50 nodes 50% change: Failed to fined a plan
• New planning system400-node overlay, 10% change: Found a planin 0.1 seconds
State-of-the-art planners vs. ours
![Page 12: Planning the Transformation of Network Topologies Young Yoon 1, Nathan Robinson 2, Vinod Muthusamy 3, Sheila McIlraith 2, Hans-Arno Jacobsen 2 1 Samsung.](https://reader036.fdocuments.us/reader036/viewer/2022072014/56649e8e5503460f94b91ce5/html5/thumbnails/12.jpg)
Summary
• Introduced the ITT problem• Defined objective functions to quantify network disruption• Introduced the network topology planning domain• Introduced novel domain-specific planners that significantly
outperform existing planners on network• A step towards making topology optimization work practically
useful
12
Overlay Optimizer
ChangePlanner(NEW!)
“Too disruptive!”
“Try this instead”