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.
An effective query processing plays an important role in the uncertain data streams. Specifically, multiple top-k queries processing on uncertain data streams obtained from large applications of several fields such as sensor network monitoring and internet traffic control requires periodic execution of queries and sharing results among them. The system that monitors uncertain events in such data streams...
Peer-to-Peer (P2P) systems have brought two serious problems for Internet Services Providers (ISPs): traffic surges and network congestion. Proxy caching for P2P traffic is an effective means of easing the burden imposed by P2P traffic on ISPs. The deployment strategy of proxy caches has a significant impact on their effect on ISPs. It has two important components: one is cache operation that is what...
To reduce monitoring cost, the number of monitors to be deployed have to be minimized and the overhead of monitoring flows on the underlying network have to be reduced. In a recent work, we demonstrated, using ILP formulations, that there is a trade-off between theses two minimization objectives. However, we have shown that the trade-off could be efficiently balanced by jointly optimizing monitor...
Algorithms for counting the occurrences of special events in the framework of partially-observed discrete-event dynamical systems (DEDS) were developed in previous work. Their performances typically become better as the sensors providing the observations become more costly or increase in number. This paper addresses the problem of finding a sensor configuration that achieves an optimal balance between...
Effective deployment of Real Time Distributed Network Intrusion Detection Systems (DNIDS) on High- speed and large-scale networks within limited budget constraints is a challenging task. In this paper we investigate algorithms aiming at optimizing the deployment of DNIDS systems. We use Group Betweenness Centrality (GBC) as an approximation of the DNIDS deployment utility. In this work we use two...
A key problem in Wireless Sensor Networks is that of scheduling sensors into sleep-sense cycles that maximize the lifetime of the network while ensuring coverage of a set of targets. This is a known NP-complete problem, due to the exponential number of possible ways to select a subset of sensors to turn on. Our earlier work had presented a unique model for this problem by introducing a lifetime dependency...
In order to maximize the network lifetime for target coverage, we propose a heuristic greedy optimum coverage algorithm (HG-OCA). In HG-OCA, we first design a network model in which power supplies of sensor nodes follow a normal distribution. Next, we analyze energy model of target coverage, educe three rules to reduce network scale, present the concept of the key target and the prior coverage of...
Service-oriented architecture (SOA) provides a flexible paradigm to dynamically compose service processes from individual services. The flexibility, on the other hand, makes it necessary to monitor and manage service behaviors at runtime for performance assurance. One solution is to deploy software monitoring agents. In this paper, we present an approach to consider agent cost at process composition...
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.