Alcatel Lucent

International Business Machines Corporation

Sprint Communications Comapny L.p.

Inria Institut National De Recherche En Informatique Et En Automatique

Francois Baccelli

Zhen Liu

Anton Viktorovich Riabov

Hui Zang

Jean C Bolot

Augustin Chaintreau

Chung Shue Chen

Laurent Thomas

Sambit Sahu

Afef Feki

Dohy Hong

Danny De Vleeschauwer

Koenraad Laevens

Bartlomiej Blaszczyszyn

Florent Tournois

Anton Riabov

A method for attaching a user terminal to a base station of a network is disclosed, said network comprising base stations. The method including defining a global cost function which is a weighted sum of the user terminal transmission delays, over all the user terminals in the network, using a user terminal's context weighting factor representing a user terminal's characteristic; defining a local cost function for each user terminal from said global cost function, said local cost function taking into account said user terminal's context weighting factor for each user terminal, and being a function of the base station to which this user terminal is associated; running a Gibbs sampler with said local cost function for producing user-base station association probabilities; choosing the user-base station association probability which favors low local cost; and attaching said user terminal to a base station according to the user-base station association probability chosen.

Method for attaching a user terminal to a base station of a network

A method for control of congestion of traffic, being categorized according to a number of layers (L), in a network node, comprises a step of monitoring the amount (n(t)) of incoming flows to this node such that, based upon this amount (n(t)) of incoming flows and on a current number of accepted layers (l(t)), a next number of accepted layers (l(t+1)) for entry into said node is determined by consultation of an action table (T). In an enhanced embodiment the action table is adjusted based on the observed traffic during an observation period.

Method and apparatus for congestion control

An embodiment of the current invention is directed to facilitating a location-based service for use by a given mobile-device. A location of each of a number of base stations that makes up a portion of a wireless-telecommunications-network is identified. For a given base station, the probability that it provides a level of signal coverage to a geographical area that would enable the mobile-device in the first geographical area to communicate with the network is determined. A density of possible locations that the mobile-device may be within the geographical area is determined. A position for the mobile-device is approximated based on the density. A location-based service is facilitated for use by the mobile-device based on the position of the mobile-device.

Statistical method for determining the location of a mobile-device

Statistical method for determining the location of a mobile device

In a communication system, a plurality of communication entities can establish a plurality of communication links that can potentially interfere with each other. A control of the communication system involves repetitively carrying out a probabilistic parameter setting step for respective communication links. In such a probabilistic parameter setting step, a parameter setting to be applied to a communication link is randomly determined according to a probability distribution. This probability distribution is such that a probability that a particular parameter setting is applied decreases with, on the one hand, a relative level of interference that the communication link is expected to experience from other communication links if the particular parameter setting is applied and, on the other hand, a relative level of interference that other communication links are expected to experience if the particular parameter setting is applied.

Controlling a communication system

A method for group communication over a network of processors comprises determining an overlay spanning tree comprising an origin node and at least one receiving node, and controlling a source communication rate to be less than or equal to a bottleneck rate of the overlay spanning tree.

Apparatus for scalable reliable group communication

The present invention addresses scalability and end-to-end reliability in overlay multicast networks. A simple end-system multicast architecture that is both scalable in throughput and reliable in an end-to-end way is used. In this architecture, the transfers between nodes use TCP with backpressure mechanisms to provide data packet transfers between intermediate nodes having finite-size forwarding buffers. There is also a finite-size backup buffer in each node to store copies of packets which are copied out from the receiver window to the forwarding buffers. These backup buffers are used when TCP connections are re-established to supply copies of data packets for the children nodes after their parent node fails, maintaining a complete sequence of data packets to all nodes within the multicast overlay network. The architecture provides end-to-end reliability, tolerates multiple simultaneous node failures and provides positive throughput for any group size and any buffer size.

Method and apparatus for group communication with end-to-end reliability

The invention relates to a device and a procedure for aiding the management of a wireless telephony network consisting of stations. The procedure comprises, for a given mobile pertaining to a station: a&#x2014;the calculation of a quantity incorporating the attenuation with regard to its station and the attenuation with regard to the neighboring stations (), b&#x2014;the product of this quantity times another quantity representing the requirements of the mobile with regard to its station (), c&#x2014;the summation of these products for a given set of mobiles pertaining to said station (), d&#x2014;the comparison of the sum with a threshold ().

Device and method for controlling admission and congestion of the configuration of a wireless communication network

Growing community of inventors

Meudon, France

Francois Baccelli