Join Our Newsletter

Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Pinyin
i2Cantonese
i2Cangjie
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

INFOCOM

2002

IEEE

2002

IEEE

Abstract— Network calculus is known to apply in general only to feedforward routing networks, i.e., networks where routes do not create cycles of interdependent packet ﬂows. In this paper, we address the problem of using network calculus in networks of arbitrary topology. For this purpose, we introduce a novel algorithm, called turn-prohibition (TP), that breaks all the cycles in a network and, thus, prevents any interdependence between ﬂows. We prove that the TP-algorithm prohibits the use of at most 1/3 of the total number turns in a network, for any network topology. Using analysis and simulation, we show that the TP-algorithm signiﬁcantly outperforms other approaches for breaking cycles, such as the spanning tree and up/down routing algorithms, in terms of network utilization and delay bounds. Our simulation results also show that the network utilization achieved with the TP-algorithm is within a factor of two of the maximum theoretical network utilization, for networks of ...

Related Content

Added |
15 Jul 2010 |

Updated |
15 Jul 2010 |

Type |
Conference |

Year |
2002 |

Where |
INFOCOM |

Authors |
David Starobinski, Mark G. Karpovsky, Lev Zakrevski |

Comments (0)