830 search results - page 51 / 166 » Route kernels for trees |
116
click to vote
NGC
2001
Springer
15 years 8 months ago
2001
Springer
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...
130
Voted
AINA
2008
IEEE
15 years 10 months ago
2008
IEEE
In this paper we proposed a weighted suffix tree and find out it can improve the Intrusion Detection System (IDS). We firstly focus on the analysis of computer kernel system call,...
144
click to vote
NETGAMES
2003
ACM
15 years 9 months ago
2003
ACM
In this paper, we propose a novel multicast routing algorithm that is based on application-level priorities and network characteristics: The application may specify an individual ...
139
click to vote
ANSS
2003
IEEE
15 years 9 months ago
2003
IEEE
Multicast and MPLS are two complementary technologies. Merging these two technologies where multicast trees are constructed over MPLS networks will enhance performance and present...
116
Voted
ISCAS
1995
IEEE
15 years 7 months ago
1995
IEEE
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)...