|  |  |  |  |  |  |  |  |  |  |  |  | 
   
    | n | Time
    complexity: O(ne) 
 |  | 
   
    |  | 
   
    | n | Example:
    Nodes have 
 |  | 
   
    |  | computational
    cost and size, 
 | 
   
    |  | edges
    have communication 
 |  | 
   
    |  | costs 
 |  | 
   
    |  | 
   
    | n | Proxy
    Processor 100 times 
 |  | 
   
    |  | faster
    than client device 
 |  | 
   
    |  | 
   
    | n | Wireless
    link capacity: 16 
 |  | 
   
    |  | 
   
    | n | Initial
    node: 1 (highest D) 
 |  | 
   
    |  | 
   
    | n | Result:
    migrate 1, 2, 4, 5 
 |  | 
   
    |  | for a
    benefit of 605 
 |  |