Network addressing scheme for reducing protocol overhead in...

Multiplex communications – Fault recovery – Bypass an inoperative station

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C370S395310, C370S400000, C370S242000, C370S351000, C709S238000, C709S239000, C709S242000

Reexamination Certificate

active

06801496

ABSTRACT:

BACKGROUND OF THE INVENTION
1. Field of the Invention
This invention relates to the field of information networks, and more particularly relates to a protocol for configuring routes over a network.
2. Description of the Related Art
Today's networks carry vast amounts of information. High bandwidth applications supported by these networks include streaming video, streaming audio, and large aggregations of voice traffic. In the future, these bandwidth demands are certain to increase. To meet such demands, an increasingly popular alternative is the use of lightwave communications carried over fiber-optic cables. The use of lightwave communications provides several benefits, including high bandwidth, ease of installation, and capacity for future growth.
Optical infrastructures are capable of transmission speeds in the gigabit range, which helps address the ever-increasing need for bandwidth mentioned above. Such infrastructures employ various topologies, including ring and mesh topologies. In order to provide fault protection, ring topologies normally reserve a large portion (e.g. 50% or more) of the network's available bandwidth for use in restoring failed circuits. However, ring topologies are capable of quickly restoring failed circuits. This capability is important in providing reliable service to customers, and is particularly important in telephony applications, where a failure can result in alarms, dropped calls, and, ultimately, customer dissatisfaction and lost revenue. In a similar vein, because of bandwidth demands, protocol overhead related to provisioning, restoration, and other functions should be kept to a minimum in order to make the maximum amount of bandwidth available for use by customers.
An alternative to the ring topology, the mesh topology reduces the amount of bandwidth needed for protection. The mesh topology is a point-to-point topology, with each node in the network connected to one or more other nodes. Because a circuit may be routed through various combinations of the network's nodes and over the various links which connect them, excess capacity through a given node or over a given link can serve to protect several circuits. However, the restoration of a circuit following a failure in a mesh topology can consume a relatively large amount of time.
SUMMARY
In one embodiment, the present invention reduces the time and resources required to restore a failed circuit (or provision a new circuit) in an optical network by partitioning the nodes of an optical network into zones. The time and resources required are reduced, for example, by localizing the required actions to the zone in which the failure occurred. Localization is effected through the use of a node that acts as a substitute for the source or destination node, as the case may be. This substitute node is referred to herein as a proxy node. The proxy node will normally be a boundary node for the zone in which no failure occurred. If a failure occurs between zones, both boundary nodes can act as proxies for their respective non-boundary nodes, or a full restoration may instead be performed.
According to one embodiment of the present invention, a method is provided for operating a network. The method, in one embodiment, begins by grouping a plurality of nodes into zones, where the network includes the plurality of nodes. At least one of the nodes in each one of the zones is one of a plurality of boundary nodes, and each of the boundary nodes in each one of the zones is coupled to a boundary node in another of the zones by one of a first number of inter-zone optical links. One of the zones includes a number of nodes, each of which is coupled to at least one other of the nodes by one of a second number of intra-zone optical links. Next, a non-boundary node is configured to transmit network information to other of the nodes. The non-boundary node is a node in the zone that is not a boundary node. Finally, a boundary node in the zone is configured to limit transmission of the network information through itself to other of the boundary nodes. The network information so limited can be restoration information (in the event of a failure), network topology information, and/or other network information.
According to another embodiment of the present invention, a network includes a plurality of nodes, a plurality of inter-zone optical links, and a plurality of intra-zone optical links. The nodes are grouped into zones, and each one of the zones includes at least a first number of the nodes, at least one of which is a boundary node. A boundary node in each one of the zones is coupled to a boundary node in at least one of the other zones by at least one of the inter-zone optical links One of the zones includes a second number of nodes, which including a first boundary node and a first non-boundary node. The first non-boundary node is one of the second number of the nodes that is not the first boundary node, and each one of the second number of nodes is coupled to at least one other of those nodes by at least one of the intra-zone optical links. The non-boundary node is configured to transmit network information to other of the nodes, while the first boundary node is configured to limit transmission of network information through itself to at least one other of the boundary nodes.
The foregoing is a summary and thus contains, by necessity, simplifications, generalizations and omissions of detail; consequently, those skilled in the art will appreciate that the summary is illustrative only and is not intended to be in any way limiting. Other aspects, inventive features, and advantages of the present invention, as defined solely by the claims, will become apparent in the non-limiting detailed description set forth below.


REFERENCES:
patent: 5049871 (1991-09-01), Sturgis et al.
patent: 5093824 (1992-03-01), Coan et al.
patent: 5412376 (1995-05-01), Chujo et al.
patent: 5513345 (1996-04-01), Sato et al.
patent: 5590118 (1996-12-01), Nederlof
patent: 5596722 (1997-01-01), Rahnema
patent: 5646936 (1997-07-01), Shah et al.
patent: 5687167 (1997-11-01), Bertin et al.
patent: 5737319 (1998-04-01), Croslin et al.
patent: 5781528 (1998-07-01), Sato et al.
patent: 5805578 (1998-09-01), Stirpe et al.
patent: 5805593 (1998-09-01), Busche
patent: 5835696 (1998-11-01), Hess
patent: 5881048 (1999-03-01), Croslin
patent: 5881246 (1999-03-01), Crawley et al.
patent: 5884297 (1999-03-01), Noven
patent: 5918020 (1999-06-01), Blackard et al.
patent: 5920257 (1999-07-01), Commerford
patent: 5933425 (1999-08-01), Iwata
patent: 5959972 (1999-09-01), Hamami
patent: 5987526 (1999-11-01), Morales
patent: 5995503 (1999-11-01), Crawley et al.
patent: 5999286 (1999-12-01), Venkatesan
patent: 6011780 (2000-01-01), Vaman et al.
patent: 6041037 (2000-03-01), Nishio et al.
patent: 6041049 (2000-03-01), Brady
patent: 6047331 (2000-04-01), Medard et al.
patent: 6075766 (2000-06-01), Croslin
patent: 6075775 (2000-06-01), Ueki
patent: 6097696 (2000-08-01), Doverspike
patent: 6097722 (2000-08-01), Graham et al.
patent: 6115753 (2000-09-01), Joens
patent: 6130876 (2000-10-01), Chaudhuri
patent: 6130881 (2000-10-01), Stiller et al.
patent: 6134671 (2000-10-01), Commerford et al.
patent: 6148000 (2000-11-01), Feldman et al.
patent: 6154778 (2000-11-01), Koistinen et al.
patent: 6222653 (2001-04-01), Asahi
patent: 6259673 (2001-07-01), Yoshihara et al.
patent: 6272107 (2001-08-01), Rochberger et al.
patent: 6272139 (2001-08-01), Soncodi
patent: 6275492 (2001-08-01), Zhang
patent: 6282170 (2001-08-01), Bentall et al.
patent: 6292464 (2001-09-01), Elahmadi et al.
patent: 6301244 (2001-10-01), Huang et al.
patent: 6304549 (2001-10-01), Srinivasan et al.
patent: 6324162 (2001-11-01), Chaudhuri
patent: 6347078 (2002-02-01), Narvaez-Guarnieri et al.
patent: 6370119 (2002-04-01), Basso et al.
patent: 6400681 (2002-06-01), Bertin et al.
patent: 6430150 (2002-08-01), Azuma et al.
patent: 6457050 (2002-09-01), Cowan et al.
patent: 6463062 (2002-10-01), Buyukkoc et al.
patent: 6504845 (2003-01-01), Petersen et al.
patent: 0 781 068 (1997-06-01), None
pa

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Network addressing scheme for reducing protocol overhead in... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Network addressing scheme for reducing protocol overhead in..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Network addressing scheme for reducing protocol overhead in... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3292841

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.