We present an algorithm reducing the number of MPLS labels to N + M without increasing any link load. Our explicit N + M bound makes it easy to limit the table size requirement for a planed network, and the linearity allows for tables implemented in fast memory. For differentiated services with K traffic classes with different load constraints, our bound increases to K(N + M). Our stack-depth is only one, justifying implementations of MPLS with limited stack-depth.
In REF , an algorithm reducing the number of MPLS labels to N (number of nodes) + M (number of links) without increasing any link load is presented.
Load optimal MPLS routing with N + M labels
IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428)
IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428)
Computer Science