I hate to raise an old topic, but based on the explanation in the text I
proposed in my previous note, a is the number of bits required to
represent the value 65536/(M*R) - 1. Even if this value comes out to
zero (implying just one block and all ports for a given CE are in a
single consecutive range), surely one bit is required to represent that
value. Thus a=0 may be a possible partitioning of the binary
representation of the port number P, but it falls outside the scope of
the Generalized Modulus Algorithm.
We are left with the choice of discarding the GMA as an explanation for
the partitioning of P (leaving a simple procedural declaration in its
place) or excluding a=0 from the set of possible values of a.
Tom Taylor
_______________________________________________
Softwires mailing list
[email protected]
https://www.ietf.org/mailman/listinfo/softwires
