Protocol circuit layer

• US 10,116,561 B2
• Filed: 01/25/2016
• Issued: 10/30/2018
• Est. Priority Date: 02/01/2006
• Status: Active Grant

• Current Assignee: CoCo Communications, Corp.
• Original Assignee: CoCo Communications, Corp.
• Inventors: Eller, Riley, Laub, Frank, Bruestle, Jeremy, Tucker, Mark L.
• Primary Examiner(s): Sloms, Nicholas
• Application Number:
  US15/005,721
• Publication Number:
  US 20160156553A1
• Time in Patent Office: 1,009 Days
• Field of Search: None
• CPC Class Codes: H04L 12/66 Arrangements for connecting between networks having differing types of switching systems, e.g. gateways
• CPC Class Codes: H04L 45/02 Topology update or discovery
• CPC Class Codes: H04L 45/74 Address processing for routing

Abstract

A protocol circuit layer is described. The protocol circuit layer may employ a routing layer to determine optimal routes when establishing a circuit. The circuit layer may employ a link layer to send data packets over links to other network nodes. A naming layer may employ circuits to establish a distributed database of associations between network node addresses and their network locations.

Claims

1. A system that enables network communications over circuits defined by a plurality of nodes, wherein adjacent ones of the plurality of nodes are communicatively coupled together via at least one leg, and wherein each of the circuits are defined by a source node and a destination node that are interconnected via a series of the nodes, and wherein each circuit is uniquely identified by a circuit identifier (ID), wherein each node of a circuit is configured to:

add to a circuit table at least one circuit that the node is a member of,

wherein the circuit table identifies the at least one circuit by its circuit ID, and

wherein the circuit table includes a tuple that has an identifier of the source node, an identifier of the destination node, an identifier of a source service from the source node, and an identifier of a destination service to the destination node; and

scan a leg table to return an incoming leg and an outgoing leg that are associated with the at least one circuit,

wherein the incoming leg communicatively couples the node with a first adjacent node that is used when the node receives packets from the first adjacent node,

wherein the outgoing leg communicatively couples the node to a second adjacent node that is used when the node communicates packets to the second adjacent node,

wherein the leg table identifies the incoming leg using a first triple that has at least a link ID, a first local leg ID, and a direction that defines an incoming travel direction of packets from the first adjacent node to the node,

wherein the first triple of the leg table is associated with the circuit ID in the circuit table,

wherein the leg table further identifies the outgoing leg using a second triple that has at least the link ID, a second local leg ID, and a direction that defines an outgoing travel direction of packets from the node to the second adjacent node, and

wherein the second triple of the leg table is associated with the circuit ID in the circuit table,

wherein the first adjacent node and the second adjacent node are members of the at least one circuit identified in the circuit table.

2. The system of claim 1,

wherein the at least one circuit is a first circuit identified by a first circuit ID,

wherein the incoming leg is a first incoming leg and the outgoing leg is a first outgoing leg,

wherein the circuit table identifies a second circuit that the node is a member of by a second circuit ID,

wherein the leg table further identifies a second incoming leg and a second outgoing leg that are associated with the second circuit,

wherein the second incoming leg communicatively couples the node with the second adjacent node that is used when the node receives packets from the second adjacent node, and

wherein the second outgoing leg communicatively couples the node to the first adjacent node that is used when the node communicates packets to the first adjacent node.

3. The system of claim 2,

wherein the source node is a first source node,

wherein the destination node is a first destination node,

wherein the tuple is a first tuple,

wherein the circuit table includes a second tuple associated with the second circuit,

wherein the second tuple has an identifier of a second source node, an identifier of a second destination node, an identifier of a source service from the second source node, and an identifier of a destination service to the second destination node,

wherein the first source node and the second destination node are the same node, and

wherein the first destination node and the second source node are the same node.

4. The system of claim 2,

wherein the leg table further identifies the second incoming leg using a third triple that has at least a link ID, a third local leg ID, and a direction that defines an incoming travel direction of packets from the third adjacent node to the node, and

wherein the third triple of the leg table is associated with the second circuit ID.

5. The system of claim 4,

wherein the leg table further identifies the second outgoing leg using a fourth triple that has at least the link ID, a fourth local leg ID, and a direction that defines an outgoing travel direction of packets from the node to the fourth adjacent node,

wherein the fourth triple of the leg table is associated with the second circuit ID, and

wherein the node, the third adjacent node and the fourth adjacent node are members of the second circuit identified in the circuit table.

6. The system of claim 1,

wherein the node receives a first circuit data (CDAT) packet from the first adjacent node via the incoming leg,

wherein the received first CDAT packet comprises at least the first local leg ID of the incoming leg and a payload having data therein,

wherein the node determines the circuit ID based on the first local leg ID in the received first CDAT packet,

wherein the node determines that payload of the received first CDAT packet is to be communicated over the outgoing leg to the second adjacent node based on the circuit ID,

wherein the node communicates a second CDAT packet to the second adjacent node via the outgoing leg, and

wherein the second CDAT packet includes at least the second local leg ID of the outgoing leg and the payload having the data therein.

7. The system of claim 1,

wherein the node receives a first circuit close (CCLS) packet from the first adjacent node via the incoming leg,

wherein the received first CCLS packet includes at least the first local leg ID of the incoming leg,

wherein the node determines the circuit ID based on the first local leg ID in the received first CCLS packet,

wherein the node determines that a second CCLS packet is to be communicated over the outgoing leg to the second adjacent node based on the circuit ID,

wherein the node communicates the second CCLS packet to the second adjacent node via the outgoing leg,

wherein the second CCLS packet includes at least the second local leg ID of the outgoing leg, and

wherein the node removes at least the first triple from the leg table.

8. The system of claim 1, wherein the source service is a first type of communication service, and the destination service is a second type of communication service that is different from the first type of communication service.

9. The system of claim 1, wherein the node is further configured to:

receive a circuit establishment (CEST) packet;

in response to the received CEST packet, establishing the at least one circuit, by;

generate the first triple; and

add the first triple to the leg table.

10. The system of claim 1, wherein the node is further configured to:

after no data has arrived on the at least one circuit for a specified timeout period, perform a timeout procedure that includes destroying all legs and data associated with the circuit ID.

11. A method that enables network communications over circuits defined by a plurality of nodes, wherein adjacent ones of the plurality of nodes are communicatively coupled together via at least one leg, and wherein each of the circuits are defined by a source node and a destination node that are interconnected via a series of the nodes, and wherein each circuit is uniquely identified by a circuit identifier (ID), the method comprising:

by a node that is one of the plurality of nodes,

adding to a circuit table at least one circuit that the node is a member of, wherein the circuit table identifies the at least one circuit by its circuit ID, and wherein the circuit table includes a tuple that has an identifier of the source node, an identifier of the destination node, an identifier of a source service from the source node, and an identifier of a destination service to the destination node; and

scanning a leg table to return an incoming leg and an outgoing leg that are associated with the at least one circuit,

wherein the incoming leg communicatively couples the node with a first adjacent node that is used when the node receives packets from the first adjacent node,

wherein the outgoing leg communicatively couples the node to a second adjacent node that is used when the node communicates packets to the second adjacent node,

wherein the leg table identifies the incoming leg using a first triple that has at least a link ID, a first local leg ID, and a direction that defines an incoming travel direction of packets from the first adjacent node to the node,

wherein the first triple of the leg table is associated with the circuit ID in the circuit table,

wherein the leg table further identifies the outgoing leg using a second triple that has at least the link ID, a second local leg ID, and a direction that defines an outgoing travel direction of packets from the node to the second adjacent node,

wherein the second triple of the leg table is associated with the circuit ID in the circuit table, and

wherein the first adjacent node and the second adjacent node are members of the at least one circuit identified in the circuit table.

12. The method of claim 11, further comprising:

specifying a first circuit identified by a first circuit ID, wherein the at least one circuit is the first circuit,

wherein the incoming leg is a first incoming leg and the outgoing leg is a first outgoing leg,

wherein the circuit table identifies a second circuit that the node is a member of by a second circuit ID,

wherein the leg table further identifies a second incoming leg and a second outgoing leg that are associated with the second circuit,

wherein the second incoming leg communicatively couples the node with the second adjacent node that is used when the node receives packets from the second adjacent node, and

wherein the second outgoing leg communicatively couples the node to the first adjacent node that is used when the node communicates packets to the first adjacent node.

13. The method of claim 12,

wherein the source node is a first source node,

wherein the destination node is a first destination node,

wherein the tuple is a first tuple,

wherein the circuit table includes a second tuple associated with the second circuit,

wherein the second tuple has an identifier of a second source node, an identifier of a second destination node, an identifier of a source service from the second source node, and an identifier of a destination service to the second destination node,

wherein the first source node and the second destination node are the same node, and

wherein the first destination node and the second source node are the same node.

14. The method of claim 12,

identifying, with the leg table, the second incoming leg using a third triple that has at least a link ID, a third local leg ID, and a direction that defines an incoming travel direction of packets from the third adjacent node to the node, and

wherein the third triple of the leg table is associated with the second circuit ID.

15. The method of claim 14, further comprising:

identifying, with the leg table, the second outgoing leg using a fourth triple that has at least the link ID, a fourth local leg ID, and a direction that defines an outgoing travel direction of packets from the node to the fourth adjacent node,

wherein the fourth triple of the leg table is associated with the second circuit ID, and

wherein the node, the third adjacent node and the fourth adjacent node are members of the second circuit identified in the circuit table.

16. The method of claim 11, further comprising

receiving a first circuit data (CDAT) packet from the first adjacent node via the incoming leg,

wherein the received first CDAT packet comprises at least the first local leg ID of the incoming leg and a payload having data therein,

wherein the node determines the circuit ID based on the first local leg ID in the received first CDAT packet,

wherein the node determines that payload of the received first CDAT packet is to be communicated over the outgoing leg to the second adjacent node based on the circuit ID,

wherein the node communicates a second CDAT packet to the second adjacent node via the outgoing leg, and

wherein the second CDAT packet includes at least the second local leg ID of the outgoing leg and the payload having the data therein.

17. The method of claim 11, further comprising:

receiving a first circuit close (CCLS) packet from the first adjacent node via the incoming leg,

wherein the received first CCLS packet includes at least the first local leg ID of the incoming leg,

wherein the node determines the circuit ID based on the first local leg ID in the received first CCLS packet,

wherein the node determines that a second CCLS packet is to be communicated over the outgoing leg to the second adjacent node based on the circuit ID,

wherein the node communicates the second CCLS packet to the second adjacent node via the outgoing leg,

wherein the second CCLS packet includes at least the second local leg ID of the outgoing leg, and

wherein the node removes at least the first triple from the leg table.

18. The method of claim 11, wherein the source service is a first type of communication service, and the destination service is a second type of communication service that is different from the first type of communication service.

19. The method of claim 11, further comprising:

receiving a circuit establishment (CEST) packet;

in response to the received CEST packet, establishing the at least one circuit, by;

generating the first triple; and

adding the first triple to the leg table.

20. The method of claim 11, further comprising:

after no data has arrived on the at least one circuit for a specified timeout period, performing a timeout procedure that includes destroying all legs and data associated with the circuit ID.