Sciweavers

312 search results - page 37 / 63
» Degree Bounded Network Design with Metric Costs
Sort
View
SLIP
2006
ACM
15 years 3 months ago
The routability of multiprocessor network topologies in FPGAs
A fundamental difference between ASICs and FPGAs is that wires in ASICs are designed such that it matches the requirements of a particular design. Wire parameters such as: length...
Manuel Saldaña, Lesley Shannon, Paul Chow
INFOCOM
2008
IEEE
15 years 3 months ago
The Inframetric Model for the Internet
—A large amount of algorithms has recently been designed for the Internet under the assumption that the distance defined by the round-trip delay (RTT) is a metric. Moreover, man...
Pierre Fraigniaud, Emmanuelle Lebhar, Laurent Vien...
MFCS
2007
Springer
15 years 3 months ago
Communication in Networks with Random Dependent Faults
The aim of this paper is to study communication in networks where nodes fail in a random dependent way. In order to capture fault dependencies, we introduce the neighborhood fault...
Evangelos Kranakis, Michel Paquette, Andrzej Pelc
INFOCOM
2008
IEEE
15 years 3 months ago
Network Routing Topology Inference from End-to-End Measurements
Abstract—Inference of the routing topology and link performance from a node to a set of other nodes is an important component of network monitoring and application design. In thi...
Jian Ni, Haiyong Xie 0002, Sekhar Tatikonda, Yang ...
DEBS
2007
ACM
15 years 1 months ago
SpiderCast: a scalable interest-aware overlay for topic-based pub/sub communication
We introduce SpiderCast, a distributed protocol for constructing scalable churn-resistant overlay topologies for supporting decentralized topic-based pub/sub communication. Spider...
Gregory Chockler, Roie Melamed, Yoav Tock, Roman V...