Abstract: A subscriber portfolio model is created by forming mutually exclusive and completely exhaustive groups of subscribers in a way that maximizes the intra-group similarity and inter-group dissimilarity of the value of a target attribute among subscribers in the groups. The subscriber groups thus generated are self-descriptive, as the groups are defined by the attributes used to form them. A segmenting algorithm groups subscribers along permutations of attributes. Relevant data about subscribers is collected from various sources, correlated, and subscriber identities removed to ensure privacy. After analyzing the aggregated data, a subscriber portfolio model is built. The subscriber portfolio model is created in an iterative process, where in each step, a selected subscriber group is subdivided into smaller subscriber groups along different value ranges of a statistically decisive attribute that is selected and evaluated based on specific methods.

Abstract: A method and apparatus for controlling data traffic in a communications network. The server determines that network conditions are suitable for sending delay tolerant data traffic, and as a result of the determination, it transmits a grant message to at least one client device, the grant message informing the client device that it is permitted to send or receive delay tolerant data traffic.

Abstract: A network management system (100) and a method are described herein that are capable of identifying and accessing Quality of Service (QoS) issues within a communications network (104, 106). In one application, the network management system (100) includes a service performance unit (108), a service performance database (110), a factor scoring system (112), a factor score database (114) and a factor strength analysis module (116).

Abstract: A performance management system and method are described herein that can control which client terminal(s) (e.g., mobile terminal(s)) are to provide Quality of Experience, QoE, report(s) and also control a level of detail for the requested QoE report(s).

Abstract: The present invention provides a method for optimization of the configuration of a hierarchical network having a first hierarchy level (LEVEL(j?1)), a second hierarchy level (LEVEL(j)) next below the first level, and a third hierarchy level (LEVEL(j+1)) next below the second level, each level comprising nodes (RNC's, HUB's, RBS's) each of which, in level other than the lowest, receives traffic from a cluster of nodes (HUB's, RBS's) of the level next below. The method comprises first determining an initial arrangement of nods (RNC's, HUB's, RBS's) in each of the levels other than the highest, allocating respective initial clusters of nodes (HUB's, RBS's) of that level to the nodes (RNC's, HUB's) of the next higher level, and performing optimizing iterations until they result in no changes in number, disposition and allocation of nodes (RNC's, HUB's, RBS's) over predetermined number of iterations.

Abstract: The present invention provides a method for optimization of the configuration of a hierarchical network having a first hierarchy level (LEVEL(j−1)), a second hierarchy level (LEVEL(j)) next below the first level, and a third hierarchy level (LEVEL(j+1)) next below the second level, each level comprising nodes (RNC's, HUB's, RBS's) each of which, in level other than the lowest, receives traffic from a cluster of nodes (HUB's, RBS's) of the level next below. The method comprises first determining an initial arrangement of nods (RNC's, HUB's, RBS's) in each of the levels other than the highest, allocating respective initial clusters of nodes (HUB's, RBS's) of that level to the nodes (RNC's, HUB's) of the next higher level, and performing optimizing iterations until they result in no changes in number, disposition and allocation of nodes (RNC's, HUB's, RBS's) over predetermined number of iterations.