Abstract: The present invention relates to a method for reducing interference in a cellular radio communication network, said network comprising a plurality of base stations and a plurality of terminals to be scheduled on frequency and/or time resources. According to the present invention, the method comprises the steps of: determining interference parameters from at least two base stations; reporting said interference parameters from said at least two base stations to an interference coordinator; determining at said interference coordinator resources to be allocated to said plurality of terminals minimising an overall interference criterion; reporting from said interference coordinator to said at least two base stations the resource allocated to the different terminals.

Abstract: A data structure and corresponding search methods are disclosed for improving the performance of table lookups. A data structure for the table is employed using a single hash table with hash table entries pointing to tree fragments that are contiguous in main memory and can be efficiently loaded into a local data store or cache. Decision nodes are stored in a contiguous block of memory in a relative position based on the position of the decision node in the tree structure, including blank positions. Leaf nodes are stored in a contiguous block of memory based on the position of the leaf node in the tree structure, concatenating leaf nodes to eliminate blank positions. Leaf nodes of the tree fragments contain indicia of a data record, or indicia of another tree fragment. The data structure and corresponding search algorithm are employed for searches based on a longest prefix match in an internet routing table.

Abstract: A data structure and corresponding search methods are disclosed for improving the performance of table lookups. A data structure for the table is employed using a hash table with hash table entries pointing to tree fragments that are contiguous in main memory and can be efficiently loaded into a local data store or cache. Leaf nodes of the tree fragments contain indicia of a data record, or indicia of another tree fragment. The data structure and corresponding search algorithm are employed for searches based on a longest prefix match in an internet routing table.