The dropping policy rules are formulated in an
algorithm that will be presented when the fairness in network resources allocation in the
core nodes is discussed.
The contention, therefore, is resolved by performing the following three steps:
??? Firstly, if (OT + ST) > CT, then a DS is added to the CT to efficiently contain the ST
in the dropped DSs. The added DS is selected from the DB with the smallest SRSlength,
or randomly if the contending DSs are equal in length. The ST is assumed to
be much smaller than the duration of one DS.
??? Secondly, if the ???SRS-length??? is the same for both contending DBs (i.e., the DSs are
equal in length), then the dropping process starts from the DS at the tail of the first
DB, not at the head of the contending DB. This gives fair chance to the packets to
arrive to the destination in the correct sequence (assuming the retransmission of the
lost packets).
??? Thirdly, if the ???SRS-length??? is not the same for the contending DBs, then the dropping
process starts at the DS of the shorter DB. The DS may be at the tail of the first DB
or at the head of the contending DB (as it is deemed that the amount of transmitted
data has higher priority than its order).
Pages:
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790