The Research On Fractional Alpha Traffic Model And Its Application

Internet mathematics model and QoS are two important issues in Next Generation Internet (NGI). In this paper, based on hypothesis for traffic rate a fractional Alpha traffic model is proposed. Two proofs based on flow level and session level is given separately. The model is also associated with Langevin equation. This traffic model can give the network character of self-simolar and non-Gaussain. For giving a judge of whether the traffic model fit the actual traffic, we import linear discriminant analysis (LDA) into traffic analysis and give a algorithm. Based on this algorithm we analyze data of fractional Alpha model, data of actual traffic, data of NS. Comparing with traditional method this algorithm is useful and can conveniently give an accurate judgment for complex network traffic trace.Based on fractional Alpha model, we research the computing of buffer size, QoS routing and call admission control (CAC). Firstly we deduced a formula for the residual of the queuing distribution function (RDF). This RDF can meet real RDF better than the RDF based on other models. Based on this formula, we compute the buffer size in high-performance routers. Our method is more accurate and simpler than traditional method and accord with actual network traffic.QoS routing with multi-constraints is NP-complete. There has been much research in reducing the computing complexity but there is lack of research in routing mechanism and routing randomicity. With the development of optic network, the bottleneck bandwidth will be limited by the performance of router forwarding. Based on the RDF formula, we predict the need for performance of forwarding and proposed a QoS routing algorithm. This algorithm can improve the utility of bandwidth and amount of traffic. We use satisfaction-adaptation scheme to expand the conception about sub-optimal paths. We add a parameter of probability to think of network randomicity.Traditional analysis method of blocking probability is based on the experience of telecom network and has a hypothesis of bandwidth holding time exponentially distributed which may be not appropriated in computer network. So firstly we proposed a VoMPLS traffic-multiplexing scheme with guaranteed QoS. Then we give CAC algorithm. This algorithm can guarantee high-grade service based on adjusting two coefficients. To this algorithm we deduce the blocking probability based on fractional Alpha model and traditional hypothesis separately. The expression of two blocking probability are similar but the result based on traditional hypothesis is only the lower bound of actual blocking probability.