Survivability and Traffic Grooming in WDM Optical Networks
Providing detailed coverage of key issues in modern optical networks, this highly useful book provides a framework for dealing with survivability and traffic grooming in wide-area networks.
TABLE OF CONTENTS Survivability and Traffic Grooming in WDM Optical Networks
19.10: ILP Formulation: Connection-based Protection
19.10 ILP Formulation: Connection-based Protection
Given the network topology G( V, E), and the traffic matrix obtained from traffic matrix preprocessing, one first lists all possible paths with the hop-length limit constraint for each s-d node-pair. This can be accomplished by using a breadth-first search for each node. These eligible paths form a set of all possible light trails. Among all the possible choices, an optimal set of paths is chosen to form the light trail network such that the total number of light trails are minimized and the demand constraint and the protection constraint are met. This problem is formulated as an ILP optimization problem. It is also assumed that each request cannot be split into multiple parts.
19.10.1 Notation
The network topology is represented as a directed graph G( V, E) with V = N nodes and E = L links with W wavelengths on each link. The following notation is used.
-
n =1 , 2 ,..., N: number assigned to each node in the network.
-
p, p 1 , p 2 =1 , 2 ,..., P: number assigned to a path in the network.
-
i, j, k = 1 , 2 ,..., N( N ? 1): number assigned to a node-pair. The source and destination nodes of a connection request form a node-pair.
The following notation is used for path-related...
Copyright Cambridge University Press 2005 under license agreement with Books24x7
