Persistent Object

sharing for Sidle

Services

Presented by:
Mohsin (09-CSS-46)
Abd-Us-Salam(09-CSS-01)
)

Introduction
We are going to present a
system that coordinates
service
proxies placed at the
sidle of
the Internet to serve
distributed
clients accessing a service
involving mutable objects.
It performs consistent
accesses
to shared objects by
migrating
the objects to proxies

It reduces the workload in the server. It perform the all

operations in the proxies itself.

It handles two process serializability and strict

serializability
for durability in the consistent object sharing.

It supports optimizations for single-object reads that do

not involve migrating the object.

It disperses the computation load across the proxies

and saving the costs of sending operation parameters
over the wide area when these are large.

Proposed Scheme

This system forms the

proxies
in the tree structure. It
shares
the objects within the
proxies.
It reduces the workload in
the
server.
It enables consistent
multiobject operations and
optimizations for singleobject
reads that are not possible

object

 This system recovers the proxy disconnection. The

disconnected proxies maintained by alternate
proxies
or it will be maintained through server.
This System use the kruskals algorithm for
maintaining tree
structure. It reduces weightage in the tree structure.
It holds the object even when the proxy has been
disconnected.

Implementation
Modules :

Server and Proxy creation.

Object Migration from centralized server to proxies.
Parent Proxy and Child Proxy Maintenance while
dis-connection.
Parent Proxy and Child Proxy Maintenance while
dis-connection.
Multiple and Consistent object sharing.

Module 1 :In this module we going to launch a

centralized server , unbounded number of parent
proxies and minimum number of child proxies. This
server will provide the application to all the parent
proxies.
Module 2 :This module deals with object migration its
nothing
but transferring our application from centralized server
to the parent proxies. The server converts the whole
application to
an object. Then the parent proxies provides object to
the child proxies.

Module 3 :This module provides the alternate solution

when
the proxies getting down. The client will get the
response
from some other proxies.
Module 4 :Here we are going to maintain the depth of
the tree using kruskals algorithm. This algorithm
calculates the round trip delay between the proxies
.Through that it will found the data round trip delay.
Module 5 :In this module we going to share the object
consistently with out any interruption.

References
L. Gao, M. Dahlin, J. Zheng, L. Alvisi, and A. Iyengar, DualQuorum Replication for Edge Services, Proc. Sixth ACM/
IFIP/Usenix Intl Middleware Conf. (Middleware), 2005.
M.T. O zsu and P. Valduriez, Distributed and Parallel
Database Systems,ACM Computing Surveys, vol. 28, no. 1, pp.
125-128, 1996.
M. Nuttall, A Brief Survey of Systems Providing Process or
Object Migration Facilities, ACM Operating Systems Rev., vol.
28, no. 4, pp. 64-80, Oct. 1994.
S. Miloji_ci_c, F. Douglis, Y. Paindaveine, R. Wheeler, and S.
Zhou, Process Migration, ACM Computing Surveys, vol. 32,
no. 3, pp. 241-299, Sept. 2000.
Michael K. Reiter, Asad Samar, : Consistent Object Sharing for
Edge Services,IEEE Trans. On parallel and distributed
system,vol.19, No.7, July 2008.

THANK
YOU