Bit-field-encoded resource record for determining a transmission path in a communications network
Method and apparatus for tracking, recording and distributing link state characteristics over communications networks. The invention allows network operators to efficiently define, track, store and disseminate link state characteristics using a bit-field-encoded resource record that is capable of representing many more link state characteristics than the bit-mask-encoded records used in existing systems. As a result, the present invention, when used in conjunction with standard routing and network maintenance algorithms, provides a much more efficient method than existing systems provide, for performing sophisticated networking tasks, such as handling complicated information transmission requests, setting up and tearing down network paths, and making dynamic routing decisions.
1. A method comprising:
receiving a resource record that is bit-field-encoded for specifying link information about one or more links within a communications network; and
determining a path, based on the resource record, over the communications network for transporting data, wherein the network is an optical network, and the resource record includes one of a line-coding field, a dispersion compensation technique field, a frequency band field, a fiber type field, or a combination thereof.
2. A method according to claim 1 , wherein the resource record further includes a bit-mask encoded field.
3. A method according to claim 1 , wherein the link information specifies service constraints including one of a request to avoid using a specified node, a request to avoid using a specified link, a request to use a specified link, or a combination thereof.
4. A method according to claim 1 , wherein one of the links is configured to transport either an optical signal, an electrical signal, or a wireless signal.
5. A method according to claim 1 , wherein the link information is provided to a link state routing protocol to determine the path, the link state routing protocol uses one of a shortest path first (SPF) routing algorithm, Dijkstra SPF algorithm, or a Bellman-Ford Vector algorithm.
6. An apparatus comprising:
a routing processor configured to receive a resource record that is bit-field-encoded fields for specifying link information about one or more links within a communications network,
wherein the routing processor is further configured to determine a path, based on the resource record, over the communications network for transporting data; and
wherein the network is an optical network, and the resource record includes one of a line-coding field, a dispersion compensation technique field, a frequency band field, a fiber type field, or a combination thereof.
7. An apparatus according to claim 6 , wherein the resource record further includes a bit-mask encoded field.
8. An apparatus according to claim 6 , wherein the link information specifies service constraints including one of a request to avoid using a specified node, a request to avoid using a specified link, a request to use a specified link, or a combination thereof.
9. An apparatus according to claim 6 , wherein one of the links is configured to transport either an optical signal, an electrical signal, or a wireless signal.
10. An apparatus according to claim 6 , wherein the link information is provided to a link state routing protocol to determine the path, the link state routing protocol uses one of a shortest path first (SPF) routing algorithm, Dijkstra SPF algorithm, or a Bellman-Ford Vector algorithm.
11. A system comprising:
one or more optical nodes, each configured to transport data over links of an optical network, wherein the optical node includes,
a memory configured to store a resource record that is bit-field-encoded for specifying link information about the links, and
a routing processor configured to determine a path, based on the resource record, over the optical network;
wherein the link information includes a service constraint, and the optical node further includes a constraint processor to transform the service constraint to a transport constraint for use by the routing processor to determine the path, the transport constraint including one of a line-coding field, a dispersion compensation technique field, a frequency band field, a fiber type field, or a combination thereof.
12. A system according to claim 11 , wherein the resource record further includes a bit-mask encoded field.
13. A system according to claim 11 , wherein the link information specifies service constraints including one of a request to avoid using a specified node, a request to avoid using a specified link, a request to use a specified link, or a combination thereof.
14. A system according to claim 11 , wherein the optical node is a phototonic cross-connect.
15. A system according to claim 11 , wherein the link information is provided to a link state routing protocol to determine the path, the link state routing protocol uses one of a shortest path first (SPF) routing algorithm, Dijkstra SPF algorithm, or a Bellman-Ford Vector algorithm.
16. A system according to claim 11 , further comprising:
a link state database configured to store a plurality of resource records, wherein the link state database is accessible by the optical nodes.