Sciweavers

830 search results - page 92 / 166
» Route kernels for trees
Sort
View
ADHOC
2006
155views more  ADHOC 2006»
14 years 12 months 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 3 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 5 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 4 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
FPL
2009
Springer
99views Hardware» more  FPL 2009»
15 years 4 months ago
Exploiting fast carry-chains of FPGAs for designing compressor trees
Fast carry chains featuring dedicated adder circuitry is a distinctive feature of modern FPGAs. The carry chains bypass the general routing network and are embedded in the logic b...
Hadi Parandeh-Afshar, Philip Brisk, Paolo Ienne