1017 search results - page 70 / 204 » A routing algorithm for flip-chip design |
JSAC
2008
13 years 8 months ago
2008
Abstract-- In WDM all-optical networks where electrical regeneration is not available, physical impairments due to propagation in the fibers, amplifier noise, and leaks between cha...
GLVLSI
2003
IEEE
14 years 2 months ago
2003
IEEE
Octagonal Steiner Minimal Trees (OSMTs) are used in the global routing phase of pervasive octagonal VLSI layout. The OSMT problem seeks a minimal length spanning structure using e...
ICNP
2000
IEEE
14 years 1 months ago
2000
IEEE
—In this paper, we extend the load sharing framework to study how to effectively perform flow-based traffic splitting in multipath communication networks. The generalized load sh...
SODA
1998
ACM
13 years 10 months ago
1998
ACM
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
MOBIHOC
2004
ACM
14 years 8 months ago
2004
ACM
We present the Feasible Label Routing (FLR) protocol for mobile ad hoc networks, which uses path information to establish routes to destinations on demand. FLR enables loopfree in...