th st
SOCIAL PRIVATE CLOUD COMPUTING FOR HIGHER SECURE
VIRTUAL PROCESSING
1
RAYAN JAHA, 2NAVRATI SAXENA, 3JAMILAH JAHA
1,2,3
Collage of Information and Communication Engineering, Sungkyunkwan University, Suwon, Korea
Abstract- There are many users in the universities who need more computational power than they own, on the other hand there are some other users who use less computational power than they own, also there are some wasted computer resources not being used at all such as idle computers in libraries, labs, classrooms, etc. By interconnecting all these computers to a network manager, we can create one large scale computing resource (private cloud) used for virtual processing with a high throughput computing. However, the only thing that stops the users to share them computational resources is trust. In this paper we propose a system that prevent the user from these security overheads, by creating social private cloud computing.
Index Terms- Cloud computing, Network Security, Social networks, Virtual processing.
I. INTRODUCTION
High throughput computing on large groups of distributed owned computing resources has existed for a long time. Only few users allow a stranger (random professor or a student) to use their computational power. Even if data encrypted, there is always a way. Basically, users who want to process data virtually they have no guarantee of data protection, which means that they have to trust them in order to process them data. Therefore, the important factor here is the trust. We are looking for a way to deduce a level of trust between users here for instance, a friendship.
Trust is a very important factor in cloud computing but the question is “how can users trust each others?” to answer this question we need to understand how to build up a trust. Trust is usually built up during real life relationships. For example a known student or a friend, or even professors. By taking all these relationships to the digital level we created digital social networks, similar to Facebook, Google plus, etc. They are digital relationships websites, some of these relations started from the beginning, in a digital world; it could be from online gamming, forums, etc. However, most of these relations based on a real life relations. Commonly in these examples, the users create an account then add people; he/she may know from his/her real life to the friends list.
We took the leverage of these digital social networks to improve the security overheads regarding virtual processing. By building the trust between users, will make them use our system, because users are more likely to trust his/her friend or a professor, which eventually leads to high throughout private cloud computing. In particular, this paper we propose a private cloud computing system for a university based on Trust. By using the web application that the university provides, to invite other users based on real
relationship and process the data virtually. Specific contributions of our work are summarized below:
We design a new private cloud computing based on real life relationships to increase the number of users which will eventually lead to higher throughput computing.
Our system allows the user to describe the job he/she wants to get it done. Then the network manager matches the best resources that match the job.
The system we designed is taking the advantage of the idle computers, which are wasting computational resources.
The rest of the paper is organized as follows: Section 2 states the structure of our system. In Section 3, system scenarios will be discussed. Finally, section 4 concludes the paper remarks.
II. SYSTEM DESIGN
Creating the system is very simple; briefly, we divide it into two parts. First part is creating the private cloud, by sharing all the available computational resources in the university to build one large-scale computational resource. Then, for the second part we create social networks between the users. We combine them together to get social private cloud computing. Basically, the university provides virtual processing and social networking web application that accomplishes these tasks. In between, it also creates and schedules jobs as well.
A. Creating private Cloud 1) Cloud Architecture
To create the cloud we should link all the computers in the university to a network manager, which will create a large environment of heterogeneous resources. Fig. 1 shows the basic architecture and every computer where it can come from.
Fig. 1. Network Architecture
a) Network Manager
Network manager is the central computer; from which all computers are connected to manage them. Network manager, is responsible for job queuing and job assigning to the worker computers whether it is idle or not. It is also responsible to keep tracking the status of these jobs after assigning them. Network manager has the ability to match the job based on the description that user makes. For example, if the user wants to execute the job on matlab, then the user must describe that, and then the network manager will match the worker computer that has matlab.
b) Worker Computers
Worker computers are those, which provide the computational power for the system, the more we have the more computational power we get. There are two types of worker computer:
(1) Public Worker Computer
These types of computers do not have an owner, such as the computers in the libraries, classrooms, printer computers and browsing computers. These computers are turned on almost all the time; also, they remain idle most of the time. Public worker computers are configured only to receive jobs from the network manager; which means that it will always accept the job once it receives it. Since these computers are public, which means, anyone can use it, therefore leading to higher risk to process the data virtually on it. However, using these computers, it requires the university identification number, which is provided by the university itself to every student and professor just make sure the system knows who is using the computers. If it is still risky to use, make some policies. Assign non-important jobs only when the worker machine is in idle state. For example, if there is a student who need to execute non-important code. While the student submitting the job and describe it, as a non-important job, then the network manager based on the job description, will allocate the worker computer. Which in this case primarily, it will try to find private worker computer and if it did not find any then it will look for a public worker that stated as an idle. Fig. 2 shows how the network manager will
allocate worker computer with higher priority to trusted group first which is intended to his friends.
Fig. 2. Non-important Jobs (2) Private Worker Computer
Private worker computer mean that every computer has an owner either a student or a professor. They also have to log in with the university identification number for more authentication concerns. Private worker computers has the ability to place jobs in the network manager’s queue, after that network manager will allocate the matched worker computer and get them execute, and they also has the ability to receive jobs from the network manager that needed to be execute on their computer in return. Which is mean everyone has to share their resources unless they need it. The user can only assign jobs to the network manager if more resources needed than the user has.
B. Build social networks
The platform of social networks is provided by the web application, which the university provides. In the traditional social networks cannot guarantee a specific profile is linked to the real person, taking for example, Facebook is not able to guarantee this profile it linked to the real person who is pretending to be. To guarantee profiles are linked to real persons, we proposed login with the university identification, which is usually issued after submitting some official documents.
th st The web application has the ability to invite a friend. When someone adds a friend, the user has some knowledge of the friend who has added and this kind of relation starts from a real life. For an instance, they could classmates or the user could be a professor of another user. However, the invitation does not describe the level of trust between these users whether the user is a student or a professor. Therefore, the web application provides the ability to create groups for the individual to describe the level of trust based on the relation in a real life. For example, the user just invited a very close friend whom they know each other for a long time and they also trust each other, then the user adds the friend to close friend group.
In the other hand, a user just invites someone whom he meets in the class, and then the user adds the friend to a group that has a sharing limitation. Different sharing policies depends on the group, for instance a user from close friends group is more likely to share resources openly, however might not be true for a friend who just met. In Fig.3 the spotted student has three students and two professors who can trust, however the student also got one student who just met and not fully trusted.
Figure 3 Social Networks III. SCENARIOS
There are different scenarios depending on the situations and the ability we are talking about. We will start with the basic one, which will include the goal of the paper.
C. Basic Scenario
In order to make the system work, two users must have a relationship in real life, any kind of a relationship whether a student with another student or a student with a professor or even a professor with a professor. Let us assume Mr. A and Mr. B are friends from high school, and they trust each other. Mr. A and Mr. B are both a master degree
students. Let us assume Mr. A’s work research require less computational power than he has. On the other hand, Mr. B’s work needs more computational power than he has. This is what our system for. We have trusted users who need virtual processing. In willing to use the system they both have to log in to the university web application with student identification number, Mr. A or Mr. B sends a friend request and the other accepts it. Now they have digital friendship, they make a group and add him to that group; for example, he creates a group to add people who he really trusts. We finished with the first step, which is creating social network.
The next part, is borrowing a resource from a friend for virtual processing. Since Mr. A doesn’t need his full resources, he can configure his account to receive jobs. The status of Mr. A will be sent to the network manager. In the other side there is Mr. B who needs more resource, he creates the file and sends it to the network manager. Network manager will receive the job and put it in the queue. In case the queue is empty, the network manager will update its worker computers status and relations and as soon network manager finds a worker computer (in this case is Mr. A’s computer) it will assign the job to Mr. A’s computer and keep tracking job’s status and return it when it is done.
D. Job Description
Job description is the ability to improve the performance of the system. In case the user wants to execute a file that requires a specific program, then the user must mention it in the description and after sending the job to the network manager, the allocator will match it with a worker computer regarding to the description. For example, a user want to execute an X-code file then the user must mention that, in the description. After that the user sends the file to the network manager, then the allocator will match the information he gave with a worker computer’s that have X-code installed. In Fig. 4 the above example has been explained, where four of his friends are ready to share them resources. However, some of them have different operation systems, Xcode only work in Mac environment, there are two friends who are using Mac operation system, but only one of them have the Xcode installed. Which is the one that network manager has been allocated. Job description also could be use to choose a specific group only to search for a worker computer.
E. Idle Computers
Idle computers is a good idea, because there are lot of idle computers all over the university and beside wasting these computational resources, it is advisable to use them. Since there are more worker computers, we will have more free resources that we can use. In public worker computers, we only use them when they are idle, we also could use private idle computers as
well expressed in Fig 2. In case, the user has non-important job is to be done. The user must send the job to the network manager as a non-important, and supposing that there is none of his/her social network user is sharing at the moment. Public computer will be allocated if and only if it stays an idle.
Fig. 4. Job Description
F. Policies
Polices is almost similar to the job description, the different is that the job description managed by the sender, and the policies is managed by the receiver. There are several scenarios, for example the worker which configured to share its resource at the moment could make a policy stating that a job can be received from this group only, or only if the receiver is an idle, or even it can specifies the time to receive jobs, for instance Mr. A leave the lab at 6 p.m. and return next day at 10 a.m. any job received between 6 pm to 8 am is accepted.
G. Overall Scenario
In this scenario, we try to explain the highest priority. In order, network manager allocate a worker computer. The higher priorities have higher security than lower priorities. Always the network manager will allocate highest trusted group as a first step then it will look for idle computers. For example if the user has different groups, the highest trusted group will be chosen. Also, from the highest trusted group, it will try to find idle computers first. Fig 5.
Fig. 5. Overall Scenario CONCLUSION
In this paper, we have proposed a social private cloud computing system to overcome the security overheads, which is a combination of virtual cloud processing and social networks. In our system, we have used all computers in the university as
resources, in order to create one
large-scale computational power and taking the leverage of the public computers while it is in idle mode and private computers for more secure data processing. We have taken the leverage of real life relationships and converted it to digital relationship based on trust, and used that trusted relationship to secure virtual processing between worker
computers. The more secure computing will lead to more users to share their computational resources, which will lead to more efficient and higher throughput computing.
REFERENCES
[1] S. Chen, B. Mulgrew, and P. M. Grant, “A clustering technique for digital communications channel equalization using radial basis function networks,” IEEE Trans. on Neural Networks, vol. 4, pp. 570-578, July 1993. K. Chard, k. Bubendorfer, S. Caton and O. F. Rana, “Social Cloud Computing: A Vision for Socially Motivated Resource Sharing,” Services Computing IEEE Transactions, vol. 5, no. 4, October-December 2012.
th st [2] Ellison, N. B., Steinfield, C. and Lampe, C. (2007), The
Benefits of Facebook “Friends:” Social Capital and College Students’ Use of Online Social Network Sites. Journal of Computer-Mediated Communication, 12: 1143–1168. doi: 10.1111/j.1083-
[3] R. Raman, M. Livny, M. Solomon, “Matchmaking: Distributed Resource Management for High Throughput Computing, ” IEEE International Symposium on High Performance Distributed Computing.
[4] S. Taylor, “High Performance Computing of Hydrologic Models Using HTCondor,” Brigham Young University, April 2013.
[5] D. Warneke, O. Kao, "Exploiting Dynamic Resource Allocation for Efficient Parallel Data Processing in the Cloud,” IEEE transactions on Parallel and Distributed Systems, VOL. 22, NO. 6, JUNE 2011
