Editing Multiprotocol Label Switching (section)

===MPLS local protection===
{{Main|MPLS local protection}}
In the event of a network element failure when recovery mechanisms are employed at the IP layer, restoration may take several seconds which may be unacceptable for real-time applications such as [[VoIP]].<ref name="aslam">{{Citation|author=Aslam |title=NPP: A Facility Based Computation Framework for Restoration Routing Using Aggregate Link Usage Information|url=http://cat.inist.fr/?aModele=afficheN&cpsidt=16546516|version=QoS-IP 2005 : quality of service in multiservice IP network|date=2005-02-02|access-date=2006-10-27|postscript=.|display-authors=etal}}</ref><ref name="raza">{{Citation|author=Raza |title=IEEE International Conference on Communications, 2005. ICC 2005. 2005|chapter=Online routing of bandwidth guaranteed paths with local restoration using optimized aggregate usage information|volume=1|pages=201–207|version=IEEE-ICC 2005|postscript=.|display-authors=etal|doi=10.1109/ICC.2005.1494347|isbn=0-7803-8938-7|year=2005|s2cid=5659648}}</ref><ref name="LiLi">{{Citation|author=Li Li |title=Routing bandwidth guaranteed paths with local restoration in label switched networks|journal=IEEE Journal on Selected Areas in Communications|volume=23|issue=2|pages=437–449|version=IEEE Journal on Selected Areas in Communications|postscript=.|display-authors=etal|doi=10.1109/JSAC.2004.839424|year=2005|s2cid=195347236 }}</ref> In contrast, [[MPLS local protection]] meets the requirements of real-time applications with recovery times comparable to those of [[shortest path bridging]] networks or [[SONET]] rings of less than 50&nbsp;ms.<ref name="aslam"/><ref name="LiLi"/><ref name="Kodialam">{{Citation|author=Kodialam|title=Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213)|chapter=Dynamic Routing of Locally Restorable Bandwidth Guaranteed Tunnels using Aggregated Link Usage Information|volume=1|pages=376–385|version=IEEE Infocom. pp. 376–385. 2001|postscript=.|display-authors=etal|doi=10.1109/INFCOM.2001.916720|isbn=0-7803-7016-3|year=2001|s2cid=13870642}}</ref>