An integrated soft handoff approach to IP fast reroute in wireless mobile networks

Cevher, Selcuk; Chen, T.; Hökelek, İbrahim; Kang, Ju-Eun; Kaul, Vikram; Lin, Yuh-Chung; Pang, Marcus; Rodoper, Mete; Samtani, Sunil; Shah, C. U.; Bowcock, Jeffrey; Rucker, G. B.; Simbol, J. L.; Staikos, Aristides

doi:10.1109/comsnets.2010.5432006

Cited by 6 publications

(2 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As depicted in Fig. 9b, the node 10 uses the node 11 as the next-hop to the destinations 0, 1,2,3,4,5,6,7,8,9,11 and 12 in blue tree while it uses the node 9 as the next-hop in red tree.…”

Section: B Mrt: Maximally Redundant Treesmentioning

confidence: 98%

“…1: VTs computed for an example physical topology currently one of the heavily investigated approaches within IETF such that there are ongoing works focusing on the IPFRR aspects of MRT [7] and integration of MRT as a fast re-route extension into link state routing protocols [6]. Multi-hop repair paths [8] [9][10] [11] and Multiple Routing Configurations (MRCs) [12] are other technologies that have been proposed in the literature to provide full coverage.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Trade-off analysis of Multi Topology Routing based IP fast reroute mechanisms

Cevher¹,

Ulutaş²,

Hökelek³

2013

2013 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)

View full text Add to dashboard Cite

To seamlessly support real-time services such as voice and video over next generation IP networks, routers must continue their forwarding tasks in case of link/node failures by limiting the service disruption time to sub-100 ms. IETF Routing Area Working Group (RTGWG) has been working on standardizing IP Fast Reroute (IPFRR) methods with a complete alternate path coverage. In this paper, a trade-off analysis of Multi Topology Routing (MTR) based IPFRR technologies targeting full coverage, namely Multiple Routing Configurations (MRC) and Maximally Redundant Trees (MRT), are presented. We implemented a comprehensive analysis tool to evaluate the performance of MRC and MRT mechanisms on various synthetic network topologies. The performance results show that MRT's alternative path lengths are not scalable with respect to the network size and density while the alternative path lengths of MRC only slightly change as the network size and density vary. We believe that this is an important scalability result providing a guidance in the selection of MTR-based IPFRR mechanism for improving the availability in ISP networks.

show abstract

“…As depicted in Fig. 9b, the node 10 uses the node 11 as the next-hop to the destinations 0, 1,2,3,4,5,6,7,8,9,11 and 12 in blue tree while it uses the node 9 as the next-hop in red tree.…”

Section: B Mrt: Maximally Redundant Treesmentioning

confidence: 98%

Section: Introductionmentioning

confidence: 99%