# US 2002/0159114 A1 · Method and apparatus for routing signals through an optical network

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2002/0159114 A1
- Document ID: US20020159114A1
- Status: Published application
- Kind: A1
- Application number: 09/836,958
- Filed: 2001-04-17
- Published: 2002-10-31
- Earliest claimed: 2001-04-17
- Inventors: Laxman Sahasrabuddhe; Biswanath Mukherjee
- Web page: https://patentgrep.com/patent/US20020159114A1

## CPC

- H04Q 11/0005: {Switch and router aspects}
- H04J 14/0227: {Operation, administration, maintenance or provisioning [OAMP] of WDM networks, e.g. media access, routing or wavelength allocation}
- H04J 14/0241: {Wavelength allocation for communications one-to-one, e.g. unicasting wavelengths}
- H04J 14/0213: {Groups of channels or wave bands arrangements}
- H04J 14/0284: {WDM mesh architectures}
- H04Q 2011/0073: {Provisions for forwarding or routing, e.g. lookup tables}
- H04Q 2011/0075: {Wavelength grouping or hierarchical aspects}
- H04Q 2011/0086: {Network resource allocation, dimensioning or optimisation}
- H04Q: SELECTING (switches, relays, selectors H01H; wireless communication networks H04W)
- H04J: MULTIPLEX COMMUNICATION (transmission in general H04B; peculiar to transmission of digital information H04L5/00; systems for the simultaneous or sequential transmission of more than one television signal H04N7/08; in exchanges H04Q11/00; stereophonic systems H04S)

## Abstract

One embodiment of the present invention provides a system for routing signals through an optical network, wherein the optical network includes a plurality of optical cross-connects coupled together by a plurality of optical fiber links. Note that each of the optical cross-connects includes a plurality of non-blocking switches, and each optical fiber link can carry signals on a plurality of wavelengths. Upon receiving a request to establish a path, the system identifies a plurality of paths between the source and the destination through the optical network. Each switch in an optical cross-connect is associated with one or more wavegroups (wherein each wavegroup includes signals from one or more wavelengths). Note that each path through the optical network is comprised of wavelength/fiber links that belong to the same wavegroup, and that wavelength/fiber links that belong to the same wavegroup are routed through a non-blocking switch that is associated with the wavegroup. Next, the system calculates a cost for each of the paths based upon a cost function, and selects a path based upon the calculated costs.

## Claims

### Claim 1

A method for routing signals through an optical network, wherein the optical network includes a plurality of optical cross-connects coupled together by a plurality of optical fiber links, wherein each optical cross-connect includes a plurality of non-blocking switches, and wherein each optical fiber link can carry signals on a plurality of wavelengths, the method comprising:
receiving a request to establish a path between a source and a destination;
identifying a plurality of paths between the source and the destination through the optical network;
wherein each of the plurality of paths is comprised of wavelength/fiber links that belong to the same wavegroup;
wherein wavelength/fiber links that belong to the same wavegroup are routed through the same non-blocking switch at each optical cross-connect;
calculating a cost for each of the plurality of paths based upon a cost function; and
selecting the path from the plurality of paths based upon the calculated costs.

### Claim 2 (depends on 1)

The method of claim 1, wherein each optical cross-connect in the plurality of optical cross-connects includes a single column of non-blocking switches.

### Claim 3 (depends on 1)

The method of claim 1, wherein the cost of a given path is a function of a number of hops in the given path and the utilization of wavelength/fiber links in the given path.

### Claim 4 (depends on 3)

The method of claim 3, wherein the cost of the given path is a function of the utilization of wavegroup links along the given path, wherein a given wavegroup link includes all wavelengths belonging to a given wavegroup on a given optical fiber link.

### Claim 5 (depends on 1)

The method of claim 1, wherein selecting the path involves selecting a primary path and at least one backup path from the plurality of paths.

### Claim 6 (depends on 1)

The method of claim 1,
wherein identifying the plurality of paths additionally involves considering paths that cross between wavegroups; and
wherein the cost of a given path that crosses between wavegroups includes an additional cost for switching between wavegroups.

### Claim 7 (depends on 1)

The method of claim 1, wherein identifying the plurality of paths involves using Djikstra's shortest path algorithm to find shortest paths based upon number of hops between the source and the destination.

### Claim 8 (depends on 1)

The method of claim 1, wherein identifying the plurality of paths involves identifying a plurality of link-disjoint paths.

### Claim 9

A computer-readable storage medium storing instructions that when executed by a computer cause the computer to perform a method for routing signals through an optical network, wherein the optical network includes a plurality of optical cross-connects coupled together by a plurality of optical fiber links, wherein each optical cross-connect includes a plurality of non-blocking switches, and wherein each optical fiber link can carry signals on a plurality of wavelengths, the method comprising:
receiving a request to establish a path between a source and a destination;
identifying a plurality of paths between the source and the destination through the optical network;
wherein each of the plurality of paths is comprised of wavelength/fiber links that belong to the same wavegroup;
wherein wavelength/fiber links that belong to the same wavegroup are routed through the same non-blocking switch at each optical cross-connect;
calculating a cost for each of the plurality of paths based upon a cost function; and
selecting the path from the plurality of paths based upon the calculated costs.

### Claim 10 (depends on 9)

The computer-readable storage medium of claim 9, wherein each optical cross-connect in the plurality of optical cross-connects includes a single column of non-blocking switches.

### Claim 11 (depends on 9)

The computer-readable storage medium of claim 9, wherein the cost of a given path is a function of a number of hops in the given path and the utilization of wavelength/fiber links in the given path.

### Claim 12 (depends on 11)

The computer-readable storage medium of claim 11, wherein the cost of the given path is a function of the utilization of wavegroup links along the given path, wherein a given wavegroup link includes all wavelengths belonging to a given wavegroup on a given optical fiber link.

### Claim 13 (depends on 9)

The computer-readable storage medium of claim 9, wherein selecting the path involves selecting a primary path and at least one backup path from the plurality of paths.

### Claim 14 (depends on 9)

The computer-readable storage medium of claim 9,
wherein identifying the plurality of paths additionally involves considering paths that cross between wavegroups; and
wherein the cost of a given path that crosses between wavegroups includes an additional cost for switching between wavegroups.

### Claim 15 (depends on 9)

The computer-readable storage medium of claim 9, wherein identifying the plurality of paths involves using Djikstra's shortest path algorithm to find shortest paths based upon number of hops between the source and the destination.

### Claim 16 (depends on 9)

The computer-readable storage medium of claim 9, wherein identifying the plurality of paths involves identifying a plurality of link-disjoint paths.

### Claim 17

An apparatus for routing signals through an optical network, wherein the optical network includes a plurality of optical cross-connects coupled together by a plurality of optical fiber links, wherein each optical cross-connect includes a plurality of non-blocking switches, and wherein each optical fiber link can carry signals on a plurality of wavelengths, the apparatus comprising:
an identification mechanism that is configured to identify a plurality of paths between a source and a destination through the optical network;
wherein each of the plurality of paths is comprised of wavelength/fiber links that belong to the same wavegroup;
wherein wavelength/fiber links that belong to the same wavegroup are routed through the same non-blocking switch at each optical cross-connect;
a calculating mechanism that is configured to calculate a cost for each of the plurality of paths based upon a cost function; and
a selection mechanism that is configured to select the path from the plurality of paths based upon the calculated costs.

### Claim 18 (depends on 17)

The apparatus of claim 17, wherein each optical cross-connect in the plurality of optical cross-connects includes a single column of non-blocking switches.

### Claim 19 (depends on 17)

The apparatus of claim 17, wherein the cost of a given path is a function of a number of hops in the given path and the utilization of wavelength/fiber links in the given path.

### Claim 20 (depends on 19)

The apparatus of claim 19, wherein the cost of the given path is a function of the utilization of wavegroup links along the given path, wherein a given wavegroup link includes all wavelengths belonging to a given wavegroup on a given optical fiber link.

### Claim 21 (depends on 17)

The apparatus of claim 17, wherein the selection mechanism is configured to select a primary path and at least one backup path from the plurality of paths.

### Claim 22 (depends on 17)

The apparatus of claim 17,
wherein the identification mechanism is configured to consider paths that cross between wavegroups; and
wherein the cost of a given path that crosses between wavegroups includes an additional cost for switching between wavegroups.

### Claim 23 (depends on 17)

The apparatus of claim 17, wherein the identification mechanism is configured to use Djikstra's shortest path algorithm to find shortest paths based upon number of hops between the source and the destination.

### Claim 24 (depends on 17)

The apparatus of claim 17, wherein the identification mechanism is configured to identify a plurality of link-disjoint paths.
