DocumentCode
2839316
Title
MFMP: Max Flow Multipath Routing Algorithm
Author
Mahlous, Ahmed Redha ; Fretwell, Rod J. ; Chaourar, Brahim
Author_Institution
Sch. of Inf., Bradford Univ., Bradford
fYear
2008
fDate
8-10 Sept. 2008
Firstpage
482
Lastpage
487
Abstract
In this paper we present a max flow multipath routing algorithm that is designed to reduce latency, provide high throughput and balance traffic load. The max flow multipath algorithm is based on a Ford-Fulkerson algorithm. It consists of determining a set of disjoint paths that are loop free with maximum flow, then splitting network traffic among those paths on a round robin fashion. Through simulation we show that our algorithm performs well than a multi shortest path.
Keywords
telecommunication network routing; telecommunication traffic; Ford-Fulkerson algorithm; MFMP; latency reduction; max flow multipath routing algorithm; network traffic; traffic load balance; Analytical models; Bandwidth; Delay; Informatics; Quality of service; Round robin; Routing; Telecommunication traffic; Throughput; Traffic control; Disjoint; Maximum flow; bandwidth; delay; multipath; shortest path; throughput.;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Modeling and Simulation, 2008. EMS '08. Second UKSIM European Symposium on
Conference_Location
Liverpool
Print_ISBN
978-0-7695-3325-4
Electronic_ISBN
978-0-7695-3325-4
Type
conf
DOI
10.1109/EMS.2008.15
Filename
4625321
Link To Document