Sciweavers

716 search results - page 107 / 144
» Tolerating Faults in Synchronization Networks
Sort
View
DAC
2006
ACM
15 years 5 months ago
Steiner network construction for timing critical nets
Conventionally, signal net routing is almost always implemented as Steiner trees. However, non-tree topology is often superior on timing performance as well as tolerance to open f...
Shiyan Hu, Qiuyang Li, Jiang Hu, Peng Li
SIROCCO
2001
15 years 3 months ago
On Finding Minimum Deadly Sets for Directed Networks
Given a set S of elements in a directed network that are initially faulty, an element becomes (functionally) faulty if all its in-neighbors or all its outneighbors are (functional...
Norbert Zeh, Nicola Santoro
ICC
2007
IEEE
15 years 8 months ago
Enhanced Dominant Pruning-based Broadcasting in Untrusted Ad-hoc Wireless Networks
Abstract—Many protocols for ad-hoc wireless networks perform poorly in situations when node cooperation cannot be enforced. This may happen because of the lack of global authorit...
Ashikur Rahman, Pawel Gburzynski, Bozena Kaminska
IPPS
2007
IEEE
15 years 8 months ago
RI2N/UDP: High bandwidth and fault-tolerant network for a PC-cluster based on multi-link Ethernet
PC-clusters with high performance/cost ratio have been one of the typical platforms for high performance computing. To lower costs, Gigabit Ethernet is often used for intercommuni...
Takayuki Okamoto, Shin'ichi Miura, Taisuke Boku, M...
MSN
2007
Springer
124views Sensor Networks» more  MSN 2007»
15 years 8 months ago
Reducing End-to-End Delay in Multi-path Routing Algorithms for Mobile Ad Hoc Networks
Some of the routing algorithms in mobile ad hoc networks use multiple paths simultaneously. These algorithms can attempt to find nodedisjoint paths to achieve higher fault toleranc...
Nastooh Taheri Javan, Mehdi Dehghan