Details
| Original language | English |
|---|---|
| Pages (from-to) | 193-205 |
| Number of pages | 13 |
| Journal | Lecture Notes in Computer Science |
| Volume | 3552 |
| Publication status | Published - 2005 |
| Externally published | Yes |
| Event | 13th International Workshop on Qualityof Service - IWQoS 2005 - Passau, Germany Duration: 21 Jun 2005 → 23 Jun 2005 |
Abstract
Various elegant and powerful theories for network performance evaluation have to assume independence to be efficient. While traffic sources are often supposed to be independent, the implications of this assumption regarding flows in arbitrary networks are largely unknown. Recently, turn-prohibition was proposed to solve a related problem concerning feed-forward networks. In this paper we extend the concept of turn-prohibition to address the issue of independence of flows in general topologies. To this end we evolve an algorithm which derives a set of critical turns that provide full connectivity while conserving the independence of flows up to multiplexing points. In an iterative procedure further turns are added to improve connectivity. The developed algorithm is proven and exemplified.
ASJC Scopus subject areas
- Mathematics(all)
- Theoretical Computer Science
- Computer Science(all)
- General Computer Science
Cite this
- Standard
- Harvard
- Apa
- Vancouver
- BibTeX
- RIS
In: Lecture Notes in Computer Science, Vol. 3552, 2005, p. 193-205.
Research output: Contribution to journal › Conference article › Research › peer review
}
TY - JOUR
T1 - Preserving the Independence of Flows in General Topologies Using Turn-Prohibition
AU - Fidler, Markus
AU - Heckmann, Oliver
AU - Steinmetz, Ralf
PY - 2005
Y1 - 2005
N2 - Various elegant and powerful theories for network performance evaluation have to assume independence to be efficient. While traffic sources are often supposed to be independent, the implications of this assumption regarding flows in arbitrary networks are largely unknown. Recently, turn-prohibition was proposed to solve a related problem concerning feed-forward networks. In this paper we extend the concept of turn-prohibition to address the issue of independence of flows in general topologies. To this end we evolve an algorithm which derives a set of critical turns that provide full connectivity while conserving the independence of flows up to multiplexing points. In an iterative procedure further turns are added to improve connectivity. The developed algorithm is proven and exemplified.
AB - Various elegant and powerful theories for network performance evaluation have to assume independence to be efficient. While traffic sources are often supposed to be independent, the implications of this assumption regarding flows in arbitrary networks are largely unknown. Recently, turn-prohibition was proposed to solve a related problem concerning feed-forward networks. In this paper we extend the concept of turn-prohibition to address the issue of independence of flows in general topologies. To this end we evolve an algorithm which derives a set of critical turns that provide full connectivity while conserving the independence of flows up to multiplexing points. In an iterative procedure further turns are added to improve connectivity. The developed algorithm is proven and exemplified.
UR - http://www.scopus.com/inward/record.url?scp=26444556801&partnerID=8YFLogxK
U2 - 10.1007/11499169_16
DO - 10.1007/11499169_16
M3 - Conference article
AN - SCOPUS:26444556801
VL - 3552
SP - 193
EP - 205
JO - Lecture Notes in Computer Science
JF - Lecture Notes in Computer Science
SN - 0302-9743
T2 - 13th International Workshop on Qualityof Service - IWQoS 2005
Y2 - 21 June 2005 through 23 June 2005
ER -