Abstract | ||
---|---|---|
Loop freedom is a fundamental consistency property to ensure that no packets will fall into forwarding loops during network updates. Prior work focuses on tackling the problem of single policy update. However, though some work states that rerouting of policies with overlaps is NP-hard, none of them gave a feasible solution for it. In this paper, we investigate the inherent characteristics of multi... |
Year | DOI | Venue |
---|---|---|
2018 | 10.1109/LCOMM.2018.2829484 | IEEE Communications Letters |
Keywords | Field | DocType |
Switches,Schedules,Fans,Routing,Indexes,Computers,Computer science | Computer science,Network packet,Computer network | Journal |
Volume | Issue | ISSN |
22 | 7 | 1089-7798 |
Citations | PageRank | References |
1 | 0.35 | 0 |
Authors | ||
5 |
Name | Order | Citations | PageRank |
---|---|---|---|
Jinping Yu | 1 | 1 | 2.04 |
Jingping Bi | 2 | 70 | 18.36 |
Guoqiang Zhang | 3 | 185 | 11.62 |
Xinxin Fan | 4 | 16 | 5.10 |
Zhongcheng Li | 5 | 390 | 41.99 |