Sciweavers

552 search results - page 27 / 111
» Routing complexity of faulty networks
Sort
View
ICCD
2003
IEEE
111views Hardware» more  ICCD 2003»
14 years 5 months ago
Routed Inter-ALU Networks for ILP Scalability and Performance
Modern processors rely heavily on broadcast networks to bypass instruction results to dependent instructions in the pipeline. However, as clock rates increase, architectures get w...
Karthikeyan Sankaralingam, Vincent Ajay Singh, Ste...
SIROCCO
2003
13 years 10 months ago
Polynomial-Time Computable Backup Tables for Shortest-Path Routing
For networks employing shortest-path routing, we introduce a new recovery scheme which needs only one backup routing table. By precomputing this backup table, the network recovers...
Hiro Ito, Kazuo Iwama, Yasuo Okabe, Takuya Yoshihi...
PERCOM
2004
ACM
14 years 8 months ago
Peer-to-peer File-sharing over Mobile Ad hoc Networks
Current peer-to-peer file-sharing systems mostly work on wired networks. Mobile ad hoc network is characterized as multi-hop wireless communications between mobile devices. In thi...
Gang Ding, Bharat K. Bhargava
SPAA
2004
ACM
14 years 2 months ago
Adaptive channel queue routing on k-ary n-cubes
This paper introduces a new adaptive method, Channel Queue Routing (CQR), for load-balanced routing on k-ary n-cube interconnection networks. CQR estimates global congestion in th...
Arjun Singh, William J. Dally, Amit K. Gupta, Bria...
IPCCC
2005
IEEE
14 years 2 months ago
A key distribution scheme for double authentication in link state routing protocol
The Double Authentication (DA) scheme presented in [1] is designed to provide security against impersonation attack to link state routing protocol at a lower computational cost as...
D. Huang, A. Sinha, D. Medhi