Protocol link layer
A link is a software abstraction that represents a direct connection between two CoCo nodes. The link layer detects the presence of neighboring devices and establishes links to them. A protocol abstraction layer converts data frames that arrive on network interfaces into packet objects used by the COCO Protocol Suite.
1. A non-transitory computer-readable medium having computer-executable instructions operable to enable a first network node to perform a method of establishing a secure communication link with a second network node over which packets may be sent, the method comprising:
computing, at the first network node, a work token, the work token including at least a work token validity interval (WTVI) that defines a period of time that the work token is valid; and
communicating a link setup packet from the first network node to the second network node, wherein the link setup packet includes at least the work token and a time stamp corresponding to a time that the work token was computed.
2. The medium of claim 1 , further comprising:
determining whether the work token period has expired based on a current time, the time that the work token was computed, and the WTVI; and
if the work token has expired, computing a new work token prior to communicating a new link setup packet.
3. The medium of claim 1 , wherein the WTVI is at least equal to a hello interval and is less than an acknowledgement interval.
4. The medium of claim 1 , wherein the link setup packet further includes a hello number that is a sequence number that is incremented each time the link setup packet is communicated from the first network node.
5. The medium of claim 1 , further comprising:
receiving an acknowledgement from the second node, wherein the acknowledgement includes a public key of the second network node.
6. The medium of claim 5 , wherein the received acknowledgement is piggybacked onto the link setup packet which is returned to the first network node, and wherein the returned link setup packet includes an acknowledgement number indicating the number of acknowledgements that are piggybacked onto the returned link setup packet.
7. The medium of claim 5 , further comprising:
communicating a public key of the first network node to the second network node;
computing a Diffie-Hellman key that is valid only between the first network node and the second network node; and
storing, at the first network node, the computed Diffie-Hellman key.
8. The medium of claim 7 , further comprising:
receiving, at the first network node, a link data packet with user data from the second network node; and
determining that the later communicated link data packet with user data received from the second network node is valid based upon the stored Diffie-Hellman key.
9. The medium of claim 7 , wherein the Diffie-Hellman key is associated with a Diffie-Hellman cache interval (DHCI), wherein the DHCI defines a time interval that the Diffie-Hellman key is valid, and wherein the Diffie-Hellman key is purged from memory at the first network node upon expiration of the DHCI.
10. A method that enables a first network node to establish a secure communication link with a second network node over which packets may be sent, the method comprising:
computing, at the first network node, a work token, the work token including at least a work token validity interval (WTVI) that defines a period of time that the work token is valid; and
communicating a link setup packet from the first network node to the second network node, wherein the link setup packet includes at least the work token and a time stamp corresponding to a time that the work token was computed.
11. The method of claim 10 , further comprising:
determining whether the work token period has expired based on a current time, the time that the work token was computed, and the WTVI; and
if the work token has expired, computing a new work token prior to communicating a new link setup packet.
12. The method of claim 10 , wherein the WTVI is at least equal to a hello interval and is less than an acknowledgement interval.
13. The method of claim 10 , wherein the link setup packet further includes a hello number that is a sequence number that is incremented each time the link setup packet is communicated from the first network node.
14. The method of claim 10 , further comprising:
receiving an acknowledgement from the second node, wherein the acknowledgement includes a public key of the second network node.
15. The method of claim 14 , wherein the received acknowledgement is piggybacked onto the link setup packet which is returned to the first network node, and wherein the returned link setup packet includes an acknowledgement number indicating the number of acknowledgements that are piggybacked onto the returned link setup packet.
16. The method of claim 14 , further comprising:
communicating a public key of the first network node to the second network node;
computing a Diffie-Hellman key that is valid only between the first network node and the second network node; and
storing, at the first network node, the computed Diffie-Hellman key.
17. The method of claim 16 , further comprising:
receiving, at the first network node, a link data packet with user data from the second network node; and
determining that the later communicated link data packet with user data received from the second network node is valid based upon the stored Diffie-Hellman key.
18. The method of claim 16 , wherein the Diffie-Hellman key is associated with a Diffie-Hellman cache interval (DHCI), wherein the DHCI defines a time interval that the Diffie-Hellman key is valid, and wherein the Diffie-Hellman key is purged from memory at the first network node upon expiration of the DHCI.