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.
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...
In current publish/subscribe networks messages are not stored and only active subscribers receive published messages. However, in a dynamic scenario a user may be interested in content published before the subscription time. In this paper, we introduce a mechanism that enables storing in such networks, while maintaining the main principle of loose-coupled and asynchronous communication. Furthermore,...
In this paper, two new heuristic algorithms are developed for maximizing the network throughput in adaptive power and adaptive rate spatial-TDMA wireless networks. The underlying problem entails the optimal joint link scheduling combined with the simultaneous assignment of transmit power levels and data rates across active links. We note this problem to be NP-complete and proceed to develop and investigate...
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...
Cooperative Communication (CC) is a technology that allows multiple nodes to simultaneously transmit the same data. It can save power and extend transmission coverage. However, prior research work on topology control considers CC only in the aspect of energy saving, not that of coverage extension. We identify the challenges in the development of a centralized topology control scheme, named Cooperative...
We study how to characterize the families of paths between any two nodes s, t in a sensor network with holes. Two paths that can be deformed to one another through local changes are called homotopy equivalent. Two paths that pass around holes in different ways have different homotopy types. With a distributed algorithm we compute an embedding of the network in hyperbolic space by using Ricci flow...
When a sensor network is deployed in the field, it is typically required to support multiple simultaneous missions, which may start and finish at different times. Schemes that match sensor resources to mission demands thus become necessary. In this paper, we propose centralized and distributed schemes to assign sensors to missions. We also adapt our distributed scheme to make it energy-aware to extend...
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.