BIT MASK TO OBTAIN UNIQUE IDENTIFIER

• US 20100278533A1
• Filed: 04/30/2009
• Published: 11/04/2010
• Est. Priority Date: 04/30/2009
• Status: Abandoned Application

• Current Assignee: Telefonaktiebolaget LM Ericsson
• Original Assignee: Telefonaktiebolaget LM Ericsson
• Inventors: Gordon, David, Brunner, Robert, Beliveau, Ludovic, Julien, Martin
• Application Number:
  US12/433,355
• Publication Number:
  US 20100278533A1
• Time in Patent Office: Days
• US Class Current: 398/58
• CPC Class Codes: H04J 14/0232 for downstream transmission
• CPC Class Codes: H04J 14/0238 Wavelength allocation for communications one-to-many, e.g. multicasting wavelengths
• CPC Class Codes: H04J 14/0247 Sharing one wavelength for at least a group of ONUs
• CPC Class Codes: H04J 14/0252 Sharing one wavelength for at least a group of ONUs, e.g. for transmissions from-ONU-to-OLT or from-ONU-to-ONU
• CPC Class Codes: H04Q 11/0067 Provisions for optical access or distribution networks, e.g. Gigabit Ethernet Passive Optical Network (GE-PON), ATM-based Passive Optical Network (A-PON), PON-Ring
• CPC Class Codes: H04Q 2011/0079 Operation or maintenance aspects
• CPC Class Codes: H04Q 2011/0088 Signalling aspects

Abstract

Methods and communication nodes for assigning unique identifiers to a plurality of nodes. A plurality of data values are maintained in memory, each being associated to one of the nodes. A bit mask value is obtained that, when applied to the plurality of data values, produces a plurality of unique identifiers. The bit mask value is made available to the nodes thereby assigning a unique identifier to each of the nodes.

Claims

1. A method for assigning unique identifiers to a plurality of nodes comprising the steps of:

maintaining a plurality of data values in a memory, each being associated to one of the nodes;

obtaining a bit mask value that, when applied to the plurality of data values, produces a plurality of unique identifiers; and

sending the bit mask value to the nodes in order to assign a unique identifier to each of the nodes.

2. The method of claim 1 wherein the step of maintaining the plurality of data values is performed by storing each of the plurality of data values in the memory of an Optical Line Terminal (OLT), wherein each of the plurality of nodes is an Optical Network Unit (ONU), each of the data values corresponding to a serial number of its related ONU.

3. The method of claim 2 further comprising a first step of, prior to the step of maintaining the plurality of data values in the OLT, obtaining the serial numbers from the plurality of ONUs from a discovery procedure.

4. The method of claim 1 further comprising a step of, following the step of obtaining the bit mask value, storing the bit mask value in the memory.

5. The method of claim 4 wherein the step of obtaining the bit mask value is performed by iteratively:

computing a preliminary bit mask value; and

applying the preliminary bit mask value to the plurality of data values;

until the plurality of unique identifiers is obtained in which case the preliminary bit mask value provides the bit mask value.

6. The method of claim 1 wherein the step of obtaining the bit mask value is performed by reading an appropriate value from the memory.

7. The method of claim 1 wherein the step of sending the bit mask value is performed by sending a broadcast message to the plurality of nodes.

8. The method of claim 1 wherein the step of sending the bit mask value is performed by sending a multicast message to the plurality of nodes.

9. The method of claim 1 further comprising steps of, following the step of obtaining the bit mask value:

determining the plurality of unique identifiers for each of the nodes; and

storing the plurality of unique identifiers in the memory.

10. The method of claim 9 further comprising a step of subsequently receiving traffic from one of the plurality of nodes containing the unique identifier of the one node, wherein the unique identifier of the one node has been obtained therein using the bit mask value.

11. The method of claim 9 further comprising a step of subsequently using one of the unique identifiers to send a unicast message to any one of the plurality nodes.

12. The method of claim 1 further comprising steps of:

obtaining a further data value for a newly discovered node; and

storing the further data value of the newly discovered node in the memory.

13. The method of claim 12 further comprising steps of:

determining a further unique identifier for the newly discovered node; and

sending the further unique identifier to the newly discovered node in an Assign_ONU-ID message.

14. The method of claim 12 further comprising a step of verifying if the bit mask value, when applied to the further data value, produces a further unique identifier when compared to the plurality of unique identifiers.

15. The method of claim 14 further comprising steps of

if the further unique identifier is not in the plurality of unique identifiers:

sending the bit mask value to the newly discovered node; and

storing the further unique identifier in the memory.

else, computing a new bit mask before sending the new bit mask to the newly discovered node.

16. A method for obtaining a unique identifier for a node comprising the steps of:

maintaining a data value in the node;

obtaining a bit mask value in the node;

applying the bit mask value to the data value thereby obtaining a unique identifier for the node; and

storing the unique identifier in a memory.

17. The method of claim 16 further comprising a step of storing the bit mask value in the memory.

18. The method of claim 16 further comprising steps of:

subsequently receiving traffic; and

discarding the traffic if it is not broadcast and does not contain the unique identifier.

19. The method of claim 16 further comprising a step of subsequently using the unique identifier upon sending traffic.

20. A communications node comprising:

a secondary storage capable of maintaining;

at least one data value;

one unique identifier associated with each of the at least one data value; and

a bit mask value;

a memory for storing program instructions associated with the generation of the unique identifier; and

a processor for executing the program instructions causing the bit mask value to be applied to the data value thereby obtaining the associated unique identifier.

21. The communications node of claim 20, wherein the associated unique identifier is associated to the communication node, the communication node further comprising a communication interface for:

prior to executing the program instructions, receiving the bit mask value, wherein the received bit mask value is thereafter stored in the secondary storage; and

subsequently to obtaining the associated unique identifier, sending traffic containing the associated unique identifier.

22. The communications node of claim 20, wherein the associated unique identifier is associated to the communication node, the communication node further comprising a communication interface for:

subsequently to obtaining the associated unique identifier, receiving traffic; and

discarding the traffic if it is not broadcast and does not contain the associated unique identifier.

23. The communications node of claim 20, wherein the secondary storage maintains a plurality of data values, each being associated to one of a plurality of nodes and wherein each of the plurality of nodes is an Optical Network Unit (ONU) and each of the data values corresponding to a serial number of its related ONU.

24. The communications node of claim 23 further comprising a communication interface for, prior to maintaining the plurality of data values, obtaining the serial numbers from the plurality of ONUs from a discovery procedure.

25. The communications node of claim 20 wherein the memory stores further program instructions associated with the generation of the bit mask value, the processor being capable of obtaining the bit mask value upon execution of the further program instructions by iteratively:

computing a preliminary bit mask value; and

applying the preliminary bit mask value to the plurality of data values;

until each unique identifier associated to the plurality of data values is obtained in which case the preliminary bit mask value provides the bit mask value.

26. The communications node of claim 20 further comprising a communication interface for sending the bit mask value into a broadcast message a plurality of nodes.

27. The communications node of claim 20 further comprising a communication interface for sending the bit mask value into a multicast message to a plurality of nodes.

28. The communications node of claim 26 wherein the communication interface further subsequently receives traffic from one of the plurality of nodes containing the unique identifier of the one node, wherein the unique identifier of the one node has been obtained therein using the bit mask value.

29. The communications node of claim 26 wherein the communication interface further subsequently uses one of the unique identifiers to send a unicast message to any one of the plurality nodes.