Internationa Journa of Soft omputing and Engineering (IJSE) ISSN: 2231-2307 Voume-4 Issue-6 Januar 2015 Method for Evauating The Routing ost in Mps Network With Regard To Fracta Properties of The Traffic Abed Saif Aghawi Abstract There has been proposed the method for evauating the routing cost which is based on the account of fracta properties of the network traffic and pre-set imits for the atenc time and the number of ost packets. This method cacuates the fractait of the traffic and the vaue of bursts. Depending on these parameters the routing costs are recacuated and the optima one is chosen for transferring. If the traffic is the usua Poisson fow then the routing is not changed. If the traffic has strong ong-term dependence and high bursts then the routing cost increases in proportion to the vaue of Hurst exponent and the extend of bursts. The proposed method for evauating the routing cost with regard to fracta properties of the traffic has been tested on an open patform of graphica simuation of HUAWEI networks in the existing network of "Market-port" compan. During the experiment the network parameters have been defined (bandwidth oad capacit of the channes the number of ost data transmission deas fractait) in the rea "Market-port" network. Then the network simiar to a rea one has been modeed and configured in such a wa that transmission time the number of ost packets the average atenc time of the packets in the network coincides with the data having been defined in a rea network of "Market-port" compan. The source of the impementations of traffic in the experiments was the reaization of the rea network traffic captured in the network of "Market-port" compan and the mode impementation generated b these parameters. The studied simuation of the proposed method for evauating the routing cost in MPLS network has shown that the use of the deveoped method significant improves the quait of the service reduces the transmission osses and permits to oad network channes more even. Index Terms MPLS network traffic management contro routing cost deas the quait of the service fracta traffic. I. INTRODUTION With the growth of computer networks the intensit of traffic is growing exponentia and then the technoogies of switching and routing packets in geographica distributed networks are becoming increasing important. Aso the needs of users are ramping up requiring the access to integrated services in the network and organization of virtua private networks (VPN) and man other essentia services. The increased demand for additiona services reaizabe above the simpe IP-access brings substantia profits for ISPs forcing the deveopers to search for new was of combining IP-based and ATM networks. Manuscript Received on December 2014. Abed Saif Aghawi Saman Bin Abduaziz Universit oege of Science and Humanities in Afaj Saudi Arabia. To meet emerging chaenges the MPLS (Mutiprotoco Labe Switching) technoog was deveoped which significant expands the avaiabe prospects of scaing increases the processing speed of the traffic and aows tremendous opportunities for providing additiona services. The widespread occurrence and deveopment of MPLS gives rise to researches deveopments and introductions of new methods which provide the estimation of the characteristics of network interactions. The studies carried out in [1-3] have shown that traffic in MPLS network is mutifracta. Basing on the mode of the MPLS network and methods of the traffic management contro [4-6] the method for evauating the routing cost based on sef-simiar traffic structure has been deveoped permitting to prevent the network overoad when burst of traffic. Aso the simuated of the MPLS network has been carried out for evauating the efficienc of the method of routing costs evauating. II. METHOD FOR EVALUATING THE ROUTING OST WITH REGARD TO FRATAL PROPERTIES OF THE TRAFFI In the MPLS architecture there can be an avaiabe choice of routes based on individua streams when different threads connecting the same pair of end points can foow various routes. Furthermore if an overoad occurs the MPLS architecture routes can be changed. Basing on data of the state of channe the routing protoco cacuates the shortest paths (the owest cost of routings) among the input boundar router and the rest of them. The routing cost vaue c m is assigned to the communication ine m and ma depend on severa parameters name the speed ength and reiabiit. In one communication ine m there ma be a purait of channes Y of QoS traffic. A set of communication { 1... L} L Y channes for the path is determined for ever traffic channe. L For the path the admissibe set of paths is set as 1 L { p...p } P =. q P Through λ (t) it wi be denoted that at the moment t the edge router receives the traffic with the intensit λ reated to the q -th cass of service to be deivered to the P output router through an paths of the variet but without exceeding the predetermined maximum of aowabe vaues of dea and the maximum percentage of osses. 89 Pubished B: Bue Ees Inteigence Engineering & Sciences Pubication Pvt. Ltd.
Method for Evauating The Routing ost in Mps Network With Regard To Fracta Properties of The Traffic p The cost of the path is indicated b and is the sum of the costs of communication ines: c = m p m x( t). If represents the bandwidth p sent to a vaid path of the channe of the traffic λ q ( t P ) then: L x ( t) = d { 1... L} t T ; = 1 Y. The objective function that minimizes the cost of the route { } 1 L P... = p p on a variet of paths L x ( t) min is as foows: Y = 1. (1) In works [1 2 7 8] it is indicated that when the vaues of H 09 the Hurst exponent or when persistent traffic with S 3 then the data oss is greater aized scatter than 5-10%. When passing through the network traffic with strong fracta properties the time increase of the communication ines bandwidths is required. To refect the change in the properties of the sef-simiar fows the paths costs are updated in reguar intervas and are cacuated b the formua new where = H 05; + ( H 05) 0 05 < H < 09 S 1; + 0 < < < < 0 H или H S ( H 05)( S 1) 05 H 09 1 S 3; = m p c + 09 > 05 3 m is determined in accordance with the objective function (1) the vaue 0 is seected b a network administrator in accordance with the network topoog. The routing agorithm is unchanged (the path cost is new H = 05 ( = ) if the traffic is usua Poisson process ) or possesses the antipersistent properties H < 05 ( ). When data ( 05 < H < 09 and sma scatter of S 1 ) then the vaue increases in proportion H < 05 to the vaue of the Hurst exponent ( ). When the vaue of the Hurst exponent 05 < H < 09 and a wide scatter of data ( 1 S 3 < < ) then vaue increases in proportion to both characteristics. The cost with the maximum vaue + 0 is obtained when the vaue H 09 or when persistent traffic with a standard deviation is S 3. The estimation of the Hurst parameter is carried out b using discrete waveet decomposition which aows working in rea time [8 9]. After recacuating the costs of a the paths the announcement of the state of paths is sent among routers. III. RESEARH FINDINGS In order to evauate the effectiveness of method for evauating the routing cost in MPLS network et us present and anase the simuation resuts in the HUAWEI medium on the basis of the existing network of "Market-port" compan. The constructed network consists of two oca networks WIN1 and WIN2 which are combined with a muti computer network and connected to the border routers SW1 and SW2 respective. The mutiservice network consists of interna routers R1 R2 R3 R4 RN1- RN14 (Mikrotik RB / 750 (GL) equipment) and edge routers SW1 and SW2 (Juniper SRX1008 equipment) (Figure 1). The routers RN1- RN14 are adjusted in such a wa that the traffic transmission time between routers SW1 and SW2 the number of ost packets and the average response time of packets in the network coincides with the data received in a rea network of the "Market-port" compan. The measurement of characteristics of the network and the traffic was made at entering and eaving ports of the routers SW1 and SW2. The source of the traffic in the experiments was the reaizations of rea network traffic captured in the rea network of "Market-port" compan and the mode impementation generated b a mutifracta mode deveoped in the work [10]. 90 Pubished B: Bue Ees Inteigence Engineering & Sciences Pubication Pvt. Ltd.
Internationa Journa of Soft omputing and Engineering (IJSE) ISSN: 2231-2307 Voume-4 Issue-6 Januar 2015 Figure 1. Diagram of the simuated computer network Figure 2 shows the dnamic changes of communication channe capacit WIN_1-SW1 and MPLS network for incoming mutifracta traffic without using additiona methods of QoS advancing. Figure 3 shows how the network bandwidth changes when using the method of routing cost evauation. Figure 2. The network capacit without the use of additiona methods of QoS advancing As it is cear from the Figure the average oad of the communication channe is 7Gb/s with fair amount of bursts. For exampe at such time points as 0.35 and 0.55 minutes 1.45 1.58 and 2.25 hour. Thus it is seen that the onger the experiment asts the more bursts occur. After that as it is shown b the studies the sstem returns to its origina state with smaer fuctuations about average bandwidth. Figure 3. Network bandwidth when using the method of routing cost evauation Figure 3 shows that b using the method for evauating the routing cost the average bandwidth remains at 6.4 Gb/s however the burst is observed on at the time point of 2.1 hours and the traffic in the channe is much smoother. onsequent the oading of the routers when such incoming traffic is more uniform and predictabe. Figure 4 shows the dependence (corresponding to Figure 2) of the amount of ost data in the router SW1 which takes pace without the use of additiona methods of QoS advancing. Figure 5 shows how the number of osses is reduced when using the method of routing cost evauation. 91 Pubished B: Bue Ees Inteigence Engineering & Sciences Pubication Pvt. Ltd.
Method for Evauating The Routing ost in Mps Network With Regard To Fracta Properties of The Traffic Figure 4. Number of ost data without the use of additiona methods of QoS advancing Eventua the number of ost data the dnamics of which is shown in Fig. 4 increases as the amount of bursts and spread of vaues aso increases with regard to the average bandwidth (see. Fig.2). It shoud be noted that the amount of data oss of 46% is unacceptabe for a tpes of traffic. Figure 5. Number of ost data when using the method of routing cost evauation As it is seen in Figure 5 when using the method of the routing cost evauation the number of the ost data is considerab reduced and is equa to 17% and 19%. Figure 6 shows the scatter of maximum and minimum time of a packet transfer (jitter) between nodes WIN_1 and WIN2 without the use of additiona methods of QoS advancing. Figure 7 shows how the scatter is reduced when using the method of routing cost evauation. Figure 6. Jitter without the use of additiona methods of QoS advancing Without the use of additiona methods of QoS advancing the average scatter of the maximum and minimum time of a packet transfer is 63 ms for 1 h 40 min (Fig. 6). After that the dispersion increases more than two times and becomes 130 ms. These vaues are not vaid for most tpes of traffic much ess the voice and video traffic 92 Pubished B: Bue Ees Inteigence Engineering & Sciences Pubication Pvt. Ltd.
Internationa Journa of Soft omputing and Engineering (IJSE) ISSN: 2231-2307 Voume-4 Issue-6 Januar 2015 Figure 7. Jitter when using the method of routing cost estimation Figure 7 shows that when using the method of routing cost evauation the maximum and minimum time of packets transfer scatter is 40 ms. The peak vaues greater than 100 ms do not occur. Tabe 1 shows the generaized estimations of dnamic dependencies above mentioned that evidence the advantages of the method of routing cost estimation. Tabe 1. ratings of quait parameters of the network operation Without methods of QoS advancing Method of routing cost estimation coefficient of the channe oading vaue of ost data % vaue of jitter ms 07 36 97 061 18 40 IV. ONLUSIONS The paper introduces the method for evauating routing cost with regard to fracta properties of the traffic. The resuts of the simuation stud showed that with the same voume of information transmitted b SW1 and SW2 nodes the transmission osses of the traffic possessing fracta properties are significant ower when using the method n of routing cost estimation. Thus it can be concuded that the use of the worked out method of routing cost estimation significant improves the quait of the service in the network. However the appication of this method is quite resource intensive and expensive. The foowing work is panned to consider another method of improving the quait of the service to be ess expensive and resource intensive and compare it to the presented in this paper the method of routing cost estimation. Thus it is possibe to choose a method that can be most appropriate for a particuar network. [2] Петров В. В. Структура телетрафика и алгоритмобеспечения качества обслуживания при влиянии эффекта самоподобия : дис. кандидата технических наук : 05.12.13 / Петров Виталий Валерьевич. М.2004. 175 с. [3] Шелухин О. И. Фрактальные процессы в телекоммуникациях / О. И. Шелухин А. М. ТенякшевА. В. Осин // Монография : под ред. О. И. Шелухина.М.: Радиотехника 2003. 480 с. [4] Кириченко Л. О. Влияние методов маршрутизации на качество обслуживания в мультисервисных сетях при самоподобной нагрузке / Л. О. Кириченко Т. А. Радивилова Э. Кайали // Восточно-Европейский журнал передовых технологий. 2011. 1/2 (49). С. 15 18. [5] Радивилова Т. А. Описание модели сети MPLS и методов управления трафиком Т. А. Радивилова Э. Кайали // Системи управління навігації та зв язку. 2012. Вип. 3 (23). С. 184 189. [6] Зайченко Е.Ю. Комплекс алгоритмов оптимизации сетей с технологией MPLS// Системні дослідження та інформаційні технології-2007.- 4.-с.58-71. [7] Abdaa Jr H. Soares A.M arvaho P. H. P et a Performance Evauation of Shortest Path omputation for IP and MPLS Muti-Service Networks over Open Source Impementation. Proceedings of the 11th Internationa onference on Teecommunications SAPIR 2004 Fortaeza Brazi August 2004. [8] P. A. S. M. Barreto Uma metodoogia de engenharia de trafego baseada na abordagem auto-simiar para a caracterizacao de parametros e a otimizacao de redes mutimıdia Ph.D. dissertation Universidade de Brasıia 2007. [9] Kirichenko L. omparative anasis for estimating of the Hurst exponent for stationar and nonstationar time series // L. Kirichenko T. Radiviova Z. Deineko // Internationa Journa "Information Technoogies & Knowedge". 2011. Vo.5. P. 371-388. [10] Kirichenko L. Modeing teecommunications traffic using the stochastic mutifracta cascade process // L. Kirichenko T. Radiviova E. Kaai // Probems of omputer Inteectuaization / ed. K. Markov V. Vechko O. Vooshin. Kiev Sofia: ITHEA. 2012. P. 55 63. REFERENES [1] Sein erav Erbas agkan Erbas. A Mutiobjective Off-ine Routing Mode for MPLS Networks. IEEE transactions on knowedge and data engineering 2003. P.1-10. 93 Pubished B: Bue Ees Inteigence Engineering & Sciences Pubication Pvt. Ltd.