Download now Free registration required
This paper proposed the idea of L-beacon to monitor links with consideration of network security. This generalizes previous studies on L = 0, 1. The author gave an exact and an approximate algorithms to solve the NP-hard L-beacon placement problem, and experimental results on real ISP networks and small-world, scale-free networks show they work well. The paper notes that a larger L can reduce the number of necessary beacons but with higher security risk. From the experiments, the author found L = 5 could efficiently reduce the number of beacons while keeping the network secure.
- Format: PDF
- Size: 115.3 KB