Flow optimization in IP networks with fast proactive recovery

Author

Dzida, M. ; Zagozdzon, M. ; Zotkiewicz, M. ; Pioro, M.

Author_Institution

Warsaw Univ. of Technol., Warsaw

fYear

2008

fDate

Sept. 28 2008-Oct. 2 2008

Firstpage

1

Lastpage

15

Abstract

A powerpoint presentation is given. The paper discusses flow optimization in IP networks with fast proactive recovery. IP fast rerouting includes equal-cost multiple paths, loop free alternate and multihop repair path. The main purpose of the optimization model is to exhibit the efficiency of the IPFR , to develop an efficient resolution method based on iterative heuristic partitioning method by numerical experiments, and to be able to eliminate almost all( disadvantageous) MHRP paths.

Keywords

IP networks; computer network reliability; iterative methods; telecommunication network routing; IP fast rerouting; IP networks; IPFR efficiency; equal-cost multiple paths; fast proactive recovery; flow optimization; iterative heuristic partitioning method; loop free alternate; multihop repair path; Computer networks; Convergence; IP networks; Internet; Iterative methods; Pareto optimization; Routing protocols; Spread spectrum communication; Telecommunication traffic; Writing;

fLanguage

English

Publisher

ieee

Conference_Titel

Telecommunications Network Strategy and Planning Symposium, 2008. Networks 2008. The 13th International

Conference_Location

Budapest

Print_ISBN

978-963-8111-68-5

Type

conf

DOI

10.1109/NETWKS.2008.4763721

Filename

4763721