This paper presents a topological-order based dynamic polling scheme that effectively controls the overhead on polling traffic, by creating a network topology that follows the actual routing path for network monitoring. While the existing schemes use the polled roundtrip time or line usage to change polling rate for controlling the polling overhead, they were not capable of considering the topological order on polling nodes, which result in an inaccurate reflection of the current state of the network. Therefore, the scheme presented in this paper understands the relationship among nodes through the routing paths of network nodes within a management domain, uses this to determine the polling order, and carries out a dynamic polling to minimize the overhead on polling. Also, this paper proves that the scheme is more efficient in reducing polling time and number of messages compared to the polling scheme that does not consider topological-order.
Swipe to navigate through the chapters of this book
- Topological-Order Based Dynamic Polling Scheme Using Routing Path for Network Monitoring
- Springer Berlin Heidelberg
- Sequence number
Neuer Inhalt/© ITandMEDIA