Unit 4

Cost Trade-Offs: A Detailed Ring Network

We measure the higher-layer equipment cost by the number of IP router ports (or SONET line
terminals). The number of IP router ports required is equal to twice the number of light-paths that
need to be established since each light-path connects a pair of IP router ports. An important
component of the optical layer cost is the number of transponders required in the OLTs and OADMs.

The first light-path topology, shown in Figure 10.3(a), is a ring, which we call a point-to-point WDM
(PWDM) ring. In this case, the light-path topology is also a ring, just like the fiber topology, except
that we can have multiple light-paths between adjacent nodes in the ring, in order to provide the
required capacity between the IP routers.

The second light-path topology, shown in Figure 10.3(b), is a hub design. All routers are connected to
a central (hub) router by one or more light-paths. Thus all packets traverse two light-paths: from the
source router to the hub, and from the hub to the destination router.

The third, and final, light-path topology, shown in Figure 10.3(c), is an all-optical design. In this case,
we establish direct light-paths between all pairs of routers. Thus, packets traverse only one light-path
to get from the source router to the destination router.

We next consider how to realize these light-path topologies on the fiber network; that is, we solve
the RWA problem for these three designs. The RWA problem is to find a route for each light-path and
to assign it a wavelength on every link of the route. We assume that a light-path must be assigned
the same wavelength on all the links it traverses; that is, the optical layer provides no wavelength
conversion capability. In addition, no two light-paths traversing the same link can be assigned the
same wavelength.
Ring Example-

PWDM Ring

We first consider the PWDM ring. The network shown in Figure 10.4 is a PWDM ring. At each node,
all the wavelengths are received and sent to the IP routers. For this network, all light-paths are
“single-hop” light-paths between adjacent nodes in the ring.

If W denotes the number of wavelengths on each link, then we can set up W light-paths between
each pair of adjacent nodes. The number of IP router ports needed will depend on the algorithm
used to route the traffic.

Suppose we route each traffic stream along the shortest path between its source and destination,
and N is the number of nodes in the network. Assuming N is even, we can calculate the traffic load
(in units of light-paths) on each link to be

L = (N + 1 + 1 /N−1)/8 t

In this case, since all light-paths are single-hop light-paths, the number of wavelengths needed to
support this traffic is simply

W = [L] = [(N + 1 + 1 /N−1)/8 t]

Since all the wavelengths are received and retransmitted at each node, the number of router ports
required per node, Q, is

Q = 2W.

Router ports: Clearly, we would like to use the minimum possible number of IP router ports to
support the given traffic. Note that since a light-path is established between two router ports,
minimizing the number of ports is the same as minimizing the number of light-paths that must be set
up to support the traffic.

Wavelengths: At the same time, we would also like to use the minimum possible number of
wavelengths since using more wavelengths incurs additional equipment cost in the optical layer.

Hops: This parameter refers to the maximum number of hops taken up by a light-path. For the
PWDM ring, each light-path takes up exactly one hop. This parameter becomes important because it
gets more difficult to design the transmission system as the number of hops increases which again
increases the cost of optical layer equipment.
Light-path Topology Design
1. Light-path Topology Design: This is about figuring out how to connect different points in a
network using light-paths. It's like planning roads between cities.

2. Assumptions: They assume certain things, like each light-path being bidirectional (going both
ways), and each node (point) having a limited number of connections.

3. Traffic Routing: Once you have the connections, you need to decide how to route traffic through
them. Think of this as figuring out which roads to take to get from one city to another.

4. Mathematical Formulation: They describe the problem in mathematical terms, with variables
representing things like the amount of traffic between points and whether a connection exists
between them.

5. Objective: The main goal is to minimize congestion, which is like avoiding traffic jams on the roads.

6. Solving the Problem: They explain different approaches to solving this problem. One involves
using linear programming (LP) and integer linear programming (ILP), which are mathematical
techniques for finding solutions to optimization problems.

7. Heuristic Solutions: Since ILP problems can be complex, they discuss using heuristics (rules of
thumb) to find approximate solutions faster.

8. Practical Examples: They discuss applying these methods to real-world problems, like designing
networks for internet or telephone systems.

9. Iterative Reconfiguration: Networks can change over time, so they discuss ways to gradually
adjust the connections in response to changes in traffic.

In simpler terms, it's like planning the best routes for internet or phone traffic, considering factors
like available connections, traffic flow, and minimizing congestion, using both mathematical
techniques and practical strategies.