Sciweavers

231 search results - page 23 / 47
» Minimizing Data and Synchronization Costs in One-Way Communi...
Sort
View
INFOCOM
1997
IEEE
15 years 1 months ago
Restricted Dynamic Steiner Trees for Scalable Multicast in Datagram Networks
The paper addresses the issue of minimizing the number of nodes involved in routing over a multicast tree and in the maintenance of such a tree in a datagram network. It presents a...
Ehud Aharoni, Reuven Cohen
P2P
2010
IEEE
202views Communications» more  P2P 2010»
14 years 8 months ago
Optimizing Near Duplicate Detection for P2P Networks
—In this paper, we propose a probabilistic algorithm for detecting near duplicate text, audio, and video resources efficiently and effectively in large-scale P2P systems. To thi...
Odysseas Papapetrou, Sukriti Ramesh, Stefan Siersd...
102
Voted
GLOBECOM
2007
IEEE
15 years 1 months ago
S-OSPF: A Traffic Engineering Solution for OSPF Based Best Effort Networks
Open Shortest Path First (OSPF) is one of the most widely used intra-domain routing protocol. It is well known that OSPF protocol does not provide flexibility in terms of packet fo...
Aditya Kumar Mishra, Anirudha Sahoo
INFOCOM
2008
IEEE
15 years 3 months ago
Distributed Operator Placement and Data Caching in Large-Scale Sensor Networks
Abstract—Recent advances in computer technology and wireless communications have enabled the emergence of stream-based sensor networks. In such sensor networks, real-time data ar...
Lei Ying, Zhen Liu, Donald F. Towsley, Cathy H. Xi...
SECON
2008
IEEE
15 years 3 months ago
Practical Algorithms for Gathering Stored Correlated Data in a Network
—Many sensing systems remotely monitor/measure an environment at several sites, and then report these observations to a central site. We propose and investigate several practical...
Ramin Khalili, James F. Kurose