Sciweavers

1391 search results - page 34 / 279
» Distributed routing in networks using affinity propagation
Sort
View
SPAA
2005
ACM
15 years 11 months ago
Name independent routing for growth bounded networks
A weighted undirected network is ∆ growth-bounded if the number of nodes at distance 2r around any given node is at most ∆ times the number of nodes at distance r around the n...
Ittai Abraham, Dahlia Malkhi
ASAP
2006
IEEE
142views Hardware» more  ASAP 2006»
15 years 8 months ago
NoC Hot Spot minimization Using AntNet Dynamic Routing Algorithm
In this paper, a routing model for minimizing hot spots in the network on chip (NOC) is presented. The model makes use of AntNet routing algorithm which is based on Ant colony. Us...
Masoud Daneshtalab, Ashkan Sobhani, Ali Afzali-Kus...
SIGCOMM
2006
ACM
16 years 3 days ago
Virtual ring routing: network routing inspired by DHTs
This paper presents Virtual Ring Routing (VRR), a new network routing protocol that occupies a unique point in the design space. VRR is inspired by overlay routing algorithms in D...
Matthew Caesar, Miguel Castro, Edmund B. Nightinga...
NIPS
2007
15 years 7 months ago
Linear programming analysis of loopy belief propagation for weighted matching
Loopy belief propagation has been employed in a wide variety of applications with great empirical success, but it comes with few theoretical guarantees. In this paper we investiga...
Sujay Sanghavi, Dmitry M. Malioutov, Alan S. Wills...
AINA
2008
IEEE
16 years 19 days ago
LRTG: Scheduling Distributed Real-Time Tasks in Unreliable and Untrustworthy Systems
We consider scheduling distributed real-time tasks in unreliable (e.g., those with arbitrary node and network failures) and untrustworthy systems (e.g., those with Byzantine node ...
Kai Han, Binoy Ravindran, E. Douglas Jensen