International audienceComputer networks generally operate using a single routing protocol. However, there are situations where the routing protocol has to be changed (e.g., because an update of the routing protocol is available, or because an external event has triggered a traffic with different quality of service requirements). In this paper, we show that an uncontrolled change of the routing protocol might yield to transient routing loops (even if the involved routing protocols are loop-free). We show that it is possible to achieve a loop-free change for multiple destinations using a strongly connected component approach producing successive steps, where each step contains nodes that can change the routing protocol in parallel. Our aim is...
International audienceWireless sensor networks are envisioned to support an increasing number of app...
Large networks require scalable routing. Traditionally, protocol overhead is reduced by introducing ...
The loop-free predecessor based routing algorithm (LPRA), is presented. This algorithm eliminates th...
International audienceComputer networks generally operate using a single routing protocol. However, ...
International audienceIn networks that operate during a long time, the routing protocol might have t...
International audienceIn networks that operate during a long time, the routing protocol might have t...
When using link-state protocols such as OSPF or IS-IS, forwarding loops can occur transiently when t...
Improving the robustness of today's intra-domain link-state networks is of increasing importance. Th...
With steady improvement in the reliability and performance of communication devices, routing instabi...
Abstract—Manageability and high availability are critical properties for IP networks. Unfortunately,...
Manageability and high availability are critical properties for IP networks. Unfortunately, with lin...
Distributed routing algorithms may give rise to transient loops during path recomputation, which can...
Distributed routing algorithms may give rise to transient loops during path recomputation, which can...
Routing protocols in networks may change for many reasons: detection of a particular event, planned ...
Vita.Two algorithms have been developed which provide a loop-free property for adaptive routing proc...
International audienceWireless sensor networks are envisioned to support an increasing number of app...
Large networks require scalable routing. Traditionally, protocol overhead is reduced by introducing ...
The loop-free predecessor based routing algorithm (LPRA), is presented. This algorithm eliminates th...
International audienceComputer networks generally operate using a single routing protocol. However, ...
International audienceIn networks that operate during a long time, the routing protocol might have t...
International audienceIn networks that operate during a long time, the routing protocol might have t...
When using link-state protocols such as OSPF or IS-IS, forwarding loops can occur transiently when t...
Improving the robustness of today's intra-domain link-state networks is of increasing importance. Th...
With steady improvement in the reliability and performance of communication devices, routing instabi...
Abstract—Manageability and high availability are critical properties for IP networks. Unfortunately,...
Manageability and high availability are critical properties for IP networks. Unfortunately, with lin...
Distributed routing algorithms may give rise to transient loops during path recomputation, which can...
Distributed routing algorithms may give rise to transient loops during path recomputation, which can...
Routing protocols in networks may change for many reasons: detection of a particular event, planned ...
Vita.Two algorithms have been developed which provide a loop-free property for adaptive routing proc...
International audienceWireless sensor networks are envisioned to support an increasing number of app...
Large networks require scalable routing. Traditionally, protocol overhead is reduced by introducing ...
The loop-free predecessor based routing algorithm (LPRA), is presented. This algorithm eliminates th...