For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
On Constraints for Path Computation in Multi-Layer Switched Networks
Bijan JABBARI Shujia GONG Eiji OKI
IEICE TRANSACTIONS on Communications
Publication Date: 2007/08/01
Online ISSN: 1745-1345
Print ISSN: 0916-8516
Type of Manuscript: Special Section SURVEY PAPER (Special Section on Feature Topics on Latest Trends in Optical Networks)
Category: Traffic Engineering and Multi-Layer Networking
multi-layer networks, path computation, channel graph, routing, optical networks, ring networks, ROADM, DWDM,
Full Text: PDF>>
This paper considers optical transport and packet networks and discusses the constraints and solutions in computation of traffic engineering paths. We categorize the constraints into prunable or non-prunable classes. The former involves a simple metric which can be applied for filtering to determine the path. The latter requires a methodic consideration of more complicated network element attributes. An example of this type of constraints is path loss in which the metric can be evaluated only on a path basis, as opposed to simply applying the metric to the link. Another form of non-prunable constraint requires adaptation and common vector operation. Examples are the switching type adaptation and wavelength continuity, respectively. We provide possible solutions to cases with different classes of constraints and address the problem of path computation in support of traffic engineering in multi-layer networks where a set of constrains are concurrently present. The solutions include the application of channel graph and common vector to support switching type adaptation and label continuity, respectively.