Details
| Originalsprache | Englisch |
|---|---|
| Titel des Sammelwerks | Networking 2004 |
| Untertitel | Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Third International IFIP-TC6 Networking Conference Athens |
| Herausgeber/-innen | Nikolas Mitrou, Kimon Kontovasilis, George N. Rouskas, Ilias lliadis, Lazaros Merakos |
| Herausgeber (Verlag) | Springer Verlag |
| Seiten | 1168-1179 |
| Seitenumfang | 12 |
| ISBN (Print) | 9783540246930 |
| Publikationsstatus | Veröffentlicht - 2004 |
| Extern publiziert | Ja |
Publikationsreihe
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Band | 3042 |
| ISSN (Print) | 0302-9743 |
| ISSN (elektronisch) | 1611-3349 |
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 discuss the relevant issues for the example of the widely deployed Dijkstra algorithm. Then, we address the general case and introduce the Turnnet concept, which supports arbitrary combinations of routing algorithms with turn-prohibiting feed-forward mechanisms.
ASJC Scopus Sachgebiete
- Mathematik (insg.)
- Theoretische Informatik
- Informatik (insg.)
- Allgemeine Computerwissenschaft
Zitieren
- Standard
- Harvard
- Apa
- Vancouver
- BibTex
- RIS
Networking 2004: Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Third International IFIP-TC6 Networking Conference Athens. Hrsg. / Nikolas Mitrou; Kimon Kontovasilis; George N. Rouskas; Ilias lliadis; Lazaros Merakos. Springer Verlag, 2004. S. 1168-1179 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 3042).
Publikation: Beitrag in Buch/Bericht/Sammelwerk/Konferenzband › Beitrag in Buch/Sammelwerk › Forschung › Peer-Review
}
TY - CHAP
T1 - Routing in Turn-Prohibition Based Feed-Forward Networks
AU - Fidler, Markus
AU - Einhoff, Gerrit
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 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 discuss the relevant issues for the example of the widely deployed Dijkstra algorithm. Then, we address the general case and introduce the 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 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 discuss the relevant issues for the example of the widely deployed Dijkstra algorithm. Then, we address the general case and introduce the Turnnet concept, which supports arbitrary combinations of routing algorithms with turn-prohibiting feed-forward mechanisms.
UR - http://www.scopus.com/inward/record.url?scp=35048828774&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-24693-0_96
DO - 10.1007/978-3-540-24693-0_96
M3 - Contribution to book/anthology
AN - SCOPUS:35048828774
SN - 9783540246930
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 1168
EP - 1179
BT - Networking 2004
A2 - Mitrou, Nikolas
A2 - Kontovasilis, Kimon
A2 - Rouskas, George N.
A2 - lliadis, Ilias
A2 - Merakos, Lazaros
PB - Springer Verlag
ER -