DUGiDocsA Label space reduction algorithm for P2MP LSPs using asymmetric tunnels
dc.contributor.author
dc.date.accessioned
2010-05-19T12:53:05Z
dc.date.available
2010-05-03T15:16:45Z
2010-05-19T12:53:05Z
dc.date.issued
2005
dc.identifier.citation
Solano, F., Fabregat, R., Donoso, Y., Marzo, J.L. (2005). A label space reduction algorithm for P2MP LSPs using asymmetric tunnels. 10th IEEE Symposium on Computers and Communications : 2005 : ISCC 2005 : Proceedings, 746-751. Recuperat 19 maig 2010, a http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1493808
dc.identifier.isbn
0-7695-2373-0
dc.identifier.issn
1530-1346
dc.identifier.uri
dc.description.abstract
The aim of traffic engineering is to optimise network resource utilization. Although several works on minimizing network resource utilization have been published, few works have focused on LSR label space. This paper proposes an algorithm that uses MPLS label stack features in order to reduce the number of labels used in LSPs forwarding. Some tunnelling methods and their MPLS implementation drawbacks are also discussed. The algorithm described sets up the NHLFE tables in each LSR, creating asymmetric tunnels when possible. Experimental results show that the algorithm achieves a large reduction factor in the label space. The work presented here applies for both types of connections: P2MP and P2P
dc.format.mimetype
application/pdf
dc.language.iso
eng
dc.publisher
IEEE
dc.relation.isformatof
Reproducció digital del document publicat a: http://dx.doi.org/10.1109/ISCC.2005.13
dc.relation.ispartof
© 10th IEEE Symposium on Computers and Communications : 2005 : ISCC 2005 : Proceedings, 2005, p. 746-751
dc.relation.ispartofseries
Articles publicats (D-ATC)
dc.rights
Tots els drets reservats
dc.title
A Label space reduction algorithm for P2MP LSPs using asymmetric tunnels
dc.type
info:eu-repo/semantics/article
dc.rights.accessRights
info:eu-repo/semantics/openAccess
dc.identifier.doi