Sciweavers

85 search results - page 9 / 17
» Landmark-Based Routing in Dynamic Graphs
Sort
View
ISPD
2012
ACM
283views Hardware» more  ISPD 2012»
12 years 2 months ago
Low-power gated bus synthesis for 3d ic via rectilinear shortest-path steiner graph
In this paper, we propose a new approach for gated bus synthesis [16] with minimum wire capacitance per transaction in three-dimensional (3D) ICs. The 3D IC technology connects di...
Chung-Kuan Cheng, Peng Du, Andrew B. Kahng, Shih-H...
SIGMETRICS
2003
ACM
150views Hardware» more  SIGMETRICS 2003»
14 years 9 days ago
Conductance and congestion in power law graphs
It has been observed that the degrees of the topologies of several communication networks follow heavy tailed statistics. What is the impact of such heavy tailed statistics on the...
Christos Gkantsidis, Milena Mihail, Amin Saberi
INFOCOM
2008
IEEE
14 years 1 months ago
Area Avoidance Routing in Distance-Vector Networks
Network routing may be required, under certain applications, to avoid certain areas (or nodes) These areas can be of potential security threat, possess poor quality or have other ...
Haim Zlatokrilov, Hanoch Levy
SSS
2007
Springer
14 years 1 months ago
Stabilization of Loop-Free Redundant Routing
Consider a network of processes that exchange messages via FIFO communication channels. Each process chooses a subset of its neighboring processes to be its successors. Furthermore...
Jorge Arturo Cobb
ISPA
2004
Springer
14 years 12 days ago
Cayley DHTs - A Group-Theoretic Framework for Analyzing DHTs Based on Cayley Graphs
Static DHT topologies influence important features of such DHTs such as scalability, communication load balancing, routing efficiency and fault tolerance. Nevertheless, it is co...
Changtao Qu, Wolfgang Nejdl, Matthias Kriesell