Sciweavers

625 search results - page 18 / 125
» Routing in Trees
Sort
View
ASPDAC
2006
ACM
143views Hardware» more  ASPDAC 2006»
15 years 3 months ago
CDCTree: novel obstacle-avoiding routing tree construction based on current driven circuit model
Abstract— Routing tree construction is a fundamental problem in modern VLSI design. In this paper we propose CDCTree, an Obstacle-Avoiding Rectilinear Steiner Minimum Tree (OARSM...
Yiyu Shi, Tong Jing, Lei He, Zhe Feng 0002, Xianlo...
COCOON
2008
Springer
14 years 11 months ago
Approximating the Generalized Capacitated Tree-Routing Problem
In this paper, we introduce the generalized capacitated tree-routing problem (GCTR), which is described as follows. Given a connected graph G = (V, E) with a sink s V and a set M...
Ehab Morsy, Hiroshi Nagamochi
CN
2007
154views more  CN 2007»
14 years 10 months ago
Disjoint multipath routing using colored trees
— Multipath routing (MPR) is an effective strategy to achieve robustness, load balancing, congestion reduction, and increased throughput in computer networks. Disjoint multipath ...
Srinivasan Ramasubramanian, Harish Krishnamoorthy,...
ICNP
1998
IEEE
15 years 2 months ago
On-Demand Multicast in Mobile Wireless Networks
In this paper we propose an "on demand" multicast routing protocol for a wireless, mobile, multihop network. The proposed scheme has two key features: (a) it is based on...
Ching-Chuan Chiang, Mario Gerla
INFOCOM
1997
IEEE
15 years 2 months ago
Performance Modelling of Reliable Multicast Transmission
Our aim is to investigate reliable transmission for multicast communication and explore its relationship to multicast routing. We derive two characterizations that enable the comp...
Jörg Nonnenmacher, Ernst Biersack