You are on page 1of 16

PERFORMANCE TUNING OF

DATA CENTERS USING
WIRELESS SENSOR NETWORKS

P.Kalai Kannan
Asst.Professor

KG College Of Arts & Science

Implementing the efficiency of wireless sensor networks in the area of datacenters in an enterprise and virtual datacenters in cloud computing. Through mathematical analysis and graphical modeling techniques splitting up of the data loads in between data hubs in the data centers and between the enterprise datacenters and Virtual data’s centers somewhere in the cloud computing. Index Terms: Wireless sensor networks (WSN). . Datacenters (DC). In this study. we propose the concept of virtual data sharing in datacenters based on the data loads and data movements around the networks. and Cloud computing (CC) and.Abstract Data centers and sensor networks are various disciplines in computer networks. virtual data centers (VDC).

All the major industries in various disciplines managing their data’s with utmost care because it decides their future in terms of predictable growth. where the (PBRA) priority based routing algorithm helps us to find the nearest data hub within the datacenter network based on the data content categorization or else to some other virtual datacenter while the datahub within the datacenter reach their saturation point.INTRODUCTION As to manage an organization effectively nowadays the data’s management is an important thing which decides the growth of an organization. These algorithms not only help us to store the data’s in the data hub efficiently but also to access the from the data hub to any host computer that access the particular content. . Here in this paper the derivation of DLSP algorithm which helps us to increase the performance of datahubs in the datacenters in terms of data movements and data splitting among the datahubs within the data centers based on the data categorization. Data centers are an important area where the data’s of an organizations are stored with utmost care and security. Datacenters are nowadays seems to be an important place where the data’s are stored in terms of numerous data hub which can be countable in number. As the DLSP algorithm helps us to redirect the data’s from one data hub to another data hub using sensor nodes for every data hub.

.

sp) If the (DL<=LB) Then Add more data’s Sensor allow data movements Else if (DL<=mp) Then Add more data’s Sensor allow data movements Else if (DL <= hp) Then Add more data’s Sensor allow data movements Else Route or path the incoming data’s to the next available data center based on its categorization. mp. hp.Data load splitting algorithm DLSP (lb. .

the source and all intermediate forwarding nodes make their routing decisions based solely on the destination location and the location of their neighbours.Location based routing In these technique every node in a network is positioned based on its geographic location when a source node transmits a message to a destination with a known location.since the nodes are not required to maintain routing tables. in which each node chooses the neighbour closest to the destination as its next forwarding node. The first formal location based routing algorithm based on a greedy principle. The algorithm fails if a void (a large subarea without nodes) exists in the forwarding direction that is the message reaches an intermediate node that is . the routing overhead is significantly reduced.

.

highbase.it indicates a monitoring level and when the data’s nearing the sp.Thus the parameters like lowbase. the usage of wireless sensors not only helps in movement of the data in the data hubs of the data center(DC). but when the data’s attain the level of hp. else the data’s will be transferred to the virtual Datacenters(VDC) co-ordinated with a secured networks. .midpoint and saturation points are used to calculate and measure the data storage levels in datahubs. The parameters lb and mp are seems to be good for a data hub(dh) to add much more data’s to it.DLSP algorithm In this DLSP algorithm.the sensors will path the data’s to some other data hub. we have used various functional parameters to measure the data stored rates in the data hub. If the data stored levels attain certain parameters then data’s will be routed to some other nearest DH(data hub) of datacenter present within the network.

.

In both the implementation and in non implementation of DLSP algorithm there is no any change in the low base point B. it is to be noted that other than text no any type of data can reach that saturation point in the datahubs. At the same time while using a data hub without implementing the DLSP algorithm it shows a decrease in its performance. Midpoint: It’s a point which denotes the middle level of the data storage level in the data hub of a Datacenter. D.A. then after implementing the DLSP algorithm all the data type reach the saturation point. While using the datahub to store the based on the various types of data. Saturation point: Saturation point is the only point which helps to identify the need of DLAP algorithm in managing the datahubs in the Datacenter of a network. It shows the performance increase in terms of data storage and data movements across the datahubs in .Low base: It’s a point which denotes the lowest level of the data storage level in the data hub of a Datacenter. Highpoint: It is an important point which shows a drastic change in the performance of a data hub in the Datacenter while implementing the DLSP algorithm. In this there is a change in performance between the implementation and non implementation of DLSP algorithm there is no any change in the low base point C.

to the destination node D. if the data’s are related to videos and these data movements are path to the related data hub based on its categorization and based on the location prioirities.these location priorities are calculated based on the distance from the source node S. This change are instead of moving the data’s from one node to each node in the entire network. For example. we used to move the data’s to the particular data hub based on the categorization and location.Priority Based Routing Algorithm In this algorithm the data’s are transferred from the source S to the destination D based on the priority calculated for the nodes. This priority calculation is based on the location based algorithm. where the typical changes that we have implemented in this algorithm. .

Priority Based Routing Algorithm: PBRA(S. If s 0 then D routed S=s+1 While (Loc (n) < Loc (n.n+1…. D. So.but also route the data to virtual DC while all the network DH(Data hub) seems to e full. Loc) Begin Routing of Datasets D from source node (Hub) S to destination node (D) based on categorization(c) And Location based priority (LBP). Initial S0 Categorized D Path the D to nearest node based on LBP using short path first option..n)) Then Route to loc(n) Else Route to VDC (Virtual Datacenter) (note: The routed data’s not only transfer its data movements based on categorizing data’s and finding out the LBP. .

but also between the datacenter and between the datacenter and virtual datacenter. Where the virtual datacenter seems to somewhere located other than our private networks. These two algorithm which helps to manage the data flow in the datacenter. not only devise the theory for data movements and data routing efficiently but also helps to access the data elements fastly from the data hubs associated in a network. not only within the datacenters. that helps to have a clear cut ideas to measure the data movements and efficiency of data management using the wireless sensors and their associated wireless sensor nodes. The various levels indicators and graphical models. .Performance Analysis for Data Movements and Data retrieval As the ultimate purpose of DLSP and PBRA algorithm.

.

. the DLSP and PBRA which helps us to manage and transferring of data’s within the private and public data centers efficiently and timingly. The PBRA algorithm which is an associated algorithm for routing the data’s to its appropriate destination based on the categorization and nearest data hub calculated using this algorithm. which guaranteed efficient data storing in data centers. Among the existing algorithm. This DLSP algorithm is specially constructed for the purpose of splitting up of data’s within the data hubs of the data centers based on various parameters and level indicators.CONCLUSION In this paper. we propose a DLSP and PBRA algorithm.These algorithm which enables the auto data movements in the data centers within the data hubs and shows the drastic increases in the performance of datacenters and virtual data centers in Cloud computing . This DLSP algorithm can be implemented to manage and transfer the data’s efficiently using wireless sensors between various DH of the datacenters.

THANK YOU .