France Telecom

Orange

James Roberts

Sara Oueslati

Luca Muscariello

Abdesselem Kortebi

Thomas Bonald

Maher Hamdi

Pierre Rolin

Ali Ibrahim

Sarah Oueslati

Nabil Benameur

Rolin Pierre

A transmission method is used by a node of a communications network, wherein nodes communicate with one another via a carrier-sense multiple-access channel, said method comprising a step of sending a signal at a given transmit power and a given data rate to a receiver node over the channel, and wherein the transmit power of the sent signal assumes successively a first power value during a first time period and then a second power value during a second time period, the two power values being different and one of them being equal to the given power, the first time period representing the given power and the second time period representing the data rate. The invention also relates to a method of receiving a signal sent by the transmission method enabling the transmit power and the data rate used by the sender node to be deduced from the received signal.

Technique for transmission by a node of a communications network

A method is provided for communication between a plurality nodes organized as a ring provided with transmission resources at least one of which is a control resource dedicated to transmitting control information and associated with at least one transmission resource, said method comprising the following step executed by a node of the ring: a step of receiving information relating to a reservation of a transmission window of the transmission resource received over the associated control resource. The method further comprises, if the transmission window is reserved by another node of the ring, steps of: comparing the respective volumes of reservations of resources of the ring made by the node in question and by the other node during a reference period; and pre-empting said reservation of the transmission window as a function of the result of the comparison step.

Technique for communication between a plurality of nodes

A method of ordonnancing packets belonging to different flows comprises: a step (E) of queuing each packet in a queue associated with the flow of said packet; and for each of said queues processed cyclically, a step of sending packets contained in said queue up to a quota for said cycle; said method being characterized in that it further includes: a step (E, E) of determining the priority of said packet before said step (E, E, E) of queuing, the priority packets being, firstly, the first packets of the inactive flows, namely the flows for which no packet has been received in said cycle, and, secondly, the packets of the active flows for which the volume of packets received in the cycle is less than the quota; and a step of sending with priority in said cycle packets determined to have priority during said determination step (E, E).

Method and device for scheduling packets for routing in a network with implicit determination of packets to be treated as priority

A method is provided for configuring the service quality profile of a given flow at the access node of a packet communication network to which is connected to the gateway of a receiving user of the flow. The method includes a step where the gateway determines on its own a service quality profile to be associated with the flow, that is triggered upon reception of a packet from the access node, and a step where the service quality profile thus determined is sent to the access node. The profile is used by the access node for transmitting packets intended for the gateway and belonging to the flow in question.

Method of configuring the quality-of-service profile of a given stream at an access node of a packet communications network

The inventive method consists in determining a flow (F) to which belongs each new incoming packet (P), when said flow (F) is on a list of active flows, in introducing said packet into a fair share scheduling mechanism (), when said flow (F) is absent from the list of active flows, in obtaining an estimation of the quantity of incoming data items (I.Bytes) with respect to said flow over a reference time period, in comparing said estimation with a maximum value (MaxBytes), wherein the reference time period or the maximum value are determined according to a fair share data rate, in adding said flow to the list of active flows and in introducing the packet (P) into the fair share scheduling mechanism (), if said estimation exceeds the maximum value, and in introducing the packet (P) into the end of a priority queue (), in the alternative case.

Method for organizing packets belonging to streams, and associated equipment

Management of the activity status of flows in a packet-switched telecommunications network is disclosed. For each packet received belonging to the flow, the location of a flow register in a data structure is determined from an identifier of the flow. An activity status of the flow is determined from an activity credit in the determined flow register. The flow is considered inactive if the activity credit has expired. An updating process progressively and simultaneously reduces the activity credits of the active flows, so that if a flow that has been determined active does not receive a packet during at least the time-out period, the credit of the flow expires at the end of the time-out period.

Method and a device for flow management in a packet-switched telecommunications network

Presented is a device for processing packets of flows on a network link. The device includes a scheduling module for scheduling packets in a queue in accordance with a fair queuing with priority algorithm.

Method and a device for implicit differentiation of quality of service in a network

A process for controlling the output flow rate of a coder of digital data representative of sequences of images, the coding effected by the coder including a quantization stage of quantization parameter Q, the sequences of images being made up of successive groups of images. The process consists of determining, at the moment of the presence of the i group of images at the output of the coder, the quantization parameter Q(i+1) for the coding of the (i+1) group of images so that the flow rate at the output of the coder conforms with a version of a leaky bucket defined by a size M and by a leakage rate .lambda. in terms of the activity of the scene represented by the i group of images.

Growing community of inventors

Voisins Le Bretonneux, France

James Roberts