Dynamic communication channel allocation method and system

• US 20020181503A1
• Filed: 04/08/2002
• Published: 12/05/2002
• Est. Priority Date: 04/06/2001
• Status: Active Grant

• Current Assignee: Charles D. Montgomery Jr
• Original Assignee: Charles D. Montgomery Jr
• Inventors: Montgomery, Charles D. Jr.
• Granted Patent: US 7,388,872 B2
• Time in Patent Office: Days
• US Class Current: 370/468
• CPC Class Codes: H04J 14/0227 Operation, administration, maintenance or provisioning [OAMP] of WDM networks, e.g. media access, routing or wavelength allocation
• CPC Class Codes: H04J 14/0241 Wavelength allocation for communications one-to-one, e.g. unicasting wavelengths
• CPC Class Codes: H04J 14/0283 WDM ring architectures
• CPC Class Codes: H04J 14/0291 Shared protection at the optical multiplex section (1:1, n:m)
• CPC Class Codes: H04J 3/085 for ring networks, e.g. SDH/SONET rings, self-healing rings, meashed SDH/SONET networks
• CPC Class Codes: H04J 3/1682 Allocation of channels according to the instantaneous demands of the users, e.g. concentrated multiplexers, statistical multiplexers
• CPC Class Codes: H04L 12/437 Ring fault isolation or reconfiguration for SDH/SONET ring networks H04J3/085

Abstract

A bandwidth brokering system and method incorporating methodology for supporting self-healing communication rings is disclosed. The present invention utilizes state-based tokens that are transmitted on a separate communication channel between network nodes to monitor and correct communication failures occurring at a link, interface, and network node level. The invention as taught permits generic brokering of all available network bandwidth in a granular method without the need for fixed designations of “protection” or “working” communication paths. As such, the present invention permits integration of “protection” and “working” communication data paths to permit full utilization of available system bandwidth with graceful recovery in the event of system or link malfunctions. While the present invention is optimally adapted to use in optical communications systems and specifically those incorporating wavelength division multiplexing (WDM), dense wavelength division multiplexing (DWDM), and ultra-dense wavelength division multiplexing, the teachings presented are equally well adapted to situations where other communications mediums are utilized in a multi-carrier, wireless, or spread-spectrum environment, among others.

Claims

1. A fully distributed method of dynamically allocating bandwidth between at least two nodes in a network, comprising:

(a) using a token of information for each available network communication channel (Ci, i is one of 0 through n) wherein the token(s) are transmitted over a control communication channel (C0).

(b) evaluating at each node the control channel tokens to determine if a data payload is destined for and simultaneously arriving at that node on one of the communication channels.

2. The fully distributed network of claim 1 wherein the token comprises a plurality of fields.

3. The token of claim 2 wherein the fields comprise:

(a) a channel ID field; and

(b) a communications path status field.

4. The token of claim 3 wherein the communications path status field comprises a two bit field.

5. The token of claim 3 wherein the communications path status field comprises a two bit field wherein a value (00) means the corresponding link is currently available, a value of (01) means that the link associated with that subfield is either a source link or an intermediate link, a value (10) means that the corresponding link is a destination link, and a value (11) means that the link is the only link between the source of the data transmission and its destination.

6. A node for use in a communications network comprising:

(a) a first demultiplexer coupled to a communications medium, wherein the demultiplexer can split a control channel off from a plurality of communications channels;

(b) a controller coupled to the control channel for deterining if a data payload is intended for the node;

(c) a second demultiplexer for seperating the plurality of control channels;

(d) a switch for routing a first communications channel into a processor wherein the controller can control the switch.

7. The node of claim 6 further comprises:

(d) a delay on the control channel so that its original signal can be recoupled to the communications channel if the node is not a destination node.

8. The node of claim 6 further comprises:

(d) a delay on the control channel so that its original signal can be updated if the node is a destination node.

9. The node of claim 6 further comprises a first multiplexer for recouling the plurality of control channels.

10. The node of claim 9 further comprises a second multiplexer for recouling the control channel to the communications channels.