Sciweavers

625 search results - page 66 / 125
» Semi-preemptive routing on trees
Sort
View
98
Voted
INFOCOM
2008
IEEE
15 years 7 months ago
Minimum Cost Data Aggregation with Localized Processing for Statistical Inference
—The problem of minimum cost in-network fusion of measurements, collected from distributed sensors via multihop routing is considered. A designated fusion center performs an opti...
Animashree Anandkumar, Lang Tong, Ananthram Swami,...
ADHOC
2006
155views more  ADHOC 2006»
15 years 18 days ago
Application versus network layer multicasting in ad hoc networks: the ALMA routing protocol
Application layer multicasting has emerged as an appealing alternative to network layer multicasting in wireline networks. Here, we examine the suitability of application layer mu...
Min Ge, Srikanth V. Krishnamurthy, Michalis Falout...
NGC
2000
Springer
15 years 4 months ago
The use of hop-limits to provide survivable ATM group communications
We examine the use of a hop-limit constraint with techniques to provide survivability for connection-oriented ATM group communications. A hop-limit constraint is an approach that ...
William Yurcik, David Tipper, Deep Medhi
VLDB
2005
ACM
226views Database» more  VLDB 2005»
15 years 6 months ago
BATON: A Balanced Tree Structure for Peer-to-Peer Networks
We propose a balanced tree structure overlay on a peer-to-peer network capable of supporting both exact queries and range queries efficiently. In spite of the tree structure caus...
H. V. Jagadish, Beng Chin Ooi, Quang Hieu Vu
ISCC
2002
IEEE
15 years 5 months ago
A new approach to construct multicast trees in MPLS networks
In this paper1 , we present a new approach to construct multicast trees in MPLS networks. This approach utilizes MPLS LSPs between multicast tree branching node routers in order to...
Ali Boudani, Bernard Cousin