Paper Info
Title
Modeling multi-path routing and congestion control under FIFO and fair queuing
Abstract
Multi-path routing is a valuable on-line technique to deal with unpredictable and variable traffic patters, mostly for intra-domain TE, multi-homing, wireless mesh networks, metropolitan access networks, and has been shown efficient for a large spectrum of future traffic scenarios. In this paper we analyze the performance of MIRTO, TEXCP and TRUMP, three recently proposed multi-path routing algorithms. Modeling of such algorithms is performed through fluid models, based on ordinary differential equations (ODEs). On a US-like backbone network, with and without in-network fair queuing schedulers, TEXCP and TRUMP show faster convergence times while MIRTO, that relies on simpler feedbacks, consumes less network resources.
Year
DOI
Venue
2009
10.1109/LCN.2009.5355114
Zurich
Keywords
Field
DocType
differential equations,multipath channels,queueing theory,telecommunication congestion control,telecommunication network routing,FIFO queuing,MIRTO,TEXCP,TRUMP,US-like backbone network,congestion control,fair queuing,intradomain TE,multihoming,multipath routing,ordinary differential equations,variable traffic patters
Convergence (routing),Multihoming,Multipath routing,Computer science,Computer network,Network congestion,Throughput,Wireless mesh network,Backbone network,Distributed computing,Fair queuing
Conference
ISSN
ISBN
Citations 
0742-1303
978-1-4244-4487-8
0
PageRank 
References 
Authors
0.34
5
2
Name
Order
Citations
PageRank
Luca Muscariello174347.46
Diego Perino274050.54