Optimally, a hybrid approach is used, that
is, a combination of the time and length thresholds. In all cases, a minimum burst-length
should be imposed to avoid too small bursts, which may cause the generation of too many
control packets that may lead to traffic congestion on the control channels. A data burst is
constructed when its length gets bigger than a pre-defined value, or when the maximum
assembly time is reached; in the later case, data padding may be applied to bring the data
burst to an appropriate length. Furthermore, a minimum burst-length should be imposed to
avoid too small bursts, which may cause the generation of too many control packets that
may lead to traffic congestion in the control channels.
More sophisticated assembly algorithms that trade-in the simplicity with the flexibility were
proposed in the literature. For example The Adaptive-Assembly-Period (AAP) Algorithm,
proposed by Cao, Li, Chen, and Qiao (2002). AAP analyzes current IP traffic statistics and
change the values of thresholds accordingly, which can reduce the queuing delay in the
edge nodes.
The data bursts disassembly (de-burstification) process is performed by disassemblers at
the egress nodes upon the bursts??™ arrival.
Pages:
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773