Sciweavers

625 search results - page 12 / 125
» Routing in Trees
Sort
View
ICCNMC
2005
Springer
15 years 3 months ago
Hierarchical Multicast Tree Algorithms for Application Layer Mesh Networks
This paper proposes a set of novel multicast algorithms for m-D mesh overlay networks that can achieve shorter multicast delay and less resource consumptions. In contrast to previo...
Weijia Jia, Wanqing Tu, Jie Wu
MASCOTS
2004
14 years 11 months ago
Routing in an Internet-Scale Network Emulator
One of the primary challenges facing scalable network emulation and simulation is the overhead of storing network-wide routing tables or computing appropriate routes on a per-pack...
Jay Chen, Diwaker Gupta, Kashi Venkatesh Vishwanat...
COMCOM
2006
120views more  COMCOM 2006»
14 years 10 months ago
Explicit routing in multicast overlay networks
Application Level Multicast is a promising approach to overcome the deployment problems of IP level multicast by establishing delivery trees using overlay links among end systems....
Torsten Braun, Vijay Arya, Thierry Turletti
ICC
2008
IEEE
141views Communications» more  ICC 2008»
15 years 4 months ago
Greedy Hop Distance Routing Using Tree Recovery on Wireless Ad Hoc and Sensor Networks
—Connectivity-based routing protocols use the hop count vector to a group of anchors for packet forwarding. Due to the discrete nature of hop count based coordinates, without an ...
Shao Tao, Akkihebbal L. Ananda, Mun Choon Chan
ISPD
2003
ACM
117views Hardware» more  ISPD 2003»
15 years 3 months ago
Fishbone: a block-level placement and routing scheme
A block-level placement and routing scheme called Fishbone is presented. The routing uses a two-layer spine topology. The pin locations are configurable and restricted to certain ...
Fan Mo, Robert K. Brayton