Multiprotocol lambda switching: combining MPLS traffic engineering control with optical crossconnects

Awduche, D.; Rekhter, Yakov

doi:10.1109/35.910598

Cited by 214 publications

(119 citation statements)

References 5 publications

(22 reference statements)

Supporting

Mentioning

116

Contrasting

Unclassified

Order By: Relevance

“…This approach, as discussed earlier, is not feasible for dynamically setting up connections or flows for large networks. Another extreme case is to manage sub-networks as separate entities [11]. But the corresponding performance (i.e., the correctness of an assessment) can be poor due to lack of information.…”

Section: Related Workmentioning

confidence: 99%

Network management information for light-path assessment: trade-off between performance and complexity

Liu

Chan³

2003

IEEE INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37

View full text Add to dashboard Cite

Abstract--We investigate network management information for light-path assessment to dynamically set up end-to-end lightpaths across administrative domains. Our focus is on invetigating what performance can be possibly achieved given partial management information, and whether a small loss in performance can trade off with a large saving in management information.The partial information we consider includes aggregated characterization of subnetworks, and local states from wavelength converters. We cast the light-path assessment as a decision problem, and define the performance as the probability of an erroneous decision. We apply the decision theory to show that the optimal performance using the partial information is the Bayes probability of error. We derive an upper bound of the Bayes error in terms of the blocking probability. We evaluate the upper bound using both independent and dependent models of wavelength usage. Our study shows that there exits a ``threshold effect'': The Bayes error decreases exponentially to 0 with respect to the load when the load is either below or above a threshold value; and is non-negligible when the load is in a small duration around the threshold. This suggests that a small percentage of error decisions can trade off with a large saving in management information.Index terms--Partial management information, lightpath assessment, decision theory, Bayes rule, blocking probability. I. INTRODUCTIONDynamically assessing the quality of light-paths is important to many applications in wavelength-routed optical networks such as on-demand light-path provisioning, protection and restoration. As the light-path quality is a complex measure [1], this work considers a simple quality, which is the wavelength availability on a candidate light-path. The assessment then becomes determining availability of wavelengths for supporting an end-to-end call based on given management information.Complete or partial network management information can be used to assess the wavelength availability on a light-path. Complete information corresponds to the detailed states of wavelength usage, i.e. "which wavelengths are used at which links of a network'', when there is no wavelengths converters in the network. Wavelength converters can reduce state information due to their ability to relax the wavelength continuity constraint. However, it is expected that wavelength converters remain expensive and are thus used mostly on the boundaries of sub-networks [2]. Therefore, generally complete state information involves the detailed wavelength occupancy within a subnet. Partial information includes aggregated load and topology information at each subnet, and local states, e.g., the total number of wavelengths used at wavelength converters.Providing state information is a basic functionality of network management. Traditional network management systems intend to obtain as complete state information as possible [3]. But future IP-WDM networks may have hundreds of links with each link supporting hundreds of wavelengths [...

show abstract

Section: Related Workmentioning

confidence: 99%

Network management information for light-path assessment: trade-off between performance and complexity

Liu

Chan³

2003

IEEE INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37

View full text Add to dashboard Cite

show abstract

“…In each of the control models, the establishment of lightpaths in the optical network may be performed through a multi-protocol lambda switching (MPλS) control framework [22,23], which is a variation of the multi-protocol label switching (MPLS) framework.…”

Section: Ip Over Wdm Control and Managementmentioning

confidence: 99%

Dynamic lightpath establishment in wavelength routed WDM networks

et al. 2001

View full text Add to dashboard Cite

“…Here a wavelength can be thought of as the outermost (non-stackable) label in the MPLS label stack. These functional similarities between setting-up wavelength switched paths and setting-up MPLS label-switched paths have been pointed out in [2] as a basis for integrating the optical layer control plane and Multi Protocol Label Switched (MPLS) control plane (as also the fact that integration permits more efficient network resource allocation). Given these similarities and the possible standardization effort toward integrated control protocols [2], we present our routing algorithms in a more general setting and use the term LSP to denote either a bandwidth-guaranteed MPLS label-switched path or a wavelength (lambda) switched path.…”

Section: Introductionmentioning

confidence: 99%

Dynamic routing of locally restorable bandwidth guaranteed tunnels using aggregated link usage information

Kodialam¹,

Lakshman²

Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer An

147

101

View full text Add to dashboard Cite

Abstract-This paper presents new algorithms for dynamic routing of locally restorable bandwidth guaranteed paths. Dynamic routing implies routing of requests that arrive one-by-one with no a priori knowledge of future arrivals, and so necessitating use of on-line algorithms. Local restorability means that upon a link or node failure, the first node upstream from the failure must be able to switch the path to an alternate preset outgoing link so that path continuity with bandwidth guarantees is restored by a strictly local decision. The motivation for use of local restoration is that it is much faster than path restoration because failure information does not have to propagate to the source. Local restoration implies that to successfully route a path set-up request an active (primary) path, and a bypass backup path for every link and node used by the active path must be determined . This locally restorable on-line routing problem is becoming particularly important in optical networks and in MPLS (Multi Protocol Label Switching) based networks due to the trend toward dynamic provisioning of bandwidth guaranteed or wavelength paths. To prevent excessive resource usage for backup paths, and to satisfy the implicit service provider requirement of optimizing network resource utilization so as to increase the number of potential future demands that can be routed, it is desirable to judiciously share backup paths while still maintaining local restorability. The best sharing performance is achieved if the routing of every path in progress in the network is known to the routing algorithm at the time of a new path set-up. However, this requires maintenance of non-aggregated or per-path information which is not often desirable particularly when distributed routing is preferred. We show that a partial information scenario which uses only aggregated and not per-path information provides sufficient information for efficient dynamic routing of locally restorable bandwidth guaranteed paths. In this partial information scenario the routing algorithm only knows what fraction of each link's bandwidth, is currently used by active paths, and is currently used by backup paths. Obtaining this information is feasible using proposed traffic engineering extensions to routing protocols. We develop efficient dynamic routing algorithms for bandwidth guaranteed paths that are locally restorable under single link or node failure. The routing is done using a sequence of shortest path computations, and it permits sharing of backup paths between requests as well as between the backup paths for different network elements for the same request. We compare the routing performance of our algorithm to other known restoration schemes. Our partial information based locally restorable algorithm performs very well in terms of the number of rejected requests and total bandwidth usage.

show abstract

Multiprotocol lambda switching: combining MPLS traffic engineering control with optical crossconnects

Cited by 214 publications

References 5 publications

Network management information for light-path assessment: trade-off between performance and complexity

Network management information for light-path assessment: trade-off between performance and complexity

Dynamic lightpath establishment in wavelength routed WDM networks

Dynamic routing of locally restorable bandwidth guaranteed tunnels using aggregated link usage information

Contact Info

Product

Resources

About