Sciweavers

429 search results - page 29 / 86
» Group Routing without Group Routing Tables
Sort
View
IJNSEC
2006
56views more  IJNSEC 2006»
13 years 8 months ago
Traffic Filtering and Routing in Partially-Hidden Networks
Suppose that an organization O wants to do the following: to reveal only part of its network map; to filter unwanted traffic passing through its network; and to route, to the righ...
Deholo Nali, Ali Miri, Carlisle M. Adams
COMCOM
1998
106views more  COMCOM 1998»
13 years 8 months ago
Algorithms for delay-constrained low-cost multicast tree construction
With the proliferation of multimedia group applications, the construction of multicast trees satisfying Quality of Service QoS requirements is becoming a problem of prime import...
R. Sriram, Govindarasu Manimaran, C. Siva Ram Murt...
ICTAI
2008
IEEE
14 years 2 months ago
LRNPlanner: Planning Personalized and Contextualized E-Learning Routes
The aim of educational systems is to design a sequence of learning objects on a set of topics tailored to the learner’s goals and individual properties. However, some of the mai...
Eva Onaindia, Antonio Garrido, Oscar Sapena
ICPADS
2005
IEEE
14 years 2 months ago
Distributed Spanning Tree Algorithms for Large Scale Traversals
— The Distributed Spanning Tree (DST) is an overlay structure designed to be scalable. It supports the growth from small scale to large scale. The DST is a tree without bottlenec...
Sylvain Dahan
MMB
2004
Springer
14 years 1 months ago
SREM: A Novel Multicast Routing Algorithm - Comprehensive Cost Analysis
Ever-increasing attention has been drawn to source specific multicast in the Internet society. In this paper, a novel multicast scheme, called Scalable Recursive Explicit Multicast...
Yewen Cao, Khalid Al-Begain