Sciweavers

2343 search results - page 118 / 469
» The Locomotive Routing Problem
Sort
View
ICCAD
2002
IEEE
100views Hardware» more  ICCAD 2002»
14 years 3 months ago
Optimal buffered routing path constructions for single and multiple clock domain systems
Shrinking process geometries and the increasing use of IP components in SoC designs give rise to new problems in routing and buffer insertion. A particular concern is that cross-c...
Soha Hassoun, Charles J. Alpert, Meera Thiagarajan
ICCCN
1998
IEEE
14 years 2 months ago
On the Vulnerabilities and Protection of OSPF Routing Protocol
This paper analyzes both the strong points and weak points of OSPF routing protocol from security perspective. On its strong points, we abstract its features of information least ...
Feiyi Wang, Shyhtsun Felix Wu
IPPS
1998
IEEE
14 years 2 months ago
Randomized Routing and PRAM Emulation on Parallel Machines
This paper shows the power of randomization in designing e cient parallel algorithms for the problems of routing and PRAM emulation. We show that with randomization techniques opti...
David S. L. Wei
GLOBECOM
2007
IEEE
13 years 12 months ago
QoT-Aware Routing in Impairment-Constrained Optical Networks
—In this paper, we consider the problem of routing and wavelength assignment (RWA) in all-optical networks, where signals propagate in the optical domain (with no electrical rege...
Jun He, Maïté Brandt-Pearce, Yvan Poin...
CORR
2008
Springer
98views Education» more  CORR 2008»
13 years 10 months ago
Void Traversal for Guaranteed Delivery in Geometric Routing
Geometric routing algorithms like GFG (GPSR) are lightweight, scalable algorithms that can be used to route in resource-constrained ad hoc wireless networks. However, such algorith...
Mikhail Nesterenko, Adnan Vora