2004
DOI: 10.1007/978-3-540-24693-0_96
|View full text |Cite
|
Sign up to set email alerts
|

Routing in Turn-Prohibition Based Feed-Forward Networks

Abstract: Abstract. The application of queuing theory to communications systems often requires that the respective networks are of a feed-forward nature, that is they have to be free of cyclic dependencies. An effective way to ensure this property is to identify a certain set of critical turns and to prohibit their use. A turn is a concatenation of two adjacent, consecutive links. Unfortunately, current routing algorithms are usually not equipped to handle forbidden turns and the required extensions are nontriviaL We di… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2005
2005
2019
2019

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(3 citation statements)
references
References 13 publications
0
3
0
Order By: Relevance
“…are evaluated further. We use the turn net approach described in [50], as the original Dijkstra's algorithm cannot find least-cost paths on a turnprohibited network. The NI architecture requires a path to incorporate at least one physical channel c ∈ C R as flows cannot turn around inside an NI.…”
Section: Selecting Constrained Least-cost Pathmentioning
confidence: 99%
“…are evaluated further. We use the turn net approach described in [50], as the original Dijkstra's algorithm cannot find least-cost paths on a turnprohibited network. The NI architecture requires a path to incorporate at least one physical channel c ∈ C R as flows cannot turn around inside an NI.…”
Section: Selecting Constrained Least-cost Pathmentioning
confidence: 99%
“…The main idea is to break all the cycles in the network through the prohibition of carefully selected turns. Although routing protocols are usually not equipped to handle forbidden turns, protocols such as Turnnet [9] make it possible to transform an arbitrary network with no prohibited turns into a new one without prohibited turns, without raising the routing complexity in an unacceptable manner. This allows us to use arbitrary routing schemes.…”
Section: Introductionmentioning
confidence: 99%
“…Of course, it is necessary to take care to choose the turns that guarantee that the resulting topology will become FIFO-stable, while also preserving network connectivity. The routing of packets can be performed by using a routing protocol, such as Turnnet [45], which has been specially designed for such a type of network.…”
Section: Transforming Network Into Fifo-stablementioning
confidence: 99%