Sciweavers

625 search results - page 34 / 125
» Routing in Trees
Sort
View
NGC
2001
Springer
116views Communications» more  NGC 2001»
15 years 2 months ago
Scalable IP Multicast Sender Access Control for Bi-directional Trees
Bi-directional shared tree is an efficient routing scheme for interactive multicast applications with multiple sources. Given the open-group IP multicast service model, it is impor...
Ning Wang, George Pavlou
CNSR
2010
IEEE
140views Communications» more  CNSR 2010»
15 years 1 months ago
Performance Evaluation of Using a Dynamic Shortest Path Algorithm in OLSRv2
—MANET routing protocols are designed to scale up to thousands of routers with frequent changes of the topology. In preference, MANET routing protocols should also support constr...
Ulrich Herberg
MMNS
2003
102views Multimedia» more  MMNS 2003»
14 years 11 months ago
A Heuristic Algorithm for the Multi-constrained Multicast Tree
Multicasting is an important communication mechanism for implementing real-time multimedia applications, which usually require the underlying network to provide a number of quality...
Wen-Lin Yang
INDOCRYPT
2001
Springer
15 years 2 months ago
Mobile Agent Route Protection through Hash-Based Mechanisms
Abstract. One approach to secure mobile agent execution is restricting the agent route to trusted environments. A necessary condition for this approach to be practical is that the ...
Josep Domingo-Ferrer
ISCAS
1995
IEEE
70views Hardware» more  ISCAS 1995»
15 years 1 months ago
Minimum-Cost Bounded-Skew Clock Routing
In this paper, we present a new clock routing algorithm which minimizes total wirelength under any given path-length skew bound. The algorithm constructs a bounded-skew tree (BST)...
Jason Cong, Cheng-Kok Koh