ARCHITECTURAL DESIGN AND STUDIES OF REQUIREMENTS IN METROPOLITAN AREA NETWORKS

Richard Rabbat and Edmond Kayi Lee

Email: rabbat@fla.fujitsu.com. Tel: +1-408-530-4537. Fax: +1-408-530-4515 Fujitsu Laboratories of America, Inc. 595 Lawrence Expressway, Sunnyvale, CA 94085 Email: kylee@mit.edu. Tel: +1-617-784-7586. Fax: +1-617-452-2529 Massachusetts Institute of Technology 77 Massachusetts Avenue, Cambridge, MA 02139

Abstract:

We study the offline traffic path assignment in metro ring networks that use Wavelength Division Multiplexing (WDM) transmission. We describe in this paper the issues relating to capacity, connectivity and flexibility requirements for supporting data and voice traffic in the Metropolitan Area Network. We define an optimization problem and present a novel Mixed Integer Program to solve the optimization problem. The novelty lies in the ability of the program to make recommendations for the types of nodes on the ring and to carry as well as not carry a proportion of traffic. We conduct several studies for simulated scenarios of traffic growth that allow us to make network design and node placement decisions. In addition, we study failures, topology changes and traffic upsurge due to special events and their effect on the network. Results of these studies allow us to make choices on traffic served and types of nodes used in order to allow resiliency to failure and rerouting of traffic based on a new optimal solution. network design optimization, mixed integer programming, metropolitan area networks.

Key words:

Richard Rabbat and Edmond Kayi Lee

1.

INTRODUCTION

Wavelength Division Multiplexing (WDM) has experienced widespread adoption in a relatively short period of time, moving from the core network to the bandwidth-starved metro network. Todays metro networks have been built up with little consideration to the traffic they are supposed to carry. They essentially deploy SONET/SDH service that offers Time-Division Multiplexing (TDM) circuits. We describe in this paper the capacity, connectivity and flexibility requirements for supporting data and voice traffic in the Metropolitan Area Network. The metro network remains to this date the largest underdeveloped part of the network. We define an optimization problem and present a novel Mixed Integer Program that balances conflicting requirements of carrying substantial traffic while remaining cost-effective.

1.1

Previous Work

Several works have addressed the topic of efficient routing and wavelength assignment. Other works have looked at circuit selection in detail. Reference [1] discusses dynamic routing of restorable bandwidth guaranteed paths, where two paths are set up to allow for restoration, with no a priori knowledge of future traffic. Reference [2] discusses the use of a connectivity matrix, a concept that we use in this paper. It also refers to the issue of node configuration to optimize the size of such node, given the cost structure of switches. This is discussed further in [3], where the authors describe a methodology for choosing among some types of cross-connects. References [4] and [8] present algorithms to solve the classic problem of Routing and Wavelength Assignment while [5] and [7] focus on the use of wavelength converters. Reference [6] investigates different methods of solving the problem of designing and optimizing the physical topology of all-optical networks with and without the use of wavelength conversion. Finally, [9] proposes the use of ring networks with limited wavelength conversion capability that can support a large number of lightpath requests.

1.2

Focus of Metropolitan Network Study

While these papers address important problems of optical networking, they do not consider a solution to the problem of changing traffic mix and requirements, increasing volume and dealing with special events including a short-lived event such as a natural disaster and long-lived events such as a killer application. This paper addresses the problems related to the efficient allocation of bandwidth (in the form of circuits) in a ring network, by taking

Architectural Design and Studies of Requirements in Metropolitan Area Networks

into consideration the relative cost of supporting each type of traffic, the cost of deploying equipment (nodes and fibers) and the opportunity cost of not supporting some traffic. Section 2 presents a formal formulation of the problem, introduces our assumptions of the traffic and network model and discusses the auxiliary graph that we construct from the original network graph as well as simplifying assumptions needed in solving the problem. Section 3 solves the problem as a Mixed Integer Program. Inputs, notations and variables are presented in this section. Section 4 presents the simulation study done using our traffic assumptions with experiments dealing with increasing bandwidth demand, special events, topology augmentation and component failures. Section 5 presents analytical results for simplifying assumptions that we use in our simulation. Section 6 concludes this paper.

2.

PROBLEM FORMULATION

We formulate the problem as a network design and traffic assignment problem. The network design problem finds optimal node functionality while the traffic assignment problem optimizes the circuit selection. The input of the problem is the physical topology of the network, traffic demand matrix and the available node types for different nodes in the network. Each node type is associated with an equipment cost and each unit of traffic is associated with an opportunity cost which represents the revenue derived from the traffic demand. Also, an operational cost can be used to model the utilization of network resources. The objective is to select the node type for each node and assign the traffic in order to minimize the cost function.

2.1

Modeling Traffic Input

We assume there are multiple classes of traffic, where each class of traffic has a different cost as well as different bandwidth requirements. Each traffic class k is represented by an NN traffic matrix Dk, where each element specifies the number of connection requests from node i to node j. We assume all connection requests have the same bandwidth demand, which is normalized to 1.

2.2

Network Model

The network is modeled as a directed graph. Each link in the graph represents a unidirectional fiber link in the network. Each fiber carries W wavelength channels, and each channel has G units of capacity. For

Richard Rabbat and Edmond Kayi Lee

example, if the connection requests are STS-1 circuits and the wavelengths are OC-48 channels, we set G to 48. Each node is associated with a set of available node types, each of which has a certain cost and functionality. The functionality of a node type t is modeled by a pair (gt, Mt). The element gt is the switching granularity of the node type t, which specifies the number of individual circuits the node type processes as a single unit. If the node type is a packet switch, we assume gt= (since a packet could be very small, this is a fair assumption). Otherwise we assume that gt divides G, and each wavelength channel is divided into G/gt timeslots, where each timeslot can carry gt units of traffic. The matrix Mt is the connectivity matrix that describes the port-to-port connectivity of the node type at the wavelength level. The matrix element is set to 1 if traffic from the ith input wavelength-port can be switched to the jth output wavelength-port and 0 otherwise. Given the inputs, we first construct an auxiliary graph so that the routing, wavelength and TDM channel assignment of the connection requests can be modeled simultaneously. The auxiliary graph presents a more detailed model for the nodes and fibers in the physical network. Each node in the network is modeled by a sub-graph, and such sub-graphs are connected by parallel edges representing the fibers. This extends work done by Cinkler et al [12] to solve the problem of node selection. In [12], the node type at each location is fixed. In our approach, variable node types are candidates for each location; so instead of modeling the node architectures as different subgraphs, we capture them in the MIP formulation by assigning each edge a capacity. The assignment of route and wavelength channel for a connection request can be determined by a corresponding path in the auxiliary graph, which fully specifies the route, wavelength channels and the type of switching (size of channel) taken at each node. To avoid confusion between the physical graph and auxiliary graph, in this paper we use the terms nodes and links when we refer to the objects in the physical graph, and the terms sub-nodes and sub-links when referring to objects in the auxiliary graph.

2.3

The Auxiliary Graph

A sub-graph is constructed for each node in the network to model in the switching and add/drop capability of the node. Each node has an input terminal port and an output terminal port, where traffic is added and dropped respectively, as well as a number of input ports and output ports, which receive or deliver traffic from an upstream or downstream node. In the subgraph, we create a sub-node for each wavelength for each of two ports. In addition, a pair of input/output representative sub-nodes is created for each

Architectural Design and Studies of Requirements in Metropolitan Area Networks

node to model the entry and exit points for the traffic sourced/destined at the node. The input sub-nodes are connected to the output sub-nodes by directed sub-links to model possible traffic flow paths. The representative sub-nodes are connected to the sub-nodes that belong to the input/output terminal ports.

Representative sub-node Sub-node for terminal port

Sub-node for input port Sub-node for output port

Figure 1. An auxiliary graph for two connected nodes

The sub-graphs of the nodes are interconnected by sub-links according to their physical topology. Figure 1 shows the auxiliary graph modeling two connected nodes, each with one input port, one output port, a pair of input/output terminal ports and two wavelengths.

2.4

Simplifying Assumptions

In this paper we model the details of the node on the wavelength level. Within the same wavelength channel, we assume that traffic in a timeslot can be switched to a different timeslot. This may not be true for equipment such as SONET Add-Drop Multiplexers (ADMs), in which traffic stays in the same timeslot unless it is added or dropped. An alternative approach is to model the nodes at the timeslot level. From an abstract point of view a timeslot is equivalent to a wavelength channel, which maps to a physical wavelength service. In that case, we can model the system using the same idea of the auxiliary graph, in which a sub-node represents the unit of a timeslot rather than a wavelength. However, such a model would increase the number of sub-links by a factor of O(G2) in the auxiliary graph. Therefore, we consider the model at the wavelength level as

Richard Rabbat and Edmond Kayi Lee

an approximation of the more precise model. The inaccuracies introduced will be discussed in section 5.

3.

A MATHEMATICAL FORMULATION

The node selection and traffic assignment problem can be formulated as a Mixed Integer Program (MIP). Basically, for each node i and node type t, there is a variable wti indicating whether type t is chosen for node i. In the auxiliary graph, there is a capacity upq for each sub-link (p, q) in the subgraph representing a node, limiting the maximum amount of traffic that can be assigned to the sub-link. The capacity for each sub-link depends on the node type selected for the node. For example, if type t is selected for the node and type t cannot switch traffic from wavelength-port p to wavelengthport q, then the capacity upq is 0. Otherwise, the capacity upq is G. We denote by xpqk,ij the flow variable for each sub-link specifies the amount of class k traffic, sourced at node i and destined to node j, assigned to the sub-link (p, q). The amount of assigned traffic cannot exceed the capacity upq of the sub-link.

3.1

Inputs, Notations and Variables

We define the notations used in our MIP formulation. In the rest of the paper, we use indices i and j to refer to the nodes in the network, and indices p and q to refer to sub-nodes of the auxiliary graph. Table 1 describes the list of input parameters; table 2 describes some additional notations used in the MIP formulation; table 3 describes variables used in the MIP.
Parameter V G T Hit Mpqt gt K Dijk Table 1. Description of Input Parameters Description Nodes in the physical topology Grooming granularity Set of node types Entry in the node type availability matrix. Set to 1 if type t available at node i's location and 0 otherwise Entry in the connectivity matrix of node type t. Set to 1 if traffic can be forwarded from wavelength-port p to wavelength-port q and 0 otherwise Grooming granularity for node type t Set of traffic classes Traffic demand from node i to node j for class k traffic Equipment cost for node type t Opportunity cost of each unit of class k traffic if unit of demand not satisfied by network Operational cost for using a unit of resource on sub-link (p,q)

t k

pq

Architectural Design and Studies of Requirements in Metropolitan Area Networks

Notation VA EA I(p) O(p) s(i) E(i) R Table 2. Description of additional notations Description Sub-nodes in the auxiliary graph Sub-links in the auxiliary graph Set of sub-nodes connected to sub-node p in the auxiliary graph Set of sub-nodes that sub-node p is connected to in the auxiliary graph Representative vertex in the auxiliary graph for node i Edges connecting the wavelength-ports in the sub-graph in the auxiliary graph representing node i Set of representative sub-nodes in auxiliary graph Table 3. Description of variables used in formulation Description Variable indicating whether type t node is selected for node i Capacity of sub-link (p, q) in the auxiliary graph For node type t at node i, number of time-slots assigned for switching from wavelength port p to wavelength port q Amount of class k traffic from node i to node j assigned to sub-link (p, q) Amount of class k traffic satisfied from node i to node j Total amount of traffic assigned to sub-link (p, q)

Variable wit upq vpqi,t xpqk,ij yijk zpq

Let us describe the MIP formulation. We explain the objective function and the constraints used in the program.

3.2

MIP Formulation
Minimize

iV t T

wit +

k K i , jV

(D
k

k ij

k yij )+

( p , q ) E A

pq z pq

Subject to:

w
tT
pI ( q )

t i

= 1 i V

(1) (2)
A

wit H it i V , t T

u pq G i V , q V \ S

(3)

qO ( p )

u pq G i V , p V \ S
A

(4)
(5)
(6) (7)

,t g t v ipq GM tpq wit i V ; t T ;( p, q ) E (i )

u pq g v
t T
k y ij =

t i ,t pq

i V ;( p, q) E (i )
x sk(,iij) q i, j V ; k K

q O ( s ( i ))

Richard Rabbat and Edmond Kayi Lee

z pq =

,ij xk pq kK i , jV

( p, q) E A

(8) (9)
A

k y k ,ij Dij i, j V ; k K

qI ( p )

k ,ij qp

qO ( p )

k ,ij pq

i, j V ; p V \ S ; k K

(10)
(11)

z pq u pq i V ;( p, q) E (i )

0 w 1 t T , i V 0 v G t T ; i V ;( p, q ) E (i ) x
k ,ij pq
t i k ,ij pq

t i i ,t pq

(12) (13) (14)

(15)
A

0 i, j V ;( p, q) E ; k K
A

w Z t T , i V

Z i, j V ;( p, q ) E ; k E
t

(16) (17)

v Z if g
i ,t pq

The objective function consists of three cost components. The first term is the equipment cost, which takes into account the type of equipment selected for each node. The second component is the opportunity cost, defined to be the loss of revenue for the traffic that the network is unable to support; this is calculated as the total traffic demand minus the amount of traffic satisfied. The third component is the operational cost, which is the variable cost incurred by utilizing network resources for carrying existing traffic. The goal is to minimize the total cost defined here. Constraint (1) requires that exactly one type of equipment be selected for each node. Constraint (2) states that the node type t can be chosen for node i only if the node type is available at node i. Constraints (3) and (4) set the capacity of each wavelength port to G. Constraint (5) states that traffic can be switched from wavelength port p to wavelength port q using node type t if and only if node type t is available and selected for node i, and the number of timeslots assigned is limited by the capacity of the wavelength. Constraint (6) computes the capacity assigned to sub-link (p, q). Constraint (7) simply computes the total traffic demand satisfied for the class k traffic from node i to node j. Constraint (8) computes the total traffic assigned to sub-link (p, q). Constraint (9) states that the total traffic satisfied for each class between each node pair is limited by the traffic demand. Constraint (10) is the flow conservation constraint. Constraint (11) states that the amount of traffic assigned to sub-link (p, q) cannot exceed the capacity of the sub-link. Constraints (12), (13) and (14) specify the variable ranges. Constraints (15), (16) and (17) are integer constraints. In particular, for constraint (17), if the node type t is a packet switch, that is, gt = 0, then the capacity assigned to sub-link (p, q) can be a real number.

Architectural Design and Studies of Requirements in Metropolitan Area Networks

4.

SIMULATION

We have implemented a tool solving the node selection and traffic assignment problem. To solve the MIP, the simulation tool calls the optimization library provided by CPLEX. The time needed to solve the simulated problems varied from several seconds to a few hours.

4.1

Traffic Input

In our simulation, we use traffic data expectations based on traffic studies conducted by Andrew Odlyzko [10] and Lawrence Roberts [11]. In particular, we assume that the total traffic demand is a combination of traffic staying in the metro (defined as local traffic) and traffic going to/from the core (defined as hubbed traffic). The simulated network uses 1/50th of the total bandwidth. We reproduce input traffic values in table 4.
Table 4. Traffic volume expectations in representative metro network [2002-2007] Year Total traffic demand (Gbps) 2002 11.46 2003 21.28 2004 37.60 2005 63.50 2006 102.99 2007 162.40

The total traffic demand includes both the local traffic (traffic that is sent between nodes of the metro ring) and core traffic (traffic coming from or going to the core network through the gateway or hub node). We assume the proportion of local traffic increases linearly from 30% in 2002 to 50% in 2007. This would reflect more community-based data exchanges. The local traffic is assumed to be distributed uniformly among the nodes on the Metro network.

4.2

Simulation Experiments

We carried out four different experiments in order to study the effect on network performance under changes in different aspects, including: Architectures with different node types and capacities Ability to support extra traffic in the case of special events Changes in physical topology Component Failures.

10

Richard Rabbat and Edmond Kayi Lee

4.2.1

Effect of Different Node Types

The network under study has 6 nodes, connected in a ring topology bidirectionally. We assume that a de-multiplexer and a multiplexer function are used for all the simulations. We study four different architectures: a) ADMs and Optical Bypass (ADM/OB): Each node terminates some of the wavelengths while others are optically bypassed. b) ADM/OB with Full Cross Connect at Hub (ADM/OB/FCCH): It is similar to ADM/OB, with a full cross-connect at the hub node. c) Stacked Ring (SR): We use this terminology to indicate that all wavelengths are terminated at every node using ADMs. In that respect, traffic on one wavelength cannot be switched to a different wavelength. d) Stacked Ring with Full Cross Connect at Hub (SR/FCCH): It is similar to SR with a full cross-connect at the hub node.
Architecture A
3500
Number of Circuits Satisfied
3500 Number of Circuits Satisfied

Architecture B

3000 2500 2000 1500 1000 500 0 2002

Total W=4, G=48 W=8, G=48 W=4, G=192

3000 2500 2000 1500 1000 500 0 2002

W=4, G=48 W=8, G=48 W=4, G=192 Total

2003

2004

2005

2006

2007

2003

2004

2005

2006

2007

Architectures C and D
3500 Number of Circuits Satisfied 3000 2500 2000 1500 1000 500 0 2002 W=4, G=48 W=8, G=48 W=4, G=192 Total Traffic
Number of Circuits Satisfied 1800 1600 1400 1200 1000 800 600 400 200

Comparison Chart for OC-192, W=4

ADM/OB ADM/OB/FCCH SR SR/FCCH

2003

2004

2005

2006

2007

0 2002

2003

2004

2005

2006

2007

Figure 2. Simulation results for different architectures

For each of the above architectures, we evaluate the performance on three different sets of channel capacities: four OC-48 channels, eight OC-48 channels, and four OC-192 channels. In the architectures with optical bypass, we assume the node terminates half of the wavelengths. However, we let the solver select the optimal set of how it places the wavelength bypasses at each node.

Architectural Design and Studies of Requirements in Metropolitan Area Networks

11

Figure 2 shows the performance of different network architectures with different capacities. It also gives a comparison among different network architectures for a four-wavelength, OC-192 system. The performance measure here is the number of circuits satisfied by the network. Simulation results show that the different network architectures will come to saturation in years 2004 to 2007, depending on the node types in the network, number of wavelengths as well as the bandwidth capacity of each wavelength channel. A four-wavelength OC-48 system starts to saturate in 2004 or 2005, whereas a four-wavelength OC-192 system can sustain the increasing traffic demand through 2007. Among different architectures, the networks with optical bypass support fewer circuit requests than their opaque counterparts: traffic cannot be added or dropped at the optically bypassing wavelengths, thereby reducing flexibility. Using a full cross-connect at the hub improves performance, but still underperforms a stacked ring for the projected future traffic. One interesting observation is that the performance of SR and SR/FCCH seems identical. That means the ability to cross-connect traffic among different wavelengths does not help improve performance significantly. We will address this observation in section 5, where we conduct a mathematical analysis comparing architectures using ADMs and cross-connects.

4.2.2

Support of Extra Traffic

In this section, we study the ability of the network to handle special events that lead to a sudden surge in traffic demand. Such extra traffic is supported by the available bandwidth of the network, after satisfying the projected normal traffic.
Hub node (a) Non-hub node (b)

Figure 3. Extra traffic in special event, (a) to the hub, and (b) to a local node

12

Richard Rabbat and Edmond Kayi Lee

We look at two simple models of special events where all the extra traffic is directed to the hub in one case, and all the extra traffic is directed to a local node in the other. Figure 3 illustrates the two scenarios. Figure 4 shows the number of extra circuits that can be supported in the two scenarios. As normal traffic demand grows over the years, the amount of bandwidth available for extra traffic decreases. In addition, more extra traffic can be supported if the traffic is directed to a local node. This is due to the fact that the link connected to the hub is the most highly utilized link.
(b) Extra Circuits Directed to Local Node
3500

(a) Extra Circuits Directed to Hub 3500 3000 2500 2000 1500 1000 500 0 2002 2003 2004 2005 2006 2007
W=4, G=48 W=8, G=48 W=4, G=192

3000 2500 2000 1500 1000 500 0 2002 W=4, G=48 W=8, G=48 W=4, G=192

2003

2004

2005

2006

2007

Figure 4. Extra circuits that can be supported on a 6-node ring of stacked ADMs

4.2.3

Topology Augmentation

We now study the effect of different topologies on the performance of the network. Specifically, we study the effect of adding one or multiple fibers. The topologies we consider are depicted in figure 5. Figure 5 also shows the number of circuits satisfied for a four-wavelength OC-192 network. T1

T0

T2
Number of Circuits Satisfied

3500 3000 2500 2000 1500 1000 500 0 2002 T0 T1 T2 T3 T4 T5 Total

T3

T4

T5

2003

2004

2005

2006

2007

Figure 5. Topology augmentation scenarios and simulation results

Architectural Design and Studies of Requirements in Metropolitan Area Networks

13

Although adding an extra fiber helps to support more traffic, the extent of improvement varies depending on which fiber is added. The improvement is more significant when a new fiber is added to connect the hub node to a local node since the links connected to the hub are the bottleneck. Topology T0 supports a smaller amount of the total projected traffic after the year 2004 while topology T5 supports the total traffic up to 2007. This indicates that the ring topologies impose stringent restrictions on ability to carry traffic.

4.2.4

Failure Studies

We look at the effect of failures on the network performance. The failures considered include fiber failure and transponder failure. The scenarios studied are depicted in figure 6. F1 and F2 depict a fiber failure, at the hub and a non-hub node respectively, while F3 and F4 show a transponder failure affecting hub and non-hub nodes as well.

F1

F2
Number of Circuits Satisfied

1800 1600 1400 1200 1000 800 600 400 200 0 2002 2003 2004 2005 2006 2007
Initial F1 F2 F3 F4

F3

F4

Effects of failures for OC-48

Figure 6. Different failure scenarios and simulation results

The results for four-wavelength OC-48 are shown. As expected, a fiber failure shows more significant impact on performance than a transponder failure. There is service disruption for part of the satisfied traffic for both fiber failures and transponder failures. The location where the failure takes place also affects performance. A failure closer to the hub node leads to larger disruption than a failure away from the hub node, especially in the earlier years. The difference dwindles gradually as the traffic is more localized as more unsatisfied traffic accumulates.

14

Richard Rabbat and Edmond Kayi Lee

5.

ANALYTICAL RESULTS

In this section, we compare the performance of the stacked ring architecture versus a ring with full cross-connects. We analyze the number of wavelengths required for the two network architectures in order to satisfy all the connection requests for a given class of traffic. The result can be interpreted in two ways. First, this would give us insight about the benefit with full cross-connectivity. Specifically, this gives us an idea how many extra wavelengths is sufficient to make up for the inability to switch traffic among different wavelengths. Second, this gives us a bound on inaccuracies introduced by the simplifying assumption discussed in Section 2.4, in which we assume traffic can always be switched among different TDM timeslots within the same wavelength. From an abstract point of view, a TDM timeslot is functionally equivalent to a wavelength channel. Therefore a Wwavelength, g-timeslot system can be considered as a Wg-wavelength system with 1 timeslot. The ability to switch among timeslots can be considered as having multiple partial cross-connects inside the switch. The performance of such an architecture will lie somewhere between the one without cross-connects and one with full cross-connect capability. In the following analysis, we assume the ring network has N nodes and each connection requests a lightpath (i.e., entire wavelength) between a two nodes in the network. The traffic demand is represented by a traffic matrix M. Given the matrix M, let WSR(N,M) be the minimum number of wavelengths required for an N-node stacked ring to satisfy all traffic specified by M. Similarly, let WCC(N,M) be the minimum number of wavelengths required for a ring with full cross-connects. The performance ratio: R(N,M) = WSR(N,M) / WCC(N,M) will be used for the comparison. The ratio is at least 1 because a network with full crossconnects will never require more wavelengths than a stacked ring.

Theorem 1: For arbitrary M, 1 R( N , M ) 2 Proof: Direct result from [13], p.372. Theorem 2: If traffic matrix M is a mix of hubbed traffic and uniform local traffic, where the proportion of local traffic is p. Then:

1 R( N , M ) 1 +

p pN + (1 p )( N 1) 2

Proof: Suppose we decompose M into Ml and Mh, where Ml is the traffic matrix for local traffic and Mh is the matrix for the hub traffic. Let s(M) be

Architectural Design and Studies of Requirements in Metropolitan Area Networks

15

the sum of entries in the matrix M. Then s(Ml) is the total local traffic request, and s(Mh) is the total hub traffic request. We have the equation:

s( M l ) s(M h ) = 1 p p

(18)

For hubbed traffic, since every connection request has to go through one of the four fibers, for any routing there is a fiber with load at least s(Mh)/4. Let Lh be the load of the highest loaded link. Then we have:

Lh

s( M h ) 4

(19)

For an N-node ring, each entry in Ml has value d, where

d=

s(M l ) N ( N 1)

(20)

Equation (8.1) in [13], p.360 states that the load on each link contributed by the local traffic is:

Ll =

dN 2 8

(21)

From (19) and (21), there is a fiber with load at least Lh + Li; therefore:

W CC ( N , M ) Lh +

dN 2 8

(22)

Equation (8.8) in [13], p.362 implies that local traffic specified in Ml can be supported with Wl wavelengths without wavelength conversion, where

N2 N Wl d + 4 8

(23)

Hubbed traffic can be supported by Lh wavelengths. For a stacked ring the total number of wavelengths required WSR(N,M) is bounded as follows:

16

Richard Rabbat and Edmond Kayi Lee

W SR ( N , M ) WhSR + Wl SR Lh + d ( N2 N + ). 8 4
(24)

As a result, the ratio is given by (22) and (24):

N2 N dN + + L d h 8 4 W SR ( N , M ) 4 =1+ 2 CC dN dN 2 W (N , M ) Lh + Lh + 8 8 dN p 4 1+ =1+ 2 pN s ( M h ) dN (1 p )( N 1) + + 2 4 8

(25)

If all traffic is hubbed, i.e. p=0, the performance ratio is 1. That means a ring with full cross-connects will not have any advantage over a stacked ring. On the other hand, if the traffic is local and uniformly distributed, i.e. p=1, the ratio becomes 1+2/N. Full cross-connects become more beneficial as traffic distribution becomes more local. When p=0.5, the performance ratio would be at most 9/8 for a 6-node network and the results of the simulation. This also gives a bound on the inaccuracies introduced by assuming that traffic can be switched between different timeslots.

6.

CONCLUSION

We have studied the issue of traffic and node placement in the optical metro network. We have presented a Mixed Integer Program that solves both problems. In that respect, we have assumed a certain traffic growth in the metropolitan area network and have presented the changes and increased connectivity needs to accompany that traffic growth. We have also studied the effect of dramatic change on the network including connectivity change (increased connectivity and component failures) and special events. We have shown the advantage of increasing the number of wavelengths and increasing the node connectivity on the network utilization. Since this study focuses on off-line computation, issues such as computational speed and finding a polynomial-time algorithm that approximates the results of the MIP were not considered. Future work will

Architectural Design and Studies of Requirements in Metropolitan Area Networks

17

address online computation studies to deal with dynamic bandwidth changes using heuristic algorithms. We are currently assessing the performance of several heuristics to solve the problems in polynomial-order time. We would also like to explore more dynamic network changes using prediction methods based on connection request arrival times to solve the online problem efficiently.

REFERENCES
[1] M. Kodialam and T.V. Lakshman, Dynamic Routing of Locally Restorable Bandwidth Guaranteed Tunnels using Aggregated Network Resource Usage Information, INFOCOM 2001. [2] Y.-W. Leung, Design of Node Configuration for All-Optical Multi-Fiber Networks, IEEE/ACM Transactions on Networking, Vol. 50, No. 1, Jan. 2002. [3] G. Jeong and E. Ayanoglu, Comparison of Wavelength-Interchanging and WavelengthSelective Cross-Connects in Multi-Wavelength All-Optical Networks, INFOCOM 1996. [4] D. Cavendish and B. Sengupta, Routing and Wavelength Assignment in WDM Rings with Heterogeneous Wavelength Conversion Capabilities, INFOCOM 2002. [5] B. Ramamurthy and B. Mukherjee, Wavelength Conversion in WDM Networking, IEEE Journal on Selected Areas of Communication, vol. 16, no. 9, Sept. 1998. [6] G. Xiao, Two-Stage Cut Saturation Algorithm for Designing All-Optical Networks, IEEE Transactions on Communications, Vol. 49, No. 6, Jun. 2001. [7] S. Subramanian, M. Azizoglu and A. Somani, All-optical networks with sparse wavelength conversion, IEEE/ACM Transactions on Networking, Vol. 4, No.4, Aug. 1996. [8] G. Li and R. Simha, On the Wavelength Assignment Problem in Multifiber WDM Star and Ring Networks, INFOCOM 2000. [9] R. Ramaswami and G. Sasaki, Multiwavelength Optical Networks with Limited Wavelength Conversion, IEEE/ACM Transactions on Networking, 1997. [10] Coffman, K. G., and A. M. Odlyzko, Internet Growth: Is There a Moores Law for Data Traffic?, Handbook of Massive Data Sets, J. Abello, P. M. Pardalos, and M. G. C. Resende, eds., Kluwer, 2001. [11] Roberts, Lawrence, Internet Traffic Measurement 2001 and 2002, Caspian Networks, January 2002, White Paper. [12] Tibor Cinkler, Dniel Marx, Claus Popp Larsen, Dniel Fogaras, Heuristic Algorithms for Joint Configuration of the Optical and Electrical Layer in Multi-Hop Wavelength Routing Networks, Proceedings of INFOCOM 2000. [13] R. Ramaswami and K. Sivarajan, Optical Networks: A Practical Perspective, Morgan Kaufmann, 1998.