With　the　wide　use　of　multimedia　applications,　people　improve　the　demand　of　high　speed　traffics　increasingly.　However,　when　the　network　is　congested,　single　path　route　can　not　satisfy　the　end-to-end　bandwidth　requirement,　thus　limited　bandwidth　resources　can　not　be　used　efficiently.　In　this　paper,　we　therefore　propose　a　bandwidth-guaranteed　multi-path　routing,　which　can　find　multiple　node-disjoint　paths　between　source　and　destination　and　perform　the　calculation　of　available　bandwidth　of　found　paths　by　introducing　a　method　of　calculating　path　available　bandwidth.　Meanwhile,　we　design　a　novel　metric　for　path　selection　so　that　we　select　two　parallel　paths　whose　aggregated　bandwidth　can　satisfy　the　connection　bandwidth　requirement　from　multiple　paths　found　by　the　route　discovery.　Then　we　distribute　data　packets　into　the　two　parallel　paths　for　concurrent　transmission　according　to　each　path＇s　available　bandwidth.　Simulation　results　show　our　proposed　Bandwidth-guaranteed　Multi-path　Routing　(BMR)　makes　significant　improvements　in　terms　of　the　request　success　ratio　compared　with　the　related　works.　©　2013　IEEE.