Time slicing and statistical multiplexing in a digital wireless network
AssigneeNokia Corporation
InventorsMehdi Rezaei, Imed Bouazizi, Moncef Gabbouj
Life of this patent
Estimating the term…
Abstract
In accordance with an aspect of the invention, flexible burst boundaries, within an allowable range, allow statistical multiplexing to be performed in conjunction with time slicing in a digital broadcast network. The signalling of the delta-t is performed such that data of the service is not missed. Similar to deterministic multiplexing, aspects of the invention split the multiplex into several time-cycles and allocate, for each service, a time slot (data burst) from the total time-cycle according to the service's average bit rate. In accordance with aspects of the invention, however, the boundaries of each data burst are allowed to grow or shrink by a limited amount.
Claims30
A method comprising:
- determining a time-cycle for a plurality of services;
- defining a maximum and a minimum value for a time slice duration for at least two of the services;
- calculating, by a processor, an earliest start of a next time slice for a next transmission of a service from the plurality of services based on a starting time of a current time slice and the maximum and minimum values for said time slice duration for the at least two of the services;
- preparing a data packet for transmission in the next time slice according to calculated time-slice filling conditions;
- and
- causing transmission of said data packet in the next time slice.
An apparatus comprising:
- a processor;
- and
- memory including computer executable instructions, the memory and the computer executable instructions configured to, with the processor, cause the apparatus to at least perform:
- determine a time-cycle for a plurality of services;
- define a maximum and a minimum value for a time slice duration for at least two of the services;
- calculate an earliest start of a next time slice for a next transmission of a service from the plurality of services based on a starting time of a current time slice and the maximum and minimum values for said time slice duration for the at least two of the services;
- prepare a data packet for transmission in the next time slice according to calculated time-slice filling conditions;
- and
- cause transmission of said data packet in the next time slice.
A computer readable medium storing computer executable instructions that, when executed, cause an apparatus to at least;
- determine a time-cycle for a plurality of services;
- define a maximum and a minimum value for a time slice duration for at least two of the services;
- calculate an earliest start of a next time slice for a next transmission of a service from the plurality of services based on a starting time of a current time slice and the maximum and minimum values for said time slice duration for the at least two of the services;
- prepare a data packet for transmission in the next time slice according to calculated time-slice filling conditions;
- and
- cause transmission of said data packet in the next time slice.
Dependencies are inferred from the claim text.