552 search results - page 17 / 111 » Routing complexity of faulty networks |
98
Voted
ITNG
2007
IEEE
15 years 3 months ago
2007
IEEE
In this paper, we present several enhanced network techniques which are appropriate for VLSI implementation and have reduced complexity, high throughput, and simple routing algori...
ICECCS
1997
IEEE
15 years 1 months ago
1997
IEEE
Design of practical routing protocols is complex and dificult due to complicated requirements of faulttolerance and flexibility. The protocol is defined to be fault-tolerant if me...
90
Voted
NOMS
2010
IEEE
14 years 7 months ago
2010
IEEE
As IP telephony becomes a critical part of the enterprise network infrastructure, there is an increasing need for tools to help manage VoIP systems. In this paper, we introduce DA ...
ISCA
2009
IEEE
15 years 4 months ago
2009
IEEE
Buffers in on-chip networks consume significant energy, occupy chip area, and increase design complexity. In this paper, we make a case for a new approach to designing on-chip in...
WDAG
2005
Springer
15 years 2 months ago
2005
Springer
We study greedy routing over n nodes placed in a ring, with the distance between two nodes defined to be the clockwise or the absolute distance between them along the ring. Such ...