DECENTRALISED QOS DECENTRALISED QOS AWARE CHECKPOINTING AWARE CHECKPOINTING

ARRANGEMENT IN MOBILE ARRANGEMENT IN MOBILE GRID COMPUTING GRID COMPUTING

ABSTRACTABSTRACT This paper deals with decentralized, QoS-aware middleware for This paper deals with decentralized, QoS-aware middleware for

Checkpointing arrangement in Mobile Grid (MoG) computing systems. Checkpointing arrangement in Mobile Grid (MoG) computing systems. Checkpointing is more crucial in MoG systems than in due to less Checkpointing is more crucial in MoG systems than in due to less reliable wired links, frequent disconnections and variations in mobile reliable wired links, frequent disconnections and variations in mobile systems. We’ve determined the globally optimal checkpoint arrangement systems. We’ve determined the globally optimal checkpoint arrangement to be complete and so consider Reliability Driven (ReD) middleware, to be complete and so consider Reliability Driven (ReD) middleware, employing decentralized QoS-aware heuristics, to construct superior employing decentralized QoS-aware heuristics, to construct superior check pointing arrangements efficiently. With ReD, a node simply sends check pointing arrangements efficiently. With ReD, a node simply sends its checkpointed data to one selected neighboring host, and also serves its checkpointed data to one selected neighboring host, and also serves as a stable point of storage for checkpointed data received from a single as a stable point of storage for checkpointed data received from a single approved neighboring MH. ReD works to maximize the probability of approved neighboring MH. ReD works to maximize the probability of checkpointed data recovery during job execution, increasing the checkpointed data recovery during job execution, increasing the likelihood that a distributed application, executed on the MoG, likelihood that a distributed application, executed on the MoG, completes without sustaining an unrecoverable failure. It allows completes without sustaining an unrecoverable failure. It allows collaborative services to be offered practically and autonomously by the collaborative services to be offered practically and autonomously by the MoG. Simulations and actual testbed implementation show ReD’s MoG. Simulations and actual testbed implementation show ReD’s favorable recovery probabilities with respect to Random Checkpointing favorable recovery probabilities with respect to Random Checkpointing Arrangement (RCA) middleware, a QoS-blind comparison protocol Arrangement (RCA) middleware, a QoS-blind comparison protocol producing random arbitrary Checkpointing arrangements. Message producing random arbitrary Checkpointing arrangements. Message movement is continuously monitored by the global optimal check point movement is continuously monitored by the global optimal check point arrangement. Message travels only through Reliablity driven arrangement. Message travels only through Reliablity driven middleware. In case of any intrusion to the message traveling path the middleware. In case of any intrusion to the message traveling path the global optimal check point arrangement does not allow the intruder to global optimal check point arrangement does not allow the intruder to view the message because it is not a valid middleware. In case of any view the message because it is not a valid middleware. In case of any node failure the message is retained in the system hence employing QoS. node failure the message is retained in the system hence employing QoS.

EXISTING SYSTEMEXISTING SYSTEM When user file migrates from one place to When user file migrates from one place to

another place there may me lot of issues another place there may me lot of issues regarding their information.regarding their information.

At each time when their node is changed, At each time when their node is changed, their information may also lose. Once user their information may also lose. Once user loses their data they can’t restore back. This loses their data they can’t restore back. This is major disadvantage in the existing system.is major disadvantage in the existing system.

As earlier proposed checkpointing As earlier proposed checkpointing arrangement cannot be applied directhy to arrangement cannot be applied directhy to MoGs and are not Qos-aware checkpointing MoGs and are not Qos-aware checkpointing and recovery specifically for MoGs, with this and recovery specifically for MoGs, with this paper focusing solely on checkpointing paper focusing solely on checkpointing arrangement arrangement

PROPOSED SYSTEMPROPOSED SYSTEM Checkpointing and recovery to support execution, Checkpointing and recovery to support execution,

minimizing execution rewind, and recovery rollback delay minimizing execution rewind, and recovery rollback delay penalties. Depending upon the application’s or job’s penalties. Depending upon the application’s or job’s tolerance for such delay (i.e., a QoS metric), its performance tolerance for such delay (i.e., a QoS metric), its performance can be poor or it can be rendered totally inoperative and can be poor or it can be rendered totally inoperative and useless. In his proposed system Our Reliability Driven useless. In his proposed system Our Reliability Driven middleware, ReD, allows an MoG(mobile Grid) scheduler to middleware, ReD, allows an MoG(mobile Grid) scheduler to make informed decisions, selectively submitting job portions make informed decisions, selectively submitting job portions to hosts having superior Checkpointing arrangements in to hosts having superior Checkpointing arrangements in order to ensure successful completion byorder to ensure successful completion by

1) providing highly reliable checkpointing, increasing the 1) providing highly reliable checkpointing, increasing the probability of successful recovery, minimizing rollback probability of successful recovery, minimizing rollback delay, and delay, and

2) providing performance prediction to the scheduler, 2) providing performance prediction to the scheduler, enabling the client’s specified maximum delay tolerance to enabling the client’s specified maximum delay tolerance to be better negotiated and matched with MoG resource be better negotiated and matched with MoG resource capabilities.capabilities.

Modules Mobile Client

Tower ConstructionQuery Processing

CheckpointRemoval of data

Modules descriptionModules description Mobile Client Mobile Client Grid involving mobile Grid involving mobile

hosts to facilitate user hosts to facilitate user access to the Grid and to access to the Grid and to also offer computing also offer computing resources. A MoG can resources. A MoG can involve a number of involve a number of mobile hosts (MHs), i.e., mobile hosts (MHs), i.e., laptop computers, cell laptop computers, cell phones, PDAs, or phones, PDAs, or wearable computing wearable computing gear, having wireless gear, having wireless interconnections among interconnections among one another, or to one another, or to access points. This access points. This mobile client can access mobile client can access the checkpoint.the checkpoint.

RegistrationRegistration User must register User must register

their details to their details to acesses the serveracesses the server

This requires IPadress This requires IPadress in the case of in the case of computer networkscomputer networks

In mobile networks, In mobile networks, phone number is used phone number is used for this purposefor this purpose

Tower ConstructionTower Construction To implement this system we have to To implement this system we have to

construct the Tower network. we have to construct the Tower network. we have to construct the Tower Construction connection. construct the Tower Construction connection. User travels from one tower to another tower User travels from one tower to another tower the data present with the user will be the data present with the user will be dynamically travels along with the user. The dynamically travels along with the user. The network tower construction is to connect one network tower construction is to connect one tower to another tower, so that the data from tower to another tower, so that the data from the user will be dynamically stored as the the user will be dynamically stored as the check point in the corresponding towers. check point in the corresponding towers.

Tower/ Network Tower/ Network constructionconstruction

SourceSource DestinationDestination NodesNodes Number of nodesNumber of nodes

SourceSource This tells about the This tells about the

system where the system where the data is to be data is to be transmittedtransmitted

DestinationDestination Place where the Place where the

message(or)informmessage(or)information is to be ation is to be reachedreached

NodesNodesInter mediate Inter mediate points (check points (check points) where our points) where our data passes data passes throughthrough

It is called as It is called as towers in mobile towers in mobile networksnetworks

Number of nodesNumber of nodes The Inter mediate points (check The Inter mediate points (check

points) where our data passes points) where our data passes through is called as nodesthrough is called as nodes

This number defines about the count This number defines about the count of towers/checkpointsof towers/checkpoints

Message TransferenceMessage Transference The message is transferred from the The message is transferred from the

source to the adjacent nodesource to the adjacent node

If connection is not established the If connection is not established the message is transfered to the next message is transfered to the next node provided the details are stored node provided the details are stored in previous nodein previous node

Query Processing Query Processing The query processor turns user queries and data The query processor turns user queries and data

modification commands into a query plan - a sequence modification commands into a query plan - a sequence of operations (or algorithm) on the database. When of operations (or algorithm) on the database. When the user lost any data during the trip they can send a the user lost any data during the trip they can send a query to the check point to recollect the data again.query to the check point to recollect the data again.

CheckpointCheckpoint Checkpointing is the process of periodically saving Checkpointing is the process of periodically saving

intermediated data and machine states on reliable storage intermediated data and machine states on reliable storage during the course of a long running application, so that in during the course of a long running application, so that in the event of a failure, the application can be recovered the event of a failure, the application can be recovered from the checkpoint saved prior to the failure, instead of from the checkpoint saved prior to the failure, instead of starting the application from the beginning. In mobile grid starting the application from the beginning. In mobile grid computing systems, hosts are interconnected wirelessly computing systems, hosts are interconnected wirelessly and move at will. As a result, checkpointing becomes more and move at will. As a result, checkpointing becomes more complicated in a mobile grid computing system than in its complicated in a mobile grid computing system than in its conventional distributed computing counterpart, where conventional distributed computing counterpart, where hosts are stationary and interconnected by (broadband hosts are stationary and interconnected by (broadband and fairly reliable) wire-lines. Checkpointing for mobile and fairly reliable) wire-lines. Checkpointing for mobile grid computing systems, an area with limited research so grid computing systems, an area with limited research so far. In such a system, link and node failures (due to far. In such a system, link and node failures (due to transmission contention and modal moves) are more transmission contention and modal moves) are more frequent, so even an application of relatively short frequent, so even an application of relatively short execution duration calls for checkpointing. execution duration calls for checkpointing.

Removal of Data Removal of Data The Data is removed from the server The Data is removed from the server

once the user successfully reaches once the user successfully reaches the Destination. This process of the Destination. This process of deletion would be of use to reduce deletion would be of use to reduce the data load in the main server. the data load in the main server.

USE CASE DIAGRAM • Mobile clientServerRegister his detailsResponse regarding registration

• User initially registers his details with the server where in any case of emergency he can retrive his information by specifying the password. In advance: When the expense of mechanisms to provide QoS is justified, network customers and providers typically enter into a contractual agreement termed a service level agreement (SLA) which specifies guarantees for the ability of a network/protocol to give guaranteed performance/throughput/latency bounds based on mutually agreed measures, usually by prioritizing traffic.

Mobile client

Server

Register his details

Response regarding registration

Level 0- Client Registration

Mobile clientServer

Register source and destination

Level 1-Login during the transfer

Check point

Creating checkpoint to store that user’s info

The user can create check points among the source to destination where the information passes through these nodes and the user can retrace the information. Commercial services are often competitive with traditional telephone service in terms of call quality even though QoS mechanisms are usually not in use on the user's connection. Under high load conditions may degrade to cell-phone quality or worse. The mathematics of quality indicate that network requires just 60% more raw capacity under conservative assumptions.

SCREEN SHOTSSCREEN SHOTS

At the time of compilation the user sets the java path and then compile where the first login frame appears where he can select his own choice of action. Initially the user must register the details for logging into the system

The user must press the new button for logging into the system where he must register his details like name and password and click submit where his details are registered into the server. This processes is to ensure security.

The user when enters his details like name and password and press the login button he will get a frame where he can select a file to send and also the neighbor peer to which the file is to be sent

In this form the second user enters his details and along with the neighbor peer with which only the user will be connected. It acts as a tower through which the message passes through. In case of message sending failure the user can easily trace the information from this node or tower. The pop up message indicates about the connection establishment.

The user when enters his details like name and password and press the login button he will get a frame where he can select a file to send and also the neighbour peer to which the file is to be sent

The third user after his registration selects the peer node adjacent to it through which the message passes through. More over the connection is established to its neighbor peer is maintained through out the processes which cannot be changed easily once the message starts flowing through the network.

Now the connection between the nodes are established and also the path has been set. The user must select a file to send from the source to destination which is explained in the above figure

The required file has been chosen and is selected to send to the third user where he can receive the file. But the path is directed through the second user. So the message passes through the second user and reaches the destination

Above figure illustrates about the path through which the message has been traveling from source to destination. When the file reaches the destination user can get the acknowledgement. In case if the file doesn’t reach the destination the user can trace the message easily.

Acknowledgement to the server that the message has reached the destination along the path through which the data moved

REFERENCESREFERENCES [1] Sharma,”[1] Sharma,” Integrating stream and complex event processing” Integrating stream and complex event processing”

2006.2006. [2] Raman Adaikkalavan , “ Event Specification and Processing [2] Raman Adaikkalavan , “ Event Specification and Processing

for Advanced Applications: Generalization and Formalization ”, for Advanced Applications: Generalization and Formalization ”, Jan. 2007.Jan. 2007.

[3] Fusheng Wang, “ Complex RFID event processing” Jan. 2007.[3] Fusheng Wang, “ Complex RFID event processing” Jan. 2007. [4] Peiya Liu and Yijian Bai “Bridging Physical and Virtual [4] Peiya Liu and Yijian Bai “Bridging Physical and Virtual

Worlds: Complex Event Processing for RFID Data Streams” Worlds: Complex Event Processing for RFID Data Streams” white paper, Akogrimo Consortium, 2006.white paper, Akogrimo Consortium, 2006.

[5] J. Long, W. Fuchs, and J. Abraham, “Compiler-Assisted Static [5] J. Long, W. Fuchs, and J. Abraham, “Compiler-Assisted Static Checkpoint Insertion,” Proc. Symp. Fault-Tolerant Computing,pp. Checkpoint Insertion,” Proc. Symp. Fault-Tolerant Computing,pp. 58-65, July 1992.58-65, July 1992.

[6][6] Dazhi Chen and Pramod K. Varshney, ”QoS Support in Dazhi Chen and Pramod K. Varshney, ”QoS Support in Wireless Sensor Networks” ,Jan 2005Wireless Sensor Networks” ,Jan 2005

[7] L Zeng, B Benatallah, M Dumas, M Dumas, H Chang, ” QoS-[7] L Zeng, B Benatallah, M Dumas, M Dumas, H Chang, ” QoS-aware iddleware for Web services composition”, Jan 2007aware iddleware for Web services composition”, Jan 2007

[8] Jorge Cardoso “Quality of service for workflows and web [8] Jorge Cardoso “Quality of service for workflows and web service rocesses”, Jan 2001service rocesses”, Jan 2001

[9] Yutu Liu, Anne H Ngu, Liang Z Zeng “QoS computation and [9] Yutu Liu, Anne H Ngu, Liang Z Zeng “QoS computation and policing in dynamic web service selection”,Jan 2005policing in dynamic web service selection”,Jan 2005

[10] D Menasce, H Ruan, H Gomaa “QoS management in service-[10] D Menasce, H Ruan, H Gomaa “QoS management in service-oriented architectures”oriented architectures”