pcdn innsbruck, austria feb., 2003 optimum interval routing in k-caterpillars and maximal outer...
TRANSCRIPT
![Page 1: PCDN Innsbruck, Austria Feb., 2003 Optimum Interval Routing in k-Caterpillars and Maximal Outer Planar Networks Gur Saran Adhar Department of Computer](https://reader034.vdocument.in/reader034/viewer/2022051620/56649f225503460f94c3b26d/html5/thumbnails/1.jpg)
PCDN Innsbruck, Austria Feb., 2003
Optimum Interval Routing in k-Caterpillars and Maximal Outer Planar Networks
Gur Saran Adhar Department of Computer Science
University of North Carolina at Wilmington, USA
![Page 2: PCDN Innsbruck, Austria Feb., 2003 Optimum Interval Routing in k-Caterpillars and Maximal Outer Planar Networks Gur Saran Adhar Department of Computer](https://reader034.vdocument.in/reader034/viewer/2022051620/56649f225503460f94c3b26d/html5/thumbnails/2.jpg)
2
PCDN Innsbruck, Austria Feb., 2003
Outline of the talk
Research Contexto Message Passing Networkso Explicit vs. Implicit Routingo Interval Routing Scheme
Main Contributionso Optimal Interval Routing in
K-Caterpillars Maximal Outer Planar Nets. Open Question, References
![Page 3: PCDN Innsbruck, Austria Feb., 2003 Optimum Interval Routing in k-Caterpillars and Maximal Outer Planar Networks Gur Saran Adhar Department of Computer](https://reader034.vdocument.in/reader034/viewer/2022051620/56649f225503460f94c3b26d/html5/thumbnails/3.jpg)
3
PCDN Innsbruck, Austria Feb., 2003
Message Passing Networks
Co-operating parallel processes share computation by way of message passingo Example: MPI processes interface
provides– MPI_Send();– MPI_Recv();
Different from the shared memory multiprocessing
![Page 4: PCDN Innsbruck, Austria Feb., 2003 Optimum Interval Routing in k-Caterpillars and Maximal Outer Planar Networks Gur Saran Adhar Department of Computer](https://reader034.vdocument.in/reader034/viewer/2022051620/56649f225503460f94c3b26d/html5/thumbnails/4.jpg)
4
PCDN Innsbruck, Austria Feb., 2003
Routing Schemes
Explicit RoutingRouting Tables
Implicit RoutingLabeling nodes of
• chain, • mesh, • hypercube,• CCC, etc…
![Page 5: PCDN Innsbruck, Austria Feb., 2003 Optimum Interval Routing in k-Caterpillars and Maximal Outer Planar Networks Gur Saran Adhar Department of Computer](https://reader034.vdocument.in/reader034/viewer/2022051620/56649f225503460f94c3b26d/html5/thumbnails/5.jpg)
5
PCDN Innsbruck, Austria Feb., 2003
Compare the following two Labeling Schemes for a chain
5 2 3 1 N 4N-1
3 N-11 2 4 5 N
![Page 6: PCDN Innsbruck, Austria Feb., 2003 Optimum Interval Routing in k-Caterpillars and Maximal Outer Planar Networks Gur Saran Adhar Department of Computer](https://reader034.vdocument.in/reader034/viewer/2022051620/56649f225503460f94c3b26d/html5/thumbnails/6.jpg)
6
PCDN Innsbruck, Austria Feb., 2003
Observation:1
First labeling defines a total order on the nodes in the chain
Second labeling does not define a total order
Each node receives a unique label
![Page 7: PCDN Innsbruck, Austria Feb., 2003 Optimum Interval Routing in k-Caterpillars and Maximal Outer Planar Networks Gur Saran Adhar Department of Computer](https://reader034.vdocument.in/reader034/viewer/2022051620/56649f225503460f94c3b26d/html5/thumbnails/7.jpg)
7
PCDN Innsbruck, Austria Feb., 2003
Observation:2
A chain (one-path) is an alternating sequence of: node (a complete set of size one)
followed by an edge (a complete set of size two).
Adjacent edges share exactly one node
![Page 8: PCDN Innsbruck, Austria Feb., 2003 Optimum Interval Routing in k-Caterpillars and Maximal Outer Planar Networks Gur Saran Adhar Department of Computer](https://reader034.vdocument.in/reader034/viewer/2022051620/56649f225503460f94c3b26d/html5/thumbnails/8.jpg)
8
PCDN Innsbruck, Austria Feb., 2003
Observation:3
A chain represents an intersection relationship between INTERVALS on a real line.
A chain is a special tree and the individual INTERVALS its sub-trees
A route is essentially linking the sub-trees
3 N-11 2 4 5 N
![Page 9: PCDN Innsbruck, Austria Feb., 2003 Optimum Interval Routing in k-Caterpillars and Maximal Outer Planar Networks Gur Saran Adhar Department of Computer](https://reader034.vdocument.in/reader034/viewer/2022051620/56649f225503460f94c3b26d/html5/thumbnails/9.jpg)
9
PCDN Innsbruck, Austria Feb., 2003
Interval Routing
A type of implicit routing Introduced by Santoro
– SK:1985, The Computer Journal
Work by Van Leeuwan, Fraigniaud
– LT:1987, The Computer Journal– FG:1998, Algorithmica
Not optimal in general– PR:1991, The Computer Journal
Present Research– GSA:2003, PCDN 2003
![Page 10: PCDN Innsbruck, Austria Feb., 2003 Optimum Interval Routing in k-Caterpillars and Maximal Outer Planar Networks Gur Saran Adhar Department of Computer](https://reader034.vdocument.in/reader034/viewer/2022051620/56649f225503460f94c3b26d/html5/thumbnails/10.jpg)
10
PCDN Innsbruck, Austria Feb., 2003
Interval Routing Scheme-Main Idea
{S(i)
(i)
L(s) < j <= L(s+1)
![Page 11: PCDN Innsbruck, Austria Feb., 2003 Optimum Interval Routing in k-Caterpillars and Maximal Outer Planar Networks Gur Saran Adhar Department of Computer](https://reader034.vdocument.in/reader034/viewer/2022051620/56649f225503460f94c3b26d/html5/thumbnails/11.jpg)
11
PCDN Innsbruck, Austria Feb., 2003
Interval Routing Scheme-Main Idea
![Page 12: PCDN Innsbruck, Austria Feb., 2003 Optimum Interval Routing in k-Caterpillars and Maximal Outer Planar Networks Gur Saran Adhar Department of Computer](https://reader034.vdocument.in/reader034/viewer/2022051620/56649f225503460f94c3b26d/html5/thumbnails/12.jpg)
12
PCDN Innsbruck, Austria Feb., 2003
Recursive Definition: tree
Basis: one node is a tree Recursive Step: adding a new node
by joining to one node in the graph already constructed also results in a tree
![Page 13: PCDN Innsbruck, Austria Feb., 2003 Optimum Interval Routing in k-Caterpillars and Maximal Outer Planar Networks Gur Saran Adhar Department of Computer](https://reader034.vdocument.in/reader034/viewer/2022051620/56649f225503460f94c3b26d/html5/thumbnails/13.jpg)
13
PCDN Innsbruck, Austria Feb., 2003
Recursive Definition: K-tree
Basis: A Complete graph on k nodes is a K-tree
Recursive Step: adding a new node to every node in a complete sub-graph of order k in the graph already constructed also results in a K-tree
![Page 14: PCDN Innsbruck, Austria Feb., 2003 Optimum Interval Routing in k-Caterpillars and Maximal Outer Planar Networks Gur Saran Adhar Department of Computer](https://reader034.vdocument.in/reader034/viewer/2022051620/56649f225503460f94c3b26d/html5/thumbnails/14.jpg)
14
PCDN Innsbruck, Austria Feb., 2003
Example: 4-tree
0 0
0 0
1
2
3
4 5
6
7
8 9
10
11
*
1112
13
14
15
![Page 15: PCDN Innsbruck, Austria Feb., 2003 Optimum Interval Routing in k-Caterpillars and Maximal Outer Planar Networks Gur Saran Adhar Department of Computer](https://reader034.vdocument.in/reader034/viewer/2022051620/56649f225503460f94c3b26d/html5/thumbnails/15.jpg)
15
PCDN Innsbruck, Austria Feb., 2003
Definition: Caterpillar
A Caterpillar is a tree which results into a path when all the leaves are removed
![Page 16: PCDN Innsbruck, Austria Feb., 2003 Optimum Interval Routing in k-Caterpillars and Maximal Outer Planar Networks Gur Saran Adhar Department of Computer](https://reader034.vdocument.in/reader034/viewer/2022051620/56649f225503460f94c3b26d/html5/thumbnails/16.jpg)
16
PCDN Innsbruck, Austria Feb., 2003
Example: Caterpillar
![Page 17: PCDN Innsbruck, Austria Feb., 2003 Optimum Interval Routing in k-Caterpillars and Maximal Outer Planar Networks Gur Saran Adhar Department of Computer](https://reader034.vdocument.in/reader034/viewer/2022051620/56649f225503460f94c3b26d/html5/thumbnails/17.jpg)
17
PCDN Innsbruck, Austria Feb., 2003
Definition: K-Caterpillar
A K-Caterpillar is a k-tree which results into a k-path (an alternating sequence of k complete sub-graphs followed by (k+1)-
complete sub-graphs) when all the k-leaves (nodes with degree k) are removed
![Page 18: PCDN Innsbruck, Austria Feb., 2003 Optimum Interval Routing in k-Caterpillars and Maximal Outer Planar Networks Gur Saran Adhar Department of Computer](https://reader034.vdocument.in/reader034/viewer/2022051620/56649f225503460f94c3b26d/html5/thumbnails/18.jpg)
18
PCDN Innsbruck, Austria Feb., 2003
Example: 2-Caterpillar
1
2
3
4
56
9
A[1,2]
B[1,2]
C[1,2] D[2,3]
E[2,3] F[3,4]
G[5,8] H[7,9]
I[7,9]
J[7,8]
K[6,8]L[6,8]
1
23
4
5
6 9
78
7 8
![Page 19: PCDN Innsbruck, Austria Feb., 2003 Optimum Interval Routing in k-Caterpillars and Maximal Outer Planar Networks Gur Saran Adhar Department of Computer](https://reader034.vdocument.in/reader034/viewer/2022051620/56649f225503460f94c3b26d/html5/thumbnails/19.jpg)
19
PCDN Innsbruck, Austria Feb., 2003
![Page 20: PCDN Innsbruck, Austria Feb., 2003 Optimum Interval Routing in k-Caterpillars and Maximal Outer Planar Networks Gur Saran Adhar Department of Computer](https://reader034.vdocument.in/reader034/viewer/2022051620/56649f225503460f94c3b26d/html5/thumbnails/20.jpg)
20
PCDN Innsbruck, Austria Feb., 2003
![Page 21: PCDN Innsbruck, Austria Feb., 2003 Optimum Interval Routing in k-Caterpillars and Maximal Outer Planar Networks Gur Saran Adhar Department of Computer](https://reader034.vdocument.in/reader034/viewer/2022051620/56649f225503460f94c3b26d/html5/thumbnails/21.jpg)
21
PCDN Innsbruck, Austria Feb., 2003
Definition: Maximal Outer Planar Network (MOP)
A network is outer planar if it can be embedded on a plane so that all nodes lie on the outer face
A outer planar network is maximal outer planar which has maximum number of edges
![Page 22: PCDN Innsbruck, Austria Feb., 2003 Optimum Interval Routing in k-Caterpillars and Maximal Outer Planar Networks Gur Saran Adhar Department of Computer](https://reader034.vdocument.in/reader034/viewer/2022051620/56649f225503460f94c3b26d/html5/thumbnails/22.jpg)
22
PCDN Innsbruck, Austria Feb., 2003
Example: Maximal Outer Planar Network
![Page 23: PCDN Innsbruck, Austria Feb., 2003 Optimum Interval Routing in k-Caterpillars and Maximal Outer Planar Networks Gur Saran Adhar Department of Computer](https://reader034.vdocument.in/reader034/viewer/2022051620/56649f225503460f94c3b26d/html5/thumbnails/23.jpg)
23
PCDN Innsbruck, Austria Feb., 2003
MOP as Intersection Graph of sub-trees of a tree
R
![Page 24: PCDN Innsbruck, Austria Feb., 2003 Optimum Interval Routing in k-Caterpillars and Maximal Outer Planar Networks Gur Saran Adhar Department of Computer](https://reader034.vdocument.in/reader034/viewer/2022051620/56649f225503460f94c3b26d/html5/thumbnails/24.jpg)
24
PCDN Innsbruck, Austria Feb., 2003
Definition: Median
A node is a median if the average distance from every other node is minimized.
![Page 25: PCDN Innsbruck, Austria Feb., 2003 Optimum Interval Routing in k-Caterpillars and Maximal Outer Planar Networks Gur Saran Adhar Department of Computer](https://reader034.vdocument.in/reader034/viewer/2022051620/56649f225503460f94c3b26d/html5/thumbnails/25.jpg)
25
PCDN Innsbruck, Austria Feb., 2003
Dual of the Example Maximal Outer Planar Network
R
![Page 26: PCDN Innsbruck, Austria Feb., 2003 Optimum Interval Routing in k-Caterpillars and Maximal Outer Planar Networks Gur Saran Adhar Department of Computer](https://reader034.vdocument.in/reader034/viewer/2022051620/56649f225503460f94c3b26d/html5/thumbnails/26.jpg)
26
PCDN Innsbruck, Austria Feb., 2003
![Page 27: PCDN Innsbruck, Austria Feb., 2003 Optimum Interval Routing in k-Caterpillars and Maximal Outer Planar Networks Gur Saran Adhar Department of Computer](https://reader034.vdocument.in/reader034/viewer/2022051620/56649f225503460f94c3b26d/html5/thumbnails/27.jpg)
27
PCDN Innsbruck, Austria Feb., 2003
![Page 28: PCDN Innsbruck, Austria Feb., 2003 Optimum Interval Routing in k-Caterpillars and Maximal Outer Planar Networks Gur Saran Adhar Department of Computer](https://reader034.vdocument.in/reader034/viewer/2022051620/56649f225503460f94c3b26d/html5/thumbnails/28.jpg)
28
PCDN Innsbruck, Austria Feb., 2003
![Page 29: PCDN Innsbruck, Austria Feb., 2003 Optimum Interval Routing in k-Caterpillars and Maximal Outer Planar Networks Gur Saran Adhar Department of Computer](https://reader034.vdocument.in/reader034/viewer/2022051620/56649f225503460f94c3b26d/html5/thumbnails/29.jpg)
29
PCDN Innsbruck, Austria Feb., 2003
![Page 30: PCDN Innsbruck, Austria Feb., 2003 Optimum Interval Routing in k-Caterpillars and Maximal Outer Planar Networks Gur Saran Adhar Department of Computer](https://reader034.vdocument.in/reader034/viewer/2022051620/56649f225503460f94c3b26d/html5/thumbnails/30.jpg)
30
PCDN Innsbruck, Austria Feb., 2003
![Page 31: PCDN Innsbruck, Austria Feb., 2003 Optimum Interval Routing in k-Caterpillars and Maximal Outer Planar Networks Gur Saran Adhar Department of Computer](https://reader034.vdocument.in/reader034/viewer/2022051620/56649f225503460f94c3b26d/html5/thumbnails/31.jpg)
31
PCDN Innsbruck, Austria Feb., 2003
![Page 32: PCDN Innsbruck, Austria Feb., 2003 Optimum Interval Routing in k-Caterpillars and Maximal Outer Planar Networks Gur Saran Adhar Department of Computer](https://reader034.vdocument.in/reader034/viewer/2022051620/56649f225503460f94c3b26d/html5/thumbnails/32.jpg)
32
PCDN Innsbruck, Austria Feb., 2003
MST of Example MOP rooted at the Median
12
3 4
5
678 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24 25
26
![Page 33: PCDN Innsbruck, Austria Feb., 2003 Optimum Interval Routing in k-Caterpillars and Maximal Outer Planar Networks Gur Saran Adhar Department of Computer](https://reader034.vdocument.in/reader034/viewer/2022051620/56649f225503460f94c3b26d/html5/thumbnails/33.jpg)
33
PCDN Innsbruck, Austria Feb., 2003
![Page 34: PCDN Innsbruck, Austria Feb., 2003 Optimum Interval Routing in k-Caterpillars and Maximal Outer Planar Networks Gur Saran Adhar Department of Computer](https://reader034.vdocument.in/reader034/viewer/2022051620/56649f225503460f94c3b26d/html5/thumbnails/34.jpg)
34
PCDN Innsbruck, Austria Feb., 2003
Conclusion
New optimal algorithm for k-caterpillars and maximal outer planar networks.
![Page 35: PCDN Innsbruck, Austria Feb., 2003 Optimum Interval Routing in k-Caterpillars and Maximal Outer Planar Networks Gur Saran Adhar Department of Computer](https://reader034.vdocument.in/reader034/viewer/2022051620/56649f225503460f94c3b26d/html5/thumbnails/35.jpg)
35
PCDN Innsbruck, Austria Feb., 2003
References
[SK:1985] Labeling and Implicit Routing in Networks, Nocola Santoro and Ramez Khatib, The Computer Journal, Vol 28, No.1, 1985.
[LT:1987] Interval Routing, J. Van Leeuwen and R.B.Tan, The Computer Journal, Vol 30, No.4, 1987.
[FG:1998] Interval Routing Schemes, P. Fraigniaud and C. Gavoille, Algorithmica, (1998) 21: 155-182.
[PR:1991] Short Note on efficiency of Interval Routing, P. Ruzicka, The Computer Journal, Vol 34, No.5, 1991.
{GSA:2003] Gur Saran Adhar, PCDN’2003
![Page 36: PCDN Innsbruck, Austria Feb., 2003 Optimum Interval Routing in k-Caterpillars and Maximal Outer Planar Networks Gur Saran Adhar Department of Computer](https://reader034.vdocument.in/reader034/viewer/2022051620/56649f225503460f94c3b26d/html5/thumbnails/36.jpg)
PCDN Innsbruck, Austria Feb., 2003
Thank you