All The Claims

1. A method performed by a self-organizing network (SON) function implemented in a network manager (NM) in a cellular telecommunications network, the network including the NM, and a plurality of network elements (NEs) each having a NE SON function implemented therein, wherein each NE SON function is associated with one or more network cells, the method comprising the NM SON function:
obtaining operational data relating to the network;
evaluating a current network condition based on the operational data;
determining, based on the current network condition, an allowable set of configuration parameters, wherein the allowable set of configuration parameters defines combinations of cell configuration parameters that a NE SON function is permitted to use when reconfiguring an associated cell; and
providing the allowable set of configuration parameters in a NE configuration attribute sent to the NE SON function.
2. The method of claim 1, further comprising the NM son function:
determining a set of specific actions based on the current network condition in the configuration attribute; and
providing the set of specific actions to the NEs, wherein a specific action causes an NE to perform a specified reconfiguration action in response to a change in network conditions.
3. The method of claim 1, wherein the attribute is provided to the NEs from the NM SON function over an Itf-N interface.
4. A method performed by a self-organizing network (SON) function implemented by a given network element (NE) in a cellular telecommunications network, the network including a plurality of NEs, each implementing a NE SON function, and a network manager (NM) implementing a NM SON function, wherein each NE SON function is associated with one or more network cells, the method comprising a NE SON function of the given NE:
receiving, from the NM SON function, an NE configuration attribute defining combinations of cell configuration parameters that the NE SON function of the given NE is permitted to use when reconfiguring an associated cell;
monitoring network conditions that relate to the associated cell; and
in response to changes in the monitored network conditions, reconfiguring the associated cell using cell configuration parameters in accordance with the received configuration attribute.
5. The method of claim 4:
wherein the configuration attribute received from the NM SON function includes a set of specific actions; and
wherein the NE SON function of the given NE performs a reconfiguration action specified in the set of specific actions in response to a change in the monitored network conditions.
6. The method of claim 4, wherein the cell configuration parameters include an antenna tilt parameter, and wherein the NE configuration attribute defines a set of antenna tilt values to be used depending on whether one or more neighboring cells are active or inactive.
7. The method of claim 6, wherein the NE configuration attribute is a Neighbor Off Tilt Values attribute including one or more pairs of tilt range values and Cell ID lists, with each pair including a Cell ID list and an allowable range of antenna tilt values that should be applied in a given cell when a neighboring cell in the Cell ID list is switched off.
8. The method of claim 7, wherein in response to the given NE receiving a notification from a neighboring cell that the neighboring cell has become inactive, the NE SON function of the given NE selects new allowed tilt values from the Neighbor Off Tilt Values attribute based on which Cell ID list the neighboring cell is included in.
9. The method of claim 8, wherein in response to the given NE receiving a notification from the neighboring cell that the neighboring cell is becoming active and the neighboring cell is not included in any Cell ID list of the Neighbor Off Tilt Values attribute, the NE SON function of the given NE selects new allowed tilt values from the Neighbor Off Tilt Values attribute based on other neighboring cells that are inactive and are included in a Cell ID list of the Neighbor Off Tilt Values attribute.
10. The method of claim 4, wherein the NE configuration attribute includes a frequency domain resource allocation parameter and a set of specific actions that includes an instruction for the NE to set the frequency domain resource allocation parameter to a specified frequency band when the NE detects interference from neighboring cells.
11. The method of claim 10:
wherein the NE configuration attribute is a Protected Band attribute specifying a set of interference-free bands that are allowed to be used by a cell as a protected band;
wherein the NE configuration attribute includes a listing of allowed frequency bands that may be used as protected frequency bands for the cell; and
wherein the NE reserves the protected band for the cell using an indication in a Load Information message sent over an X2 interface.
12. The method of claim 11, wherein when a need arises to obtain an interference free band for a cell, the given NE sends the Load Information message to NEs associated with the neighboring cells over the X2 interface, the Load Information Message indicating the Protected Band attribute.
13. The method of claim 12, wherein the given NE sends the Load Information message to a neighboring cell so that the neighboring cell can avoid scheduling users on the band indicated in the Load Information message.
14. The method of claim 4:
wherein the cell configuration parameters include a load-dependent antenna tilt parameter; and
wherein the NE configuration attribute defines values of the load-dependent antenna tilt parameter that the NE can use depending on values of antenna tilt parameters being used in neighboring cells.
15. The method of claim 14:
wherein the NE configuration attribute is a Tilt Value Combinations attribute specifying the allowable range of tilt values that should be applied in the associated cell when specified neighbor cells have given tilt values;
wherein the attribute includes a listing of values of: Tilt Range, Tilt of Neighbors, and Cell IDs; and
wherein the Tilt Range specifies a range of allowed tilt values in the cell when neighboring cells identified by the Cell IDs have tilt values given by the corresponding Tilt of Neighbors values.
16. The method of claim 15:
wherein, in response to the given NE receiving an indication of a tilt value change from one of the specified neighboring cells, the NE SON function of the given NE selects a tilt value for the associated cell that falls within the allowable Tilt Range for the associated cell based on the Tilt of Neighbors values listed for each of the neighboring Cell IDs matching the current tilt values of the neighbor cells given in the received indication message; and
wherein the NE SON function of the given cell adjusts the tilt of the antenna of the associated cell using the selected tilt value.
17. The method of claim 15, wherein when the NE SON Function of the given NE wishes to change the antenna tilt value of an associated cell, it sends an indication of a tilt value change in a message to NEs associated with the neighboring cells, specifying the new tilt value.
18. A network manager (NM) of a cellular telecommunications network that also includes a plurality of network elements (NEs), wherein each NE is associated with one or more network cells, the NM comprising:
an inputoutput circuit configured to send and receive signals and data to and from other entities in the network;
memory storing data and programming instructions; and
a processor configured to execute the programming instructions, including instructions for implementing a self-organizing network (SON) function, which configures the NM to:
obtain operational data relating to the network;
evaluate a current network condition based on the operational data;
based on the current network condition, determine an allowable set of combinations of configuration parameter settings, wherein the allowable set of combinations defines combinations of cell configuration parameters that a NE is permitted to use when reconfiguring an associated cell; and
provide the allowable set of combinations in a NE configuration attribute sent to the N Es.
19. The NM of claim 18, wherein the SON function also configures the NM to:
determine a set of specific actions based on the network condition;
provide the NEs with the specific action set in the configuration attribute;
wherein a specific action causes an NE to perform a specified reconfiguration action in response to a change in network conditions.
20. A network element (NE) of a cellular telecommunications network that also includes a network manager (NM), wherein the NE is associated with one or more network cells, the NE comprising:
an inputoutput circuit configured to send and receive signals and data to and from other entities in the network;
memory storing data and programming instructions; and
a processor configured to execute the programming instructions, including a self-organizing network (SON) which configures the NE to:
store in the memory an allowable set of combinations of cell configuration parameters received from the NM in a NE configuration attribute;
monitor network conditions related to the one or more associated cells; and
in response to changes in the monitored network conditions, reconfigure a cell using cell configuration parameters in accordance with the NE configuration attribute.
The claims below are in addition to those above.
All refrences to claim(s) which appear below refer to the numbering after this setence.

What is claimed is:

1. A light-emitting diode comprising:
an active layer that emits photons;
a window layer that is transparent for said emitted photons and on which contacts for feeding current into said active layer are formed, said contacts being formed by interconnect lines, said window layer further comprising lateral surfaces proceeding along said interconnect lines that are profiled with projections extending transversely relative to said interconnect lines.
2. The light-emitting diode according to claim 1, wherein said projections come to a point.
3. The light-emitting diode according to claim 1, wherein said projections comprise a triangular base area.
4. The light-emitting diode according to claim 1, wherein said projections form a sawtooth-shaped profile on said lateral surfaces.
5. The light-emitting diode according to claim 2, wherein an apex angle of said projections coming to a point is less than 10 in said point.
6. The light-emitting diode according to claim 1, wherein an angle between a normal of sidewalls of said projections relative to a normal of said active layer lies between 45 and 88.
7. The light-emitting diode according to claim 1, wherein said lateral surfaces extend across said active layer.
8. The light-emitting diode according to claim 7, wherein said projections are prism-shaped.
9. The light-emitting diode according to claim 1, wherein a ratio of height to width of a constriction of a profiled edge web of said window layer is greater than 0.1 and less than 10.
10. The light-emitting diode according to claim 1 wherein said interconnect lines are fashioned as interconnects running all around and along the edge of said light-emitting diode.
11. The light-emitting diode according to claim 10, wherein said all around interconnects are connected to a central contact location by connecting tracks insulated from said window layer. 12. The light-emitting diode according to claim 10 wherein said all around interconnects are provided on edge webs.

1. A computer-implemented method, comprising:
identifying one or more influences within a network, the identifying comprising:
representing the network as a graph comprising a plurality of nodes, the graph being further represented by an adjacency matrix;
multiplying a random probe vector vi by a resolvent function (A\u2212zI)\u22121, wherein A is the adjacency matrix, I is an identity matrix, and z is a selected scalar number
using a result of the multiplying the random probe vector by the resolvent function as an approximation of a product of a matrix exponential and the random probe vector;
computing, by a computer processor, a diagonal of the adjacency matrix based on the product of the matrix exponential and the random probe vector, wherein the computing comprises:
initializing vectors Q, W, and D of length N to zero, wherein the vector D represents the diagonal;
initializing the random probe vector vi;
computing the product of the matrix and the random probe vector;
updating the vector Q by calculating Q=Q+vi.\xd7Z, where Z is the product of the matrix and the random probe vector, wherein .x symbolizes element-wise multiplication;
updating the vector W by calculating W=W+vi.\xd7vi;
updating the vector D by calculating D=D+Q .W, wherein . symbolizes element-wise division; and
repeating the initializing the random probe vector, the computing the product, the updating the vector Q, the updating the vector W, and the updating the vector D until at least one of (a) the difference of a previously estimated diagonal and an estimated diagonal is smaller than a designated diagonal tolerance, and (b) a percentage of nodes with target centrality has converged; and

calculating node centralities of the graph based on the computed diagonal of the adjacency matrix.
2. The computer-implemented method of claim 1, wherein the approximating of the product of the matrix and the random probe vector further comprises:
computing an orthogonal Krylov basis and tridiagonal matrix, based on the adjacency matrix, using a Lanczos algorithm;
computing a matrix exponential of the tridiagonal matrix; and
computing a current approximation of the product of the matrix exponential and the random probe vector.
3. The method of claims 1, wherein the network is a social network, wherein identifying the one or more influencers within the network comprises identifying one or more influential people in the social network, and the method further comprising:
selecting one or more central nodes of the graph, based on the node centralities, representing the one or more influential people in the social network.
4. A computer program product comprising a non-transitory computer readable storage medium having program instructions embodied therewith, the program instructions executable by a processor to cause the processor to perform a method comprising:
identifying one or more influences within a network, the identifying comprising:
representing the network as a graph comprising a plurality of nodes, the graph being further represented by an adjacency matrix;
multiplying a random probe vector vi by a resolvent function (A\u2212zI)\u22121, wherein A is the adjacency matrix, I is an identity matrix, and z is a selected scalar number;
using a result of the multiplying the random probe vector by the resolvent function as an approximation of a product of a matrix exponential and the random probe vector;
computing a diagonal of the adjacency matrix based on the product of the matrix exponential and the random probe vector, wherein the computing comprises:
initializing vectors Q, W, and D of length N to zero, wherein the vector D represents the diagonal;
initializing the random probe vector vi;
computing the product of the matrix and the random probe vector;
updating the vector Q by calculating Q=Q+vi .x Z, where Z is the product of the matrix and the random probe vector, wherein .x symbolizes element-wise multiplication;
updating the vector W by calculating W=W+vi .x vi;
updating the vector D by calculating D=D+Q .W, wherein . symbolizes element-wise division; and
repeating the initializing the random probe vector, the computing the product, the updating the vector Q, the updating the vector W, and the updating the vector D until at least one of (a) the difference of a previously estimated diagonal and an estimated diagonal is smaller than a designated diagonal tolerance, and (b) a percentage of nodes with target centrality has converged; and

calculating node centralities of the graph based on the computed diagonal of the adjacency matrix.
5. The computer program product of claim 4, wherein the approximating of the product of the matrix and the random probe vector further comprises:
computing an orthogonal Krylov basis and tridiagonal matrix, based on the adjacency matrix, using a Lanczos algorithm;
computing a matrix exponential of the tridiagonal matrix; and
computing a current approximation of the product of the matrix exponential and the random probe vector.
6. The computer program product of claim 4, wherein the network is a social network, wherein identifying the one or more influencers within the network comprises identifying one or more influential people in the social network, and the method further comprising:
selecting one or more central nodes of the graph, based on the node centralities, representing the one or more influential people in the social network.
The claims below are in addition to those above.
All refrences to claim(s) which appear below refer to the numbering after this setence.

1. A method for buffering data in a network device, the method comprising the steps of:
initializing a plurality of output queues;
determining to which of the plurality of output queues data arriving at the network device is destined;
storing the data in one or more buffers, wherein the one or more buffers is selected from a data memory group including an internal data memory and an external data memory; and
enqueuing the one or more buffers to the destined output queue.
2. The method of claim 1, wherein:
the plurality of output queues are initialized by associating at least one output queue with the internal data memory and at least another output queue with the external data memory; and
the data is stored according to a static queuing scheme.
3. The method of claim 2, wherein the static queuing scheme includes:
storing the data in the one or more buffers of the data memory group to which the destined output queue is associated.
4. The method of claim 2, wherein the static queuing scheme includes:
storing the data in both an internal data memory location and an external data memory location; and
purging the data from the storage location to which the destined output queue is not associated.
5. The method of claim 2, wherein the static queuing scheme includes:
storing the data in only one of an internal data memory location and an external data memory location; and
moving the data from the storage location to which the destined output queue is associated if the destined output queue is associated with a different storage location.
6. The method of claim 2, wherein the static queuing scheme includes:
storing the data in an internal data memory location; and
moving the data from the internal data memory location to an external data memory location if the destined output queue is associated with the external data memory location.
7. The method of claim 2, wherein:
the data belongs to a class of datas, the class of datas including a multicast data, a broadcast data, a unicast data that is mirrored to at least two output queues, and a unicast data that is copied between at least two output queues;
the destined output queue includes the at least two queues; and
the one or more buffers includes at least one storage instance.
8. The method of claim 7, where in the plurality of output queues includes one or more of an internal queue, an external queue and an aggregate queue.
9. The method of claim 1, wherein:
the plurality of output queues are initialized to be capable of selectively choosing between the internal data memory and the external data memory;
the data is stored according to a dynamic queuing scheme.
10. The method of claim 9, wherein the dynamic queuing scheme includes, if both the internal data memory and the external data memory are available, choosing the internal data memory first and the external data memory second.
11. The method of claim 9, wherein the dynamic queuing scheme includes, if only one of the internal data memory and the external data memory is available, choosing the one available.
12. The method of claim 9, where in the plurality of output queues includes one or more of an internal queue, an external queue and an aggregate queue.
13. The method of claim 1, wherein the data memory is partitioned into a plurality of full-size data buffers.
14. The method of claim 1, wherein the data memory is partitioned into a plurality of cell-based buffers, each of a size less than a full-sized data.
15. The method of claim 14, wherein the one or more buffers includes at least two of the plurality of cell-based buffers.
16. A network device, the device comprising processing logic, wherein the processing logic is capable of:
initializing a plurality of output queues;
determining to which of the plurality of output queues a data arriving at the network device is destined;
storing the data in one or more buffers, wherein the one or more buffers is selected from a data memory group including an internal data memory and an external data memory; and
enqueuing the one or more buffers to the destined output queue.
17. The device of claim 16, wherein:
the plurality of output queues are initialized by associating at least one output queue with the internal data memory and at least another output queue with the external data memory; and
the data is stored according to a static queuing scheme.
18. The device of claim 17, wherein the static queuing scheme includes:
storing the data in the one or more buffers of the data memory group to which the destined output queue is associated.
19. The device of claim 17, wherein the static queuing scheme includes:
storing the data in both an internal data memory location and an external data memory location; and
purging the data from the storage location to which the destined output queue is not associated.
20. The device of claim 17, wherein the static queuing scheme includes:
storing the data in only one of an internal data memory location and an external data memory location; and
moving the data from the storage location to which the destined output queue is associated if the destined output queue is associated with a different storage location.
21. The device of claim 17, wherein:
the data belongs to a class of datas, the class of datas including a multicast data, a broadcast data, a unicast data that is mirrored to at least two output queues, and a unicast data that is copied between at least two output queues;
the destined output queue includes the at least two queues; and
the one or more buffers includes at least one storage instance.
22. The device of claim 21, where in the plurality of output queues includes one or more of an internal queue, an external queue and an aggregate queue.
23. The device of claim 16, wherein:
the plurality of output queues are initialized to be capable of selectively choosing between the internal data memory and the external data memory;
the data is stored according to a dynamic queuing scheme.
24. The device of claim 23, wherein the dynamic queuing scheme includes, if both the internal data memory and the external data memory are available, choosing the internal data memory first and the external data memory second.
25. The device of claim 23, wherein the dynamic queuing scheme includes, if only one of the internal data memory and the external data memory is available, choosing the one available.
26. The device of claim 23, where in the plurality of output queues includes one or more of an internal queue, an external queue and an aggregate queue.
27. The device of claim 16, wherein the data memory is partitioned into a plurality of full-size data buffers.
28. The device of claim 16, wherein the data memory is partitioned into a plurality of cell-based buffers, each of a size less than a full-sized data.
29. The device of claim 28, wherein the one or more buffers includes at least two of the plurality of cell-based buffers.