Details
| Original language | English |
|---|---|
| Pages (from-to) | 2009-2013 |
| Number of pages | 5 |
| Journal | IEEE International Conference on Communications |
| Volume | 4 |
| Publication status | Published - 2004 |
| Externally published | Yes |
| Event | 2004 IEEE International Conference on Communications - Paris, France Duration: 20 Jun 2004 → 24 Jun 2004 |
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 cycle-free. An effective way to ensure this property is to prohibit the use of a certain set of turns, where a turn is a combination of two adjacent, consecutive links. Unfortunately, current routing algorithms are usually not equipped to handle forbidden turns and the required extensions are far from being trivial. In this paper we discuss the relevant issues for the example of the widely deployed Dijkstra algorithm. Then, we address the general case and present our Turnnet concept, which supports arbitrary combinations of routing algorithms with turn-prohibiting feed-forward mechanisms.
ASJC Scopus subject areas
- Computer Science(all)
- Computer Networks and Communications
- Engineering(all)
- Electrical and Electronic Engineering
Cite this
- Standard
- Harvard
- Apa
- Vancouver
- BibTeX
- RIS
In: IEEE International Conference on Communications, Vol. 4, 2004, p. 2009-2013.
Research output: Contribution to journal › Conference article › Research › peer review
}
TY - JOUR
T1 - The Turnnet Concept
T2 - 2004 IEEE International Conference on Communications
AU - Einhoff, Gerrit
AU - Fidler, Markus
PY - 2004
Y1 - 2004
N2 - 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 cycle-free. An effective way to ensure this property is to prohibit the use of a certain set of turns, where a turn is a combination of two adjacent, consecutive links. Unfortunately, current routing algorithms are usually not equipped to handle forbidden turns and the required extensions are far from being trivial. In this paper we discuss the relevant issues for the example of the widely deployed Dijkstra algorithm. Then, we address the general case and present our Turnnet concept, which supports arbitrary combinations of routing algorithms with turn-prohibiting feed-forward mechanisms.
AB - 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 cycle-free. An effective way to ensure this property is to prohibit the use of a certain set of turns, where a turn is a combination of two adjacent, consecutive links. Unfortunately, current routing algorithms are usually not equipped to handle forbidden turns and the required extensions are far from being trivial. In this paper we discuss the relevant issues for the example of the widely deployed Dijkstra algorithm. Then, we address the general case and present our Turnnet concept, which supports arbitrary combinations of routing algorithms with turn-prohibiting feed-forward mechanisms.
UR - http://www.scopus.com/inward/record.url?scp=4143153970&partnerID=8YFLogxK
U2 - 10.1109/icc.2004.1312872
DO - 10.1109/icc.2004.1312872
M3 - Conference article
AN - SCOPUS:4143153970
VL - 4
SP - 2009
EP - 2013
JO - IEEE International Conference on Communications
JF - IEEE International Conference on Communications
SN - 0536-1486
Y2 - 20 June 2004 through 24 June 2004
ER -