Name
Abstract | ||
|---|---|---|
This paper studies how to extract and group essential nodes to guarantee loop freedom during the update of the network, while minimizing update time. We propose a model to establish the relationships of loops which may arise during the updating procedure. Given the model, we design a heuristic algorithm, with the recursive optimizing for the relationships, to extract essential nodes for the loop-free update, and shorten the updating time. The performance of our proposal has been examined and we verified that our algorithm would obviously reduce the update time. |
Year | Venue | Field |
|---|---|---|
2017 | 2017 14TH IEEE ANNUAL CONSUMER COMMUNICATIONS & NETWORKING CONFERENCE (CCNC) | Algorithm design,Heuristic (computer science),Computer science,Computer network,Software,Software-defined networking,Recursion,Distributed computing |
DocType | ISSN | Citations |
Conference | 2331-9852 | 0 |
PageRank | References | Authors |
0.34 | 1 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tao Liu | 1 | 4 | 1.15 |
| Wendong Wang | 2 | 821 | 72.69 |
| Xiangyang Gong | 3 | 161 | 23.01 |
| Xirong Que | 4 | 142 | 15.76 |
| Shiduan Cheng | 5 | 817 | 87.36 |