Research Article
Cost-Efficient Allocation of Additional Resources for the Service Placement Problem in Next-Generation Internet
| (1) Locate the most sensitive node using Algorithm 1 | | (2) , , , , | | (3) repeat | | (4) , | | (5) | | (6) Add into | | (7) Call LG-CT() | | (8) untile or | | (9) , | | (10) Reset and supplement recalculated into |
|