@inproceedings {ND.5.Gomez.2004,
	title = {An Effective Fault-Tolerant Routing Methodology for Direct Networks},
	journal = {Proceedings of International Conference on Parallel Processing},
	year = {2004},
	month = {August 15-18},
	pages = {222-231},
	publisher = {IEEE Computer Society Press},
	type = {1},
	abstract = {Current massively parallel computing systems are being built with thousands of nodes, which significantly affect the probability of failure. M. E. Gomex proposed a methodology to design fault-tolerant routing algorithms for direct interconnection networks. The methodology uses a simple mechanism: for some source-destination pairs, packets are first forwarded to an intermediate node, and later, from this node to the destination node. Minimal adaptive routing is used along both subpaths. For those cases where the methodology cannot find a suitable intermediate node, it combines the use of intermediate nodes with two additional mechanisms: disabling adaptive routing and using misrouting on a per-packet basis. While the combination of these three mechanisms tolerates a large number of faults, each one requires adding some hardware support in the network and also introduces some overhead. In this paper, we perform an in-depth detailed analysis of the impact of these mechanisms on network behaviour. We analyze the impact of the three mechanisms separately and combined. The ultimate goal of this paper is to obtain a suitable combination of mechanisms that is able to meet the trade-off between fault-tolerance degree, routing complexity, and performance.},
	author = {M. E. {G{\'o}mez} and Flich, J. and Lopez, Pedro and Robles, Antonio and Duato, J. and N. A. {Nordbotten} and Lysne, Olav and Skeie, Tor}
}
@article {ND.4.Gomez.2004,
	title = {An Efficient Fault-Tolerant Routing Methodology for Meshes and Tori},
	journal = {IEEE Computer Architecture Letters},
	volume = {3},
	year = {2004},
	month = {May},
	pages = {3},
	publisher = {IEEE},
	abstract = {In this paper we present a methodology to design fault-tolerant routing algorithms for regular direct interconnection networks. It supports fully adaptive routing, does not degrade performance in the absence of faults, and supports a reasonably large number of faults without significantly degrading performance. The methodology is mainly based on the selection of an intermediate node (if needed) for each source-destination pair. Packets are adaptively routed to the intermediate node and, at this node, without being ejected, they are adaptively forwarded to their destinations. In order to allow deadlock-free minimal adaptive routing, the methodology requires only one additional virtual channel (for a total of three), even for tori. Evaluation results for a 4x4x4 torus network show that the methodology is 5-fault tolerant. Indeed, for up to 14 link failures, the percentage of fault combinations supported is higher than 99.96\%. Additionally, network throughput degrades by less than 10\% when injecting three random link faults without disabling any node. In contrast, a mechanism similar to the one proposed in the BlueGene/L, that disables some network planes, would strongly degrade network throughput by 79\%.},
	doi = {10.1109/L-CA.2004.1},
	author = {M. E. {G{\'o}mez} and Duato, J. and Flich, J. and Lopez, Pedro and Robles, Antonio and N. A. {Nordbotten} and Lysne, Olav and Skeie, Tor}
}
@inproceedings {ND.5.Nordbotten.2004,
	title = {A Fully Adaptive Fault-Tolerant Routing Methodology Based on Intermediate Nodes},
	journal = {Proceedings of IFIP International Conference on Network and Parallel Computing},
	year = {2004},
	month = {October 18-20},
	pages = {341-356},
	publisher = {Springer-Verlag},
	type = {1},
	abstract = {Massively parallel computing systems are being built with thousands of nodes. Because of the high number of components, it is critical to keep these systems running even in the presence of failures. Interconnection networks play a key-role in these systems, and this paper proposes a fault-tolerant routing methodology for use in such networks. The methodology supports any minimal routing function (including fully adaptive routing), does not degrade performance in the absence of faults, does not disable any healthy node, and is easy to implement both in meshes and tori. In order to avoid network failures, the methodology uses a simple mechanism: for some source-destination pairs, packets are forwarded to the destination node through a set of intermediate nodes (without being ejected from the network). The methodology is shown to tolerate a large number of faults (e.g., five/nine faults when using two/three intermediate nodes in a 3D torus). Furthermore, the methodology offers a gracious performance degradation: in an 8 {\texttimes} 8 {\texttimes} 8 torus network with 14 faults the throughput is only decreased by 6.49\%.},
	author = {N. A. {Nordbotten} and M. E. {G{\'o}mez} and Flich, J. and Lopez, Pedro and Robles, Antonio and Skeie, Tor and Lysne, Olav and Duato, J.}
}
@article {ND.4.Nordbotten.2004,
	title = {Methods for Service Discovery in Bluetooth Scatternets},
	journal = {Computer Communications},
	volume = {27},
	number = {11},
	year = {2004},
	pages = {1087-1096},
	publisher = {ACM},
	abstract = {This paper presents methods for service discovery in multi-hop Bluetooth ad hoc networks, so called scatternets. Two service discovery protocols based on filtering of service requests are proposed. Extensive simulation results are presented showing that the protocols significantly reduce network traffic. Reducing the network traffic is important as many Bluetooth devices have limited power sources and, therefore, benefit from keeping links idle in power saving modes. It is also explained how the proposed protocols can interact with reactive routing protocols and effectively assist route discovery. Finally, an implementation providing functionality for both searching and browsing for services is suggested, effectively extending the Bluetooth SDP to the scatternet.},
	doi = {10.1016/j.comcom.2004.01.013},
	author = {N. A. {Nordbotten} and Skeie, Tor and Niels D. {Aakvaag}}
}
@inproceedings {ND.5.Gomez.2004.b,
	title = {A New Adaptive Fault-Tolerant Routing Methodology for Direct Networks},
	journal = {Proceedings of the International Conference on High Performance Computing},
	year = {2004},
	month = {December 19-22},
	pages = {462-473},
	publisher = {Springer-Verlag},
	type = {1},
	abstract = {Interconnection networks play a key role in the fault tolerance of massively parallel computers, since faults may isolate a large fraction of the machine containing many healthy nodes. In this paper, we present a methodology to design fully adaptive fault-tolerant routing algorithms for direct interconnection networks that can be applied to different regular topologies. The methodology is mainly based on the selection of an intermediate node (if needed) for each source-destination pair. Packets are adaptively routed to the intermediate node and, from this node, they are adaptively forwarded to their destination. This methodology requires only one additional virtual channel, even for tori. Evaluation results show that the methodology is 7-fault tolerant, and for up to 14 faults, more than 99\% of the combinations are tolerated, also without significantly degrading performance in the presence of faults.},
	author = {M. E. {G{\'o}mez} and Duato, J. and Flich, J. and Lopez, Pedro and Robles, Antonio and N. A. {Nordbotten} and Skeie, Tor and Lysne, Olav}
}
@inproceedings {ND.5.Nordbotten.2003.a,
	title = {Service Discovery in Bluetooth Scatternets},
	journal = {Proc. Workshop on Mobile Ad Hoc Networking},
	year = {2003},
	month = {March 6},
	pages = {69-74},
	publisher = {Institut EURECOM},
	type = {1},
	address = {Sophia-Antipolis, France},
	abstract = {The article covers methods for service discovery in multi hop Bluetooth ad hoc networks, so called scatternets. A service discovery algorithm is presented that can be used to extend the Bluetooth Service Discovery Protocol to the scatternet without the use of broadcast messages. Extensive simulation results are presented showing that significant reductions in the number of messages sent are achieved compared to using a broadcast approach. Avoiding network flooding and reducing the number of messages is important as many Bluetooth devices have limited power sources and therefore benefit from keeping links idle in power saving modes.},
	author = {N. A. {Nordbotten} and Skeie, Tor and Niels D. {Aakvaag}}
}
@inproceedings {ND.5.Nordbotten.2003.b,
	title = {Service Discovery in Highly Dynamic Scatternets},
	journal = {Proceedings of the 3rd IEEE Workshop on Applications and Services in Wireless Networks},
	year = {2003},
	month = {July 2-4},
	pages = {211-220},
	publisher = {University of Bern},
	type = {1},
	address = {Bern, Switzerland},
	abstract = {This paper covers methods for service discovery in multi-hop Bluetooth ad hoc networks, so called scatternets. An efficient service discovery protocol suitable for highly dynamic scatternets is proposed. Extensive simulation results are presented showing that the protocol significantly reduces network traffic. Reducing the network traffic is important as many Bluetooth devices have limited power sources and therefore benefit from keeping links idle in power saving modes. Finally it is explained how the proposed protocol can interact with reactive routing protocols and effectively assist route discovery.},
	author = {N. A. {Nordbotten} and Skeie, Tor and Niels D. {Aakvaag}}
}
