Internet Multimedia Traffic Classification from QoS Perspective Using Semi-Supervised Dictionary Learning Models

To address the issue of finegrained classification of Internet multimedia traffic from a Quality of Service(QoS) perspective with a suitable granularity, this paper defines a new set of QoS classes and presents a modified K-Singular Value Decomposition(K-SVD) method for multimedia identification. After analyzing several instances of typical Internet multimedia traffic captured in a campus network, this paper defines a new set of QoS classes according to the difference in downstream/upstream rates and proposes a modified K-SVD method that can automatically search for underlying structural patterns in the QoS characteristic space. We define bagQoS-words as the set of specific QoS local patterns, which can be expressed by core QoS characteristics. After the dictionary is constructed with an excess quantity of bag-QoSwords, Locality Constrained Feature Coding(LCFC) features of QoS classes are extracted. By associating a set of characteristics with a percentage of error, an objective function is formulated. In accordance with the modified K-SVD, Internet multimedia traffic can be classified into a corresponding QoS class with a linear Support Vector Machines(SVM) clas-sifier. Our experimental results demonstrate the feasibility of the proposed classification method.

Algorithm for Delay-Constrained Minimal Cost Group Multicasting

Group multicast routing algorithms satisfying quality of service requirements of real-time applications are essential for high-speed networks. A heuristic algorithm was presented for group multicast routing with bandwidth and delay constrained. A new metric was designed as a function of available bandwidth and delay of link. And source-specific routing trees for each member were generated in the algorithm by using the metric, which satisfy member′s bandwidth and end-to-end delay requirements. Simulations over random network were carried out to compare the performance of the proposed algorithm with that from literature.Experimental results show that the algorithm performs better in terms of network cost and ability in constructing feasible multicast trees for group members. Moreover,the algorithm can avoid link blocking and enhance the network behavior efficiently.