scalable grid system– vdha_grid: an e-science grid with virtual and dynamic hierarchical...
TRANSCRIPT
Scalable Grid system– VDHA_Grid:an e-Science Grid with virtual and dynamic
hierarchical architecture
Huang Lican
College of Computer Science , Zhejiang University
Backgroud
College of Computer Science ,Zhejiang University
•The mode of Grid computing is client/server at present. It is not scalable. Scalability is the most challengeable problem of Grid computing
• P2P computing is scalable but it does not fulfill the requirements of Grid computing
•We want something which has P2P properties and also is easily managed and implemented
•Virtual and Dynamic hierarchical architecture is just the thing we want.
Advantages of VDHA
College of Computer Science ,Zhejiang University
• Combine advantages of P2P and C/S
• Satisfy the scalable and dynamical requirements of Grid
Overview of Virtual and Dynamic Hierarchical Architecture (VDHA)
College of Computer Science ,Zhejiang University
• dynamic and virtual hierarchical architecture to satisfy the requirements of Grid computing. • Client end (client host) accesses Grid system via a node (called as entrance node). • The nodes are grouped virtually. • Nodes can join the group and leave the group dynamically.• The groups are virtually hierarchical, with one root-layer, several middle-layers, and many leaf virtual groups (these groups are called VOs). • Among the nodes of VOs, one ( just one ) node (called as gateway node) in each group is chosen to form upper-layer groups, from the nodes of these upper-layer groups to form upper-upper-layer
Network Structure of VDHA_Grid
College of Computer Science ,Zhejiang University
e-Scien ce grid
d es k to p
s er v er
en tr an c een tr an c e
en tr an c een tr an c e
en tr an c e
n o d e
w ir e les s
n e tw o r k
P D A
C ell P h o n e
L ap to p
Kio s k
Structure of VDHA
College of Computer Science ,Zhejiang University
n o d e
g atew ay n o d e
VO
r o o t v ir tu a l g r o u p( F ir s t- lay er v ir tu a l g r o u p )
S ec o n d - lay er v ir tu a l g r o u p
T h ir d - lay er v ir tu a l g r o u p
Some concepts of VDHA
College of Computer Science ,Zhejiang University
Grid node: node in the Grid system Entrance node :a Grid node which is an entrance point for users to login into the Grid systemOwned node: a Grid node which manages the users User: role which uses the Grid Client host: an apparatus used by users to login into the Grid system and to do the business. Gateway node: a Grid node which takes coordinate functions in several different layer virtual groups Virtual group: a group virtually formed by the Grid nodes Coordinator of virtual group : a gateway node taking
coordinate functions in the virtual groupVirtual group tree: a hierarchical tree formed by virtual groups
Definition of VDHA
College of Computer Science ,Zhejiang University
VDHA is a virtual group tree with depth of at least two layers.VDHA has dynamic properties in the number of grid nodes, layers and virtual groups, virtual group compositions, and so on.
Grid Group Management Protocol(GGMP)—maintaining the virtual group t
ree
College of Computer Science ,Zhejiang University
If there are any changes in any nodes such as a node’s joining or leaving, these changes are forwarded to gateway node, which forwards this change information to all the nodes in the two neighboring layer groups.if there is any status changed needed to change gateway node, online node with maximum weight value is chosen as the new gateway node.
Scalable service discovery
College of Computer Science ,Zhejiang University
• Unlike Web service and Globus, VDHA_Grid Publishes and registers the service into the ownerNode by the administrator of the node itself.• service description is based on RDF.•Service discovery is scalable. Time, space and message_cost Complexity is salable, and the Implementation is also scalable.
Grid Service Description Framework (GSDF) and ontology-based Grid
service description language
College of Computer Science ,Zhejiang University
Must answer the following questions:(1) How does QDP use GSDF to find the services?(2) What protocol does the service bind and how does the protocol marshals?(3) How does SLMS use GSDF to implement the services?(4) How does the service account? (5) How does the service grant access right (authorization)?(6) What QoS does the service support?
Query and Discovery Protocol(QDP)
College of Computer Science ,Zhejiang University
a , b , c , d e , f , g , h i, g , k , l q , r , s , t w , x , y , z 1 , 2 , 3 , 4 5 , 6 ,7 , 8m , n , o , p
c , g i, o 4 ,5q ,y
c , i y ,4
i,yR o o t lay er
Seco n d lay er
T h rid lay er
F o u rt h lay er
Full Search Query and Discovery Protocol (FSQDP)
FSQDP performance
College of Computer Science ,Zhejiang University
Influence of number of nodes in a virtual group on the time response(suppose all virtual group has the same number of nodes)
FSQDP performance -continue
College of Computer Science ,Zhejiang University
influence of number of layers on the time response
Query and Discovery Protocol(QDP)
College of Computer Science ,Zhejiang University
Domain-Specific Query and Discovery Protocol (DSQDP)
a , b , c , d e , f , g , h i, g , k , l q , r , s , t w , x , y , z 1 , 2 , 3 , 4 5 , 6 ,7 , 8m , n , o , p
c , g i, o 4 ,5q ,y
c , i y ,4
i,yR o o t lay er
Seco n d lay er
T h rid lay er
F o u rt h lay er
AL L
S o n g
P o p u larC las s ic
M ad o n n a
Query and Discovery Protocol(QDP) --complexity
College of Computer Science ,Zhejiang University
FSQDP
max( ) (4)complexity vgT O n
max( ) (5)complexity vgS O n
_ cos ( ) (6)complexityMessage t O N
max( ) (14)complexity vgT O n
max( ) (15)complexity vgS O n
max_ cost ( ) (16)complexity vgMessage O n
1
2
3
DSQDP
4
5
6
Scalable Grid Security Infrastructure
College of Computer Science ,Zhejiang University
(1) Nodes in the Grid system are trusted with each other.(2) Only user and node have certificates(3) Users are managed by their owner nodes(4) Grid nodes are grouped as virtual organizations (VO). These VOs are hierarchically grouped as virtual groups (VG).(5) All nodes and VO or VGs have global identification names (the nodes ID may be Internet IP address, IDs of VOs or VGs are similar to DNS).(6) The schema of mapping global entities to local entities is very easy. (local entity plus node name and VO path tree in virtual group tree forms globe entity
VDHA_Grid has the following properties:
Scalable Grid Security Infrastructure: log on Authentication
College of Computer Science ,Zhejiang University
VO _ AI
VO _ Br ain
AI _ Br a in ( Vir tu a l G r o u p )
A
B
C
D
C 1
1
4
2
3 en tr an c e n o d e p r o x y s ta t io n
Scalable Grid Security Infrastructure: log on Authentication
College of Computer Science ,Zhejiang University
Step1: the user gets access to client from which the user proxy is to be
created , client generate Reqmessage; Ow-public (user-private (authen-inf, user-credential)) Send (Reqmessage1, cli, ent);Step2: Send (Reqmessage1, ent, ow);Step3: User-public (ow-private (authen-inf1, user-credential 1)) Check Address-header with user-credential Check authen-inf ow-private (user-private(user-credential) ) Send (resultmessage, ow, ent); Send (resultmessage, ent, cli);
Scalable Grid Security Infrastructure: Access control
College of Computer Science ,Zhejiang University
s erv ice d es crip t io nd ep o s it y
ac c es s c o n tr o l
acco u n t in gac c o u n tin g
d atab as e
au th o r iza tio nd atab as e
au d it lo g
au d it p o lic ies
ac c o u n tin gp o lic ies
au th o r iza tio np o lic ies
Ad m in is tr a to r
au d itin g
S L M S
G r id s er v ic es
G lo b als u b jec t
1
23
4
5
S ec u r itys er v ic e
VDHA_Grid prototype implementation
College of Computer Science ,Zhejiang University
java implementation
College of Computer Science ,Zhejiang University
java implementation
College of Computer Science , Zhejiang University
VDHA_GRID mainframe
java implementation
College of Computer Science , Zhejiang University
Client_API
A scenario of service consuming and providing
c lien t h o s t en tr an c e n o d e n o d e n.......
node n w ith the se rv ice
Q DP
5. loc ate s ervice
6 . find serv ice
7 . Node n with the se rv ice8 G ot node n IPAddress
9 . requesting se rv ice
10 . se rv ice ins tance m essage
o w n er n o d e
1. request login2 . fo rw a rd lo g in re q u e s t
3 . is s u e a u th e n tica tio n ticke t
4 .g o t a u th e n tica tio nticke t
1 1 . p ro vid in g a n d co n s u m in g s e rvice
.......
Features of VDHA_Grid
College of Computer Science ,Zhejiang University
•Decentralized design and autonomy•scalability•Mobile computing and huge network•High performance and full discovery of resources and services•Fault-tolerance
CASE study(Chinese University
e-Science Grid CUEG)
College of Computer Science ,Zhejiang University
2 n d VG
All s c ien c er o o t VG
A I B rain I C B io lo g y a p p l. p h y s m at h
s o ftw are
ap p l. ch em is try d e s ig n & m a n uf a c tu r e
en v io n m en tres o u rce n u clear s ci co al C h in es e
m ed icin es m ic r o p h y s
B io m e d ic a lP h o to n ic s
Eq u ip m en tA g ricu ltu re
n a n o m e te rte c h n o lo g y
zh ejian gu n iv ers ity
Ts in g h u aU n iv ers ity IC T
I A E as tco m
AI . . .
M in is tr yD e p a r tm e n t
D ig i tal t ech
m a te r ia l
What is CUEG ?
College of Computer Science ,Zhejiang University
• The virtual research projects granted by MOE aimed to enhance the science and technology
research by virtual cooperation via Internet. ( information sharing and cooperation research)
• Its nodes are usually located in the Universities
or Institutes. ( present, most of servers are PC servers )
• The nodes are relative stable compared with
other type Grids.
• The Universities are always formed into virtual organizers according to specific domains, (especially key labs)
• several virtual organizers share a more general common domain.
Case : heterogeneous information sharing
College of Computer Science ,Zhejiang University
C lien t
m etad a ta d ep o s ito r ies
h e t e r o ge n e o us in f o r m a t io nsh a r in g se r v ic e
G r id N o d es erv ice d es crip t io nd ep o s it o ry
Q D P
G N S P /G G M P /AP e tc . p r o to c o l
C o r e M id d lew ar e
G rid w i th V D H A , s erv iced i s co v ery b y Q D P
D atab as e
o th erin f o r m atio n
s y s tem
D HI S W M
D atab as e
Conclusion
College of Computer Science ,Zhejiang University
•VDHA can solve the scale and autonomy problems•VDHA has mobile computing property. • VDHA has high performance and full discovery of resources and services. •VDHA may easily manage privileges and roles of users.• VDHA satisfies the needs of Grid about security and authentication
Thanks