Thomas Kunz
Systems and Computer Engineering
8
Adaptive Algorithm, cont.
nTime complexity: O(ne)
nExample: Nodes have computational cost and size, edges have communication costs
nProxy Processor 100 times faster than client device
nWireless link capacity: 16
nInitial node: 1 (highest D)
nResult: migrate 1, 2, 4, 5 for
a benefit of 605
(93,4)
4
10
7
6
4
5
9
1
8
(35,4)
8
3
6
7
(295,8)
(3,1)
5
(144,5)
4
(169,2)
1
2
(213,10)
(47,2)