ISSN: (Online) Volume 3, Issue 4, April 2015 International Journal of Advance Research in Computer Science and Management Studies

Transcription

1 ISSN: (Online) Volume 3, Iue 4, April 2015 International Journal Advance Reearch in Computer Science and Management Studie Reearch Article / Survey Paper / Cae Study Available online at: Optimized Segmentation baed heuritic for Virtual Deign and it performance analyi P. Venkataravikumar 1 Reearch Scholar Department Computer Science and Technology Sri Krihnadevaraya Univerity Anantapuramu - India Bachala Sathyanarayana 2 Preor Department Computer Science and Technology Sri Krihnadevaraya Univerity Anantapuramu - India Abtract: Thi Paper preent Optimized Segmentation baed heuritic a a olution to the deign a logical topology for a given phyical topology. For a given phyical topology in fiber optic network and Traffic pattern, the objective i to deign a logical topology and routing algorithm o a to minimize both the average weighted number hop and Congetion. Two contraint are conidered namely, the number wavelength required to embed the reulting logical topology and the number tranceiver per node. Two new optimized egmentation baed heuritic approache i)optimized Segmentation Baed Left Top to Right Bottom Diagonal Heuritic (OSLTRBH), ii)optimized Segmentation Baed Left Bottom to Right Top Diagonal Heuritic (OSLBRTH) are propoed to deign logical topology for a given traffic matrix to a phyical topology in fiber optical network. The experimental reult on 14 node NSFNET model obtained for the exiting heuritic i better than propoed heuritic and their performance are compared for varying wavelength and tranceiver. Keyword: Phyical, Logical, Traffic Matrix, Average Weighted number Count,, Congetion, Diameter, WDM Network. I. INTRODUCTION Wavelength Diviion Multiplexing (WDM) fer the ability building very large wide area network with throughput the order terabit per econd. Thee WDM network, which provide very high data rate, low error rate, and low delay, can atify the emerging application uch a upercomputer viualization, medical imaging, and CPU interconnect [1]. A WDM network employing wavelength-routing conit optical wavelength routing node interconnected by point-to-point fiber link in an arbitrary topology. End node with a limited number optical tranceiver are attached to the routing node. A light path i an optical path etablihed between two node in the network, created by the allocation ame wavelength throughout the path. The condition that the ame wavelength be reerved on all link a path i referred to a wavelength continuity contraint [1]. Two light path can ue the ame fiber, if and only if they ue different wavelength. If two node are connected by a light path, a meage can be ent from one node to the other in optical form without requiring any buffering and electro-optical converion at the intermediated node. A et light path that are et up between end node form the virtual topology. Thu, a virtual topology i a graph with node correponding to the lightpath. Phyical topology i a graph in which each node in the network i a vertex, and each fiber optic link between two node i an arc [5]. The Heuritic Logical Deign [10] i baed on Dijktra algorithm to find the hortet path between any two node in the network; it elect the hortet path between every node pair depending on the availability a free wavelength on the elected path and a free number tranmitter and receiver at the ource and the detination node, repectively. 2015, IJARCSMS All Right Reerved 497 P a g e

2 II. RELATED WORK In previou work [9] propoe two new egmentation baed heuritic to deign logical topology for a given phyical topology traffic matrix and to find the average weighted number hop and congetion SEGMENTATION BASED LEFT TOP TO RIGHT BOTTOM DIAGONAL HEURISTIC (SLTRBH) The traffic demand matrix for the given phyical topology i conidered to have two partition when divided along the major diagonal. Here the all major diagonal element conit zero value. Accordingly the heuritic i preented in two variation SLTRBH (L), SLTRBH (U) SEGMENTATION BASED LEFT BOTTOM TO RIGHT TOP DIAGONAL HEURISTIC (SLBRTH) The traffic demand matrix for the given phyical topology i conidered to have two partition when divided along counter diagonal Here the all counter diagonal element conit non zero value. Accordingly the heuritic i preented in two variation. SLBRTH (L), SLBRTH (U). III. PARAMETERS Lited below are the parameter ued in the problem formulation node in the network = N wavelength per fiber = W Traffic matrix in ource to detination = T d hop in ource to detination = H d Hop count value Average traffic from ource to detination = t (d) Average Weighted Hop count for the (AWHT) Congetion=T max 3.1 Traffic Matrix A traffic matrix which pecifie the average traffic data flow between every pair node in the phyical topology. The traffic matrix T i a two-dimenional matrix with N row and N column. An entry t d in T correpond to the node pair<,d> whoe value i the average traffic flow from node to node d. 3.2 Average Weighted Hop count The average weighted number (virtual) hop defined a the average number lightpath travered by one unit. If T d i the fered traffic between node and node d and H,d i the number hop between and d on the virtual topology, then the weighted number hop required by thi <,d> pair i given by T d *H d.. Average Weighted Hop count for the i given by,d T ij,d *H d AWHT= (1),d T d 2015, IJARCSMS All Right Reerved ISSN: (Online) 498 P a g e

3 3.3 Congetion Congetion i defined a the maximum virtual load among all the lightpath due to all poible ource to detination pair in a virtual topology. T max = max ij T ij.. (2) 3.4 Network Diameter: A Virtual topologie in WDM network i deigned to minimize the network diameter. The network diameter pecifie the number hop o the longet hortet path all node pair. IV. PROPOSED WORK Thi paper propoe two new optimized egmentation baed heuritic to deign logical topology for a given phyical topology traffic matrix and to find the average weighted number hop and congetion. Here Traffic demand matrix repeated value are eliminated. Fig 1: Phyical the 5-node optical network Fig 2: Virtual the 5-node optical 4.1 OPTIMIZED SEGMENTATION BASED LEFT TOP TO RIGHT BOTTOM DIAGONAL HEURISTIC (OSLTRBH) The traffic demand matrix for the given phyical topology i conidered to have two partition when divided along the major diagonal. Here the all major diagonal element conit zero value. Accordingly the heuritic i preented in two variation. OSLTRBH (L), OSLTRBH (U). Here two partition are ame equal part traffic demand matrix. The reult are comparing ame a OSLTRBH (L) and OSLTRBH (U) OSLTRBH (L) with lower portion major diagonal to upper portion major diagonal lightpath etablihment Etablihment lightpath through optimized egmentation baed heuritic commence by electing from the lower portion the traffic matrix along the major diagonal, elect the maximum traffic demand from ource to detination node i followed by the lower portion diagonal part etablihed the lightpath. If any repeated value in traffic matrix, the value i eliminated. Select the maximum traffic demand from ource to detination node i followed by upper portion diagonal part etablihed lightpath. If any repeated value in traffic matrix, the value i eliminated. Thi proce will be continued to complete one cycle until all traffic matrix value become zero. The ame algorithm i implemented repeatedly it depend upon the number tranceiver fixed at each node. The heuritic propoed here i baed on optimized egmentation to improve efficiency AWHT. Step 1: i) node = N, node = Ni, i=1, 2 N ii) Traffic matrix T= (t ij ) iii) Wavelength Wi, i=1, 2.k, ( wavelength = k) iv) Ti, i=1, 2 m, ( tranceiver = m) v) Phyical topology PT= (V, E) Step 2: i) elect the lower diagonal matrix part 2015, IJARCSMS All Right Reerved ISSN: (Online) 499 P a g e

4 ii) Select the max value tij (Max) lower diagonal iii) If wavelength and tranceiver are available from ource to detination aign lightpath L ij, reet traffic matrix value tij (Max) = 0 Step 3: If any repeated value in Lower Diagonal matrix part that value are eliminated Step 4: i) Select the traffic upper diagonal matrix part ii) Select the max value tij (Max) upper diagonal iii) If wavelength and tranceiver are available from ource to detination aign lightpath Lij, Reet traffic matrix value tij (Max) = 0 Step 5: If any repeated value in upper diagonal matrix part, the value are eliminated Step 6: Repeat tep 2 to 4 until all traffic matrix value become zero or wavelength and tranceiver are exhauted Step 7: Etablih logical topology with the lightpath elected. Step 8: Calculate the AWHT= Sum (T d *H d )/Sum (T d ) OSLTRBH (U) with upper portion major diagonal to lower portion major diagonal lightpath etablihment Etablihment lightpath through egmentation heuritic approach tarting from the upper diagonal portion the traffic matrix along the major diagonal, followed by the lower diagonal portion the traffic matrix. The procedure for finding lightpath i imilar to tep preented in ection except that the procedure tart from lower portion (traffic demand) diagonal followed by upper portion ( traffic demand) OPTIMIZED SEGMENTATION BASED LEFT BOTTOM TO RIGHT TOP DIAGONAL HEURISTICS (OSLBRTH) The traffic demand matrix for the given phyical topology i conidered to have two partition when divided along counter diagonal Here the all counter diagonal element conit non zero value. Accordingly the heuritic i preented in two variation. OSLBRTH (L) OSLBRTH (U. Here two partition are not ame equal part traffic demand matrix. OSLBRTH (L) i greater than OSBRTH (U) traffic matrix OSLBRTH (L) with lower portion counter diagonal to upper portion counter diagonal lightpath etablihment Etablihment lightpath through optimized egmentation baed heuritic commence by electing from the lower portion the traffic matrix along the major diagonal, elect the maximum traffic demand from ource to detination node i followed by the lower portion diagonal part etablihed the lightpath. If any repeated value in traffic matrix, the value i eliminated. Select the maximum traffic demand from ource to detination node i followed by upper portion diagonal part etablihed lightpath. If any repeated value in traffic matrix, the value i eliminated. Thi proce will be continued to complete one cycle until all traffic matrix value become zero. The ame algorithm i implemented repeatedly it depend upon the number tranceiver fixed at each node. The heuritic propoed here i baed on optimized egmentation to improve efficiency AWHT. Step 1: i) node=n, node = Ni, i=1, 2 N ii) Traffic matrix T= (t ij ), iii) Wavelength Wi, i=1, 2.k, ( wavelength = k) 2015, IJARCSMS All Right Reerved ISSN: (Online) 500 P a g e

5 iv) Ti, i=1, 2 m, ( tranceiver = m) v) Phyical topology PT= (V, E) Step 2: i) elect the lower diagonal matrix part ii) Select the max value tij (Max) lower diagonal iii) If Wavelength and tranceiver are available from ource to detination aign lightpath Lij, Reet traffic matrix value tij (Max) = 0 Step 3: If any repeated value in lower portion diagonal matrix part, the value are eliminated Step 4: i) Select the traffic upper diagonal matrix part ii) Select the max value tij (Max) upper diagonal iii) If wavelength and tranceiver are available from ource to detination aign lightpath L ij, reet traffic matrix value tij (Max) = 0 Step 5: If any repeated value in upper diagonal matrix part, the value are eliminated Step 6: Repeat tep 2 to 4 until all traffic matrix value become zero or wavelength and tranceiver are exhauted Step 7: Etablih logical topology with the lightpath elected. Step 8: Calculate the AWHT=Sum (T d *H d )/Sum (T d ) OSLBRTH (U) with upper portion counter diagonal to lower portion counter diagonal lightpath etablihment Etablihment lightpath through optimized egmentation baed heuritic commence by electing from the upper portion the traffic matrix along the counter diagonal, elect the maximum traffic demand from a ource to a detination followed by the lower diagonal portion counter diagonal. The heuritic propoed here i to improve the efficiency AWHT. In thi upper diagonal part the election one lightpath from ource to detination i performed on the maximum total cot detination node. If any repeated value are eliminated. The lower diagonal part election next lightpath from ource to detination baed on next maximum total cot detination node. If any repeated value are eliminated. Thi proce will be continued to complete one cycle until all the detination node total cot are proceed. The ame procedure i implemented repeatedly it depend upon the number tranceiver fixed at each node. The procedure i preented a given below. Step 1: i) node=n, node = Ni, i=1, 2 N ii) Traffic matrix T= (t ij ), iii) Wavelength Wi, i=1, 2.k, ( wavelength = k) iv) Ti, i=1, 2 m, ( tranceiver = m) v) Phyical topology PT= (V, E) Step 2: i) Select the upper diagonal matrix part ii) Select the max value tij (Max) upper diagonal iii) If wavelength and tranceiver are available from ource to detination aign lightpath L ij, 2015, IJARCSMS All Right Reerved ISSN: (Online) 501 P a g e

6 reet traffic matrix value tij (Max) = 0 Step 3: If any repeated value in upper diagonal matrix, the value are eliminated Step 4: i) Select the traffic lower diagonal matrix part ii) Select the max value tij (Max) lower diagonal iii) If wavelength and tranceiver are available from ource to detination aign lightpath L ij, reet traffic matrix value tij (Max) = 0 Step 5: If any repeated value in lower diagonal matrix, the value are eliminated Step 6: Repeat tep 2 to 4 until all traffic matrix value become zero or wavelength and tranceiver are exhauted Step 7: Etablih logical topology with the lightpath elected. Step 8: Calculate the AWHT=Sum (T d *H d )/Sum (T d ) Figure 3: Phyical the 14-node NSFNET optical network Table 1: Traffic Demand Matrix for 5-node optical network , IJARCSMS All Right Reerved ISSN: (Online) 502 P a g e

7 Table 2: Traffic Demand Matrix for the 14-node NSFNET optical network V. RESULTS Table 3: Comparion AWHT value for SLTRBH and OSLTRBH 5-node Logical Numbe r node Tranceive r wavelength HLDA SLTRB H- SLTRB H- OSLTRB H- OSLTRB H Table 4: Comparion AWHT value for SLBRTH and OSLBRTH 5-node Logical O O Wavelength Table 5: Comparion AWHT value for SLTRBH and OSLTRBH the 14-node NSFNET Logical topology NSFNE T ( 14 ) Logical Topolog y Tranceiver Wavelengt h HLDA SLTRB H- SLTRBH- OSLTRB H- OSLTRB H , IJARCSMS All Right Reerved ISSN: (Online) 503 P a g e

8 Table 6: Comparion AWHT value for SLBRTH and OSLBRTH the 14-node NSFNET Logical node NSFNET ( 14 ) Logical Tranceive r Wavelength SLBRT H- Table 10: Comparion Congetion value for SLBRTH and OSLBRTH the 14-node NSFNET Logical node Wavelength O O NSFNET (14) Logical OSLBRT H- OSLBRT H Table 7: Comparion Congetion value for SLTRBH and OSLTRBH 5-node Logical HLDA SLTRBH- SLTRBH- OSLTRBH- Wavelength OSLTRBH Table 8: Comparion Congetion value for SLBRTH and OSLBRTH 5-node Logical O O Wavelength Table 9: Comparion Congetion value for SLTRBH and OSLTRBH the 14-node NSFNET Logical Wavelength HLDA SLTRBH- SLTRBH- OSLTRBH- OSLTRBH- NSFNET (14) Logical To determine the new Optimized Segmentation baed heuritic approach for virtual topology deign i implemented in C++ language for 14 node NSFNET topology hown in fig 1. In our algorithm we have preented four variation improved egmentation baed heuritic are (i) OSLTRBH(L) (ii) OSLTRBH(U) (iii) OSLBRTH(L) (iv) OSLBRTH(U). The experimental reult hown in form Table 1 Table 3 and Table 4. It i obererved that for 5-node network, the AWHT i bet for the propoed improved egmentation baed heuritic than exiting egmentation baed heuritic algorithm. The reult obtained 14-node network, we are hown in Table 2 Table 5 and Table 6 in which i oberved reult pertaining to AWHT the propoed heuritic perform better that the exiting egmentation baed heuritic algorithm and other heuritic OSLTRBH(L), OSLTRBH (U), OSLBRTH(U) alo oberved the reult are coniit that when number tranceiver are increaed. In cae maximum congetion value T max from Table 9 and Table 10 it i formed the imilarly on comparion with the reult congetion it i formed the propoed heuritic and Segmentation baed heuritic give ame performance a the number tranceiver increae. 2015, IJARCSMS All Right Reerved ISSN: (Online) 504 P a g e

9 Table 11: Comparion hop count value for HLDA, SLTRBH and SLBRTH 5-node Logical No. HLDA SLTRBH- SLTRBH- SLBRTH Wavelength Table 12: Comparion hop count value for HLDA, SLTRBH and SLBRTH 5-node Logical No. HLDA SLTRBH- SLTRBH- SLBRTH Wavelength Table 13: Comparion hop count value for HLDA, OSLTRBH and OSLBRTH 5-node Logical Numbe r No. Tranceiver Wavelengt h HLD A OSLTR BH- OSLTRB H- OSLBRT H- OSLBRT H Table 14: Comparion hop count value for HLDA, OSLTRBH and OSLBRTH 5-node Logical Numbe r No. Tranceiver Wavelength HLDA OSLTRB H- OSLTRB H OSLBRT H OSLBR TH- Hop The experimental reult hown in form Table 11 Table 12 Table 13 and Table 14. It i oberved tranceiver 2 and wavelength 2 that for 5-node network, the hop count value i bet for the optimized improved egmentation baed heuritic than exiting egmentation baed heuritic algorithm. Similarly tranceiver3 and wavelength 3 a light difference to the exiting work compare to tranceiver 2 and wavelength 2 the propoed optimized egmentation hop count value are increaed. Table 15: Comparion hop count value for HLDA, SLTRBH and SLTRBH 14-node NSFNET Logical and No. HLDA SLTRBH- SLTRBH- OSLTRBH- OSLTRBH- NSFNET (14) Logical wavelength =2 and Wavelength= , IJARCSMS All Right Reerved ISSN: (Online) 505 P a g e

10 Average Weighted P. Venkataravikumar et al., Table 16: Comparion hop count value for HLDA, SLTRBH and SLTRBH 3, 14-node NSFNET Logical No. HLDA SLTRBH- SLTRBH- OSLTRBH- OSLTRBH and NSFNET (14) Logical wavelength =3 and Wavelength= Table 17: Comparion hop count value for HLDA, OSLTRBH and OSLTRBH 2, 14-node NSFNET Logical and wavelength No. O O NSFNET (14) Logical =2 and Wavelength= Table 18: Comparion hop count value for HLDA, OSLTRBH and OSLTRBH 2, 14-node NSFNET Logical and wavelength No. SLTRBH- SLTRBH- O O NSFNET (14) Logical =3 and Wavelength= The experimental reult hown in form Table 15, 16,17 and 18 It i oberved tranceiver 2, 3, 4 and wavelength 2, 3, 4 that for 14-node network, the hop count value i bet for the optimized improved egmentation baed heuritic than exiting egmentation baed heuritic algorithm. Similarly tranceiver3,4 and wavelength 3,4 a light difference to the exiting work compare to tranceiver 2 and wavelength 2 the propoed optimized egmentation hop count value are increaed HLDA SLTRBH(L) SLTRBH(U) OSLTRBH(L) OSLTRBH(U) Figure 4: Comparion Average Weighted HLDA, SLTRBH (L), SLTRBH (U), OSLTRBH (L), OSLTRBH (U) 2015, IJARCSMS All Right Reerved ISSN: (Online) 506 P a g e

11 Hop count value Hop count value Average Weighted Average Weighted Average Weighted P. Venkataravikumar et al., SLBRTH(L) SLBRTH(U) OSLBRTH(L) OSLBRTH(U) Figure 5: Comparion Average Weighted SLBRTH (L), SLBRTH (U), OSLBRTH (L), OSLBRTH (U) HLDA SLTRBH(L) SLTRBH(U) OSLTRBH(L) OSLTRBH(U) Figure 6: Comparion Maximum Link Load HLDA, SLTRBH (L), SLTRBH (U), OSLBRTH (L), OSLBRTH (U) SLBRTH(L) SLBRTH(U) OSLBRTH(L) OSLBRTH(U) Figure 7: Comparion Maximum Link Load SLTRBH (L), SLTRBH (U), OSLBRTH (L), OSLBRTH (U) hop HLDA SLTRBH- SLTRBH- OSLTRBH- OSLTRBH- Figure 6: Comparion hop count value HLDA, SLTRBH (L), SLTRBH (U), OSLBRTH (L), OSLBRTH (U) hop HLDA SLTRBH- SLTRBH- OSLTRBH- OSLTRBH- Figure 7: Comparion hop count value HLDA, SLTRBH (L), SLTRBH (U), OSLBRTH (L), OSLBRTH (U) 2015, IJARCSMS All Right Reerved ISSN: (Online) 507 P a g e

12 Hop count value Hop count value P. Venkataravikumar et al., hop O O Figure 8: Comparion hop count value HLDA, SLTRBH (L), SLTRBH (U), OSLBRTH (L), OSLBRTH (U) hop O O Figure 9: Comparion hop count value HLDA, SLTRBH (L), SLTRBH (U), OSLBRTH (L), OSLBRTH (U) VI. CONCLUSION In thi paper preent Optimized Segmentation baed heuritic a a olution to the deign logical topology for a given phyical topology. The objective i to find a logical topology and routing algorithm o a to minimize both the average weighted number hop, congetion and diameter. We have preented the analyi performance different metric like the NSFNET logical topology for varying number the tranceiver at each node, and the number wavelength in the fiber optic media and average weighted number hop. The obtained experimental reult how that the new egmentation baed heuritic approach achieve better performance in term Average Weighted (AWHT) and Congetion (T max ) than the exiting HLDA a the number tranceiver are increaed with fixed number wavelength. Reference 1. B. Mukarjee, D. Banerjee, S. Ramawamy, A. Mukharjee, Some Principle for deigning a wide area WDM Optical Network, IEEE/ACM Tranaction on Networking, vol 4, no.5, Oct 1996, pp N. Sreenath, C. Siva Ram Murthy, B.H. Gurucharan and G. Mohan, A Two-tage approach for virtual topology Reconfiguration or WDM optical network, SPIE Optical Network Magazine, vol2, no. 3. May/Jun. 2001, pp Rajiv Ramawamy, Kumar N. Sivarajan, Deign Logical Topologie for Wavelength-Routed Optical Network, IEEE, JSAC, vol 14, No. 5, June 1996, pp Ramawamy Mariappan, Diffrential Traffic Driven Virtual Reconfiguration for IP over WDM Network for Dynamic Traffic Change with QoS Parameter, Computer Science and Telecommunication, 2011 No.2 (31). 5. Ramawamy Mariappan, Literature Review Virtual Reconfiguration problem with traffic grooming For IP-over-WDM Network, International Journal Networking and Application, Volume 01, Iue 2, Sepn 2009, pp Ramawamy Mariappan, N.K. Karthikeyan, Optimization Technique for Virtual Reconfiguration for IP over WDM Network with QoS Parameter, vol 30, 2012, pp R. Ramawamy and K.N. Sivarajan, Deign Logical Topologie for wavelength Routed optical Network, IEEE Journal on Selected Area in Communication, vol.14, no. 5, pp June R. Dutta and G.N. Rouka, Survey Virtual Deign Algorithm for Wavelength Routed Optical Network, Optical Network Magazine, vol. 1, no. 1, pp , January P.Venkataravikumar and B. Sathyanarayana, Efficient Segmentation baed heuritic approach for logical topology deign in Fiber Optical Network, vol. 3, Iue 11, pp , November Ibrahim E.Beder, Hoam M.H. Shalaby, El-Sayad A.El-Badawy, and Salah A.Khami, A Heuritic Method Logical Deign in WDM Optical Network, , IJARCSMS All Right Reerved ISSN: (Online) 508 P a g e

13 AUTHOR(S) PROFILE P.Venaktaravikumar received from M.Sc in Computer Science and Technology from Sri Krihnadevaraya Univerity, Anantapurarmu, A.P., India, in He i currently puruing hi Ph.D Computer Sceince and technology at Sri Krihnadevaraya Univerity, Anantapuramu, A.P., India. i Current Reearch ineret include Computer Network. Pr. B.Sathyanarayana received hi B.Sc Degree in Mathematic, Economic and Statitic from Madra Univerity, Inida in 1985; Mater Computer Application from Madurai Kamaraj Univerity in He did hi Ph.D in Computer Network from Sri Krihnadevaraya Univerity, Anantapuramu, A.P. Inida. He ha 24 year teaching experience. Hi Current Reearch Interet include Computer Network, Network Security and Intruion Detection. He ha publihed 30 reearch paper in National and International journal. 2015, IJARCSMS All Right Reerved ISSN: (Online) 509 P a g e