Download now Free registration required
This paper considers the problem of tunneling MPLS Label Switched Paths (LSPs) over an optical network in which ?-channels (lightpaths) of a fixed capacity are the main mechanism of transport. While any set of LSPs, each LSP having an arbitrary rate, can be tunneled over a given ?-channel as long as the aggregate rate does not exceed the channel's capacity, intuition suggests that this flexibility has a limit. In other words, the authors believe that it is sufficient for the network to provide a small set of fixed service levels in terms of the LSP data rate. This paper presents an efficient dynamic programming algorithm to obtain an optimal set of service levels given (a) a fixed set of LSPs and corresponding bandwidth requests, or (b) the probability distribution of LSP bandwidth requests.
- Format: PDF
- Size: 158.3 KB