Sciweavers

625 search results - page 1 / 125
» Routing in Trees
Sort
View
INFOCOM
1997
IEEE
13 years 8 months ago
Restricted Dynamic Steiner Trees for Scalable Multicast in Datagram Networks
The paper addresses the issue of minimizing the number of nodes involved in routing over a multicast tree and in the maintenance of such a tree in a datagram network. It presents a...
Ehud Aharoni, Reuven Cohen
EUROPAR
2004
Springer
13 years 10 months ago
Near-Optimal Hot-Potato Routing on Trees
In hot-potato (deflection) routing, nodes in the network have no buffers for packets in transit, so that some conflicting packets must be deflected away from their destination...
Costas Busch, Malik Magdon-Ismail, Marios Mavronic...
ICCCN
2007
IEEE
13 years 11 months ago
Maintaining Routing Tree in IEEE 802.16 Centralized Scheduling Mesh Networks
Abstract— The IEEE 802.16 mesh mode supports two scheduling mechanisms, namely centralized scheduling and distributed scheduling. Centralized scheduling is based on a routing tre...
Yanbin Lu, Guoqing Zhang
ICDCS
1996
IEEE
13 years 8 months ago
Group Routing without Group Routing Tables
We present a group routing protocol for a network of processes. The task of the protocol is to route data messages to each member of a process group. To this end, a tree of proces...
Jorge Arturo Cobb, Mohamed G. Gouda
IPPS
2000
IEEE
13 years 9 months ago
Optimal Broadcasting in All-Port Meshes of Trees with Distance-Insensitive Routing
The mesh-of-trees topology has very attractive properties if a distance-sensitive routing, such as store-andforward, is used. How its properties compare to meshes if distance-inse...
Petr Salinger, Pavel Tvrdík