The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Given a graph and an integer L ?? 0, the beacon placement problem (BPP) asks to find a minimum set B of nodes such that for all edges e, at least one of the two endpoints of e can be reached from some node (called an L-beacon) in B using at most L edges. In particular, it reduces to the vertex cover problem if L = 0. This problem arises from link-monitoring in computer networks. Generalizing the works...
The active beacon based network monitoring tries to estimate the transfer delay of a link e by the difference of round-trip times from a beacon host to the two endpoints of e. For efficiency, we consider the problem of placing a minimum set of beacons to monitor all links of a given TCP/IP network e.g., the Internet. We propose an idea called L-beacon, i.e., a beacon can monitor only links within...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.