Bonjour Michelot,
You wrote:
Sorry for that crasy question.
There are no crazy questions, only crazy answers... ^_^
In G.709 (02/2012) below the figure D.3, it is noted "Cn(t) client
data entities have to be distributed over Pserver locations".
Indeed. By alternating a number of client data entities and
stuff entities.
Suppose 2176 client bytes to be mapped in Pserver = 3808 x 4 =
15232 payload bytes.
Have we Cn(t)= 2176 bytes?
Yes. And because Pserver has 15232 there will be 15232-2176 = 13026
stuffing entities.
The stuffing entities will be distributed and inserted between the
client entities.
It would seem it is false because we have never (j × Cn(t)) mod
Pserver < Cn(t).
Starting with j=1 and applying formulas D-10 and D-11 you will
that for j=1,2,3,4,5,6 equation D-11 is valid and for j=7
equation D-10 because (7*2176)= 15232 and
(7*2176) mod (15232) = 0 and this is < (2176).
Then for j=8,9,10,11,12,13 D-11 is valid and for J=14 D-10, etc.
Best regards, Huub.
--
reply to hhelvooort with 2 'o's ================================================================
http://www.van-helvoort.eu/ ================================================================
Always remember that you are unique...just like everyone else...
--- SoupGate-Win32 v1.05
* Origin: fsxNet Usenet Gateway (21:1/5)