Add to ORKGAbstract—It is shown that a unidirectional link of a network can be used for routing only if it has an inclusive cycle, which is a path that can carry routing updates from the downstream node to the upstream node joined by the unidirectional link. A new routing algorithm for networks with unidirectional links is then presented, which incrementally disseminates linkstate information and selectively utilizes unidirectional links in networks. The new algorithm is verified to be correct and its complexity is analyzed. Simulations on a 20-node unidirectional network show that the new algorithm is more efficient than topology broadcasting. I
We present and verify the Adaptive Link-State Protocol (ALP), a new link-state routing protocol that...
Abstract—In this paper, we consider networks with multiple unicast sessions. Generally, non-linear n...
We describe and analyze a new communication-efficient routing algorithm for packet forwarding networ...
Abstract—It is shown that a unidirectional link of a network can be used for routing only if it has ...
Abstract — Unidirectional links can occur in wireless networks and mixed-media networks. However, th...
We propose a simple distance-vector protocol for routing in networks having unidirectional links. T...
We propose a simple distance-vector protocol for routing in networks having unidirectional links. Th...
W e first introduce a simple distance-vector proto-col f o r routing in networks having unidirection...
International audienceIn reactive unicast routing protocols, Route Discovery aims to include only bi...
We examine two aspects concerning the influence of unidirectional links on routing performance in mu...
This paper presents an efficient routing scheme for Multi-hop Network in the presence of unidirectio...
Theme 1 - Reseaux et systemes. Projet RodeoSIGLEAvailable from INIST (FR), Document Supply Service, ...
Link-state routing protocols, such as OSPF and IS-IS, are widely used on the Internet. In link-state...
In this paper, we consider the problem of multiple unicast sessions over a directed acyclic graph. I...
Efficient communication mechanisms are a prerequisite to exploit the performance of large parallel a...
We present and verify the Adaptive Link-State Protocol (ALP), a new link-state routing protocol that...
Abstract—In this paper, we consider networks with multiple unicast sessions. Generally, non-linear n...
We describe and analyze a new communication-efficient routing algorithm for packet forwarding networ...
Abstract—It is shown that a unidirectional link of a network can be used for routing only if it has ...
Abstract — Unidirectional links can occur in wireless networks and mixed-media networks. However, th...
We propose a simple distance-vector protocol for routing in networks having unidirectional links. T...
We propose a simple distance-vector protocol for routing in networks having unidirectional links. Th...
W e first introduce a simple distance-vector proto-col f o r routing in networks having unidirection...
International audienceIn reactive unicast routing protocols, Route Discovery aims to include only bi...
We examine two aspects concerning the influence of unidirectional links on routing performance in mu...
This paper presents an efficient routing scheme for Multi-hop Network in the presence of unidirectio...
Theme 1 - Reseaux et systemes. Projet RodeoSIGLEAvailable from INIST (FR), Document Supply Service, ...
Link-state routing protocols, such as OSPF and IS-IS, are widely used on the Internet. In link-state...
In this paper, we consider the problem of multiple unicast sessions over a directed acyclic graph. I...
Efficient communication mechanisms are a prerequisite to exploit the performance of large parallel a...
We present and verify the Adaptive Link-State Protocol (ALP), a new link-state routing protocol that...
Abstract—In this paper, we consider networks with multiple unicast sessions. Generally, non-linear n...
We describe and analyze a new communication-efficient routing algorithm for packet forwarding networ...