MINIMIZING FILE DOWNLOAD TIME IN

STOCHASTIC PEER TO PEER NETWORKS

The peer-to-peer (P2P) file-sharing applications are becoming increasingly popular and account
for more than 70% of the Internet's bandwidth usage. Measurement studies show that a typical
download of a file can take from minutes up to several hours depending on the level of network
congestion or the service capacity fluctuation. In this paper, we consider two major factors that
have significant impact on average download time, namely, the spatial heterogeneity of service
capacities in different source peers and the temporal fluctuation in service capacity of a single
source peer. We point out that the common approach of analyzing the average download time
based on average service capacity is fundamentally flawed. We rigorously prove that both spatial
heterogeneity and temporal correlations in service capacity increase the average download time
in P2P networks and then analyze a simple, distributed algorithm to effectively remove these
negative factors, thus minimizing the average download time. We show through analysis and
simulations that it outperforms most of other algorithms currently used in practice under various
network configurations.

MODULE 1:

File is divided into k chunks of equal size and k simultaneous connections are used .

Client downloads a file from k peers at a time. Each peer sends a chunk to the client.

MODULE 2:

File is divided into many chunks and user downloads chunks sequentially one at time.

The client randomly chooses the source peer at each time slot and download the chunks
from each peer in the given time slots.

MODULE 3:

File is divided into many chunks and user downloads chunks sequentially one at time.

Whenever a user completes a chunk from its current source peer, the user randomly
selects a new source peer and connects to it to retreive a new chunk.

Switching source peers based on chunk can reduce average download time

ONLINE COLLEGE PORTAL

Abstract
Online College Portal (OCP) provides a simple interface for maintenance of studentfaculty
information. It can be used by educational institutes or colleges to maintain the records of
students easily. The creation and management of accurate, update information regarding a
students academic career is critically important in the university as well as colleges. Student
information system deals with all kind of student details, academic related reports, college
details, course details, curriculum, batch details, placement details and other resource related
details too. It tracks all the details of a student from the day one to the end of the course which
can be used for all reporting, tracking of attendance, progress in the course, completed semesters,
upcoming semester year curriculum details, exam details, project or any other assignment details,
final exam result and all these will be available through a secure, online interface embedded in
the colleges site. It will also have faculty details, batch execution details, students details in all
aspects, the various academic notifications to the staff and students updated by the college
administration. It also facilitate us explore all the activities taking place in the college, different
reports and queries are generated based on vast options related to students, batch, course, faculty,
exams, semesters, certification and even for the entire college

SCHEDULING WIRELESS VIRTUAL NETWORKS

FUNCTIONS
Abstract
Network Function Virtualization (NFV) sits firmly on the networking evolutionary path. By
migrating network functions from dedicated devices to general purpose computing platforms,
NFV can help reducing the cost to deploy and operate large IT infrastructures. In particular NFV
is expected to play a pivotal role in mobile networks where significant cost reductions can
obtained by dynamically deploying and scaling Virtual Network Functions (VNFs) in the core
and access segments. However, in order to achieve its full potential, NFV needs to extend its
reach also the radio access network segment. Here Mobile Virtual Network Operators shall be
allowed to request radio access VNFs with custom resource allocation solutions. Such
requirement raises several challenges in terms of performance isolation and resource
provisioning. In this work, we formalize the wireless VNF placement problem as an integer
linear programming problem and we propose a VNF Placement heuristic named WiNE
(Wireless Network Embedding) to solve the problem. Moreover, we also present a proofof
concept implementation of an NFV management and orchestration framework for enterprise
WLANs. The proposed architecture builds upon a programmable network fabric where pure
forwarding nodes are mixed with
radio and packet processing capable nodes.

FAST DETECTION OF TRANSFORMED DATA LEAKS

Abstract
The leak of sensitive data on computer systems poses a serious threat to organizational security.
Statistics show that the lack of proper encryption on files and communications due to human
errors is one of the leading causes of data loss. Organizations need tools to identify the exposure
of sensitive data by screening the content in storage and transmission, i.e., to detect sensitive
information being stored or transmitted in the clear. However, detecting the exposure of sensitive
information is challenging due to data transformation in the content. Transformations (such as
insertion and deletion) result in highly unpredictable leak patterns. In this paper, we utilize
sequence alignment techniques for detecting complex data-leak patterns. Our algorithm is
designed for detecting long and inexact sensitive data patterns. This detection is paired with a
comparable sampling algorithm, which allows one to compare the similarity of two separately
sampled sequences. Our system achieves good detection accuracy in recognizing transformed
leaks. We implement a parallelized version of our algorithms in graphics processing unit that
achieves high analysis throughput. We demonstrate the high multithreading scalability of our
data leak detection method required by a sizable organization.

Main Modules:MODULE DESCRIPTION:

1) Login / Registration:
This is a module mainly designed to provide the authority to a user in
order to access the other modules of the project. Here a user can have the
accessibility authority after the registration.
2) DATA TRANSFER:

This module is mainly designed to transfer data from

distributor to agents. The same module can also be used for
illegal data transfer from authorized to agents to other agents

3) GUILT MODEL ANALYSIS:

This module is designed using the agent guilt model. Here

a count value(also called as fake objects) are incremented for any
transfer of data occurrence when agent transfers data. Fake
objects are stored in database.

4)AGENT-GUILT MODEL:

This module is mainly designed for determining fake agents.

This module uses fake objects (which is stored in database from
guilt model module) and determines the guilt agent along with
the probability. A graph is used to plot the probability distribution
of data which is leaked by fake agents

SECURE AND EFFICIENT DATA COMMUNICATION

PROTOCOL FOR WIRELESS BODY AREA NETWORKS
Abstract
Wireless Body Area Networks (WBANs) are expected to play a major role in the field of patienthealth monitoring in the near future, which gains tremendous attention amongst researchers in
recent years. One of the challenges is to establish a secure
communication architecture between sensors and users, whilst addressing the prevalent security
and privacy concerns. In this paper, we propose a communication architecture for BANs, and
design a scheme to secure the data communications between implanted /wearable sensors and the
data sink/data consumers (doctors or nurse) by employing Ciphertext-Policy Attribute Based
Encryption (CPABE) and signature to store the data in ciphertext format at the data sink, hence
ensuring data security. Our scheme achieves a role-based access control by employing an access
control tree defined by the attributes of the data. We also design two protocols to
securely retrieve the sensitive data from a BAN and instruct the sensors in a BAN. We analyze
the proposed scheme, and argue that it provides message authenticity and collusion resistance,
and is efficient and feasible. We also evaluate its performance in terms of energy consumption
and communication/computation overhead.

ATTRIBUTE-BASED DATA SHARING SCHEME REVISITED IN CLOUD

COMPUTING
Abstract
Cipher text-policy attribute-based encryption (CP-ABE) is a very promising encryption
technique for secure data sharing in the context of cloud computing. Data owner is allowed to
fully control the access policy associated with his data which to be shared. However, CP-ABE is
limited to a potential security risk that is known as key escrow problem, whereby the secret keys
of users have to be issued by a trusted key authority. Besides, most of the existing CP-ABE
schemes cannot support attribute with arbitrary state. In this paper, we revisit attribute-based data
sharing scheme in order to solve the key escrow issue but also improve the expressiveness of
attribute, so that the resulting scheme is more friendly to cloud computing applications. We
propose an improved two-party key issuing protocol that can guarantee that neither key authority
nor cloud service provider can compromise the whole secret key of a user individually.
Moreover, we introduce the concept of attribute with weight, being provided to enhance the
expression of attribute, which can not only extend the expression from binary to arbitrary state,
but also lighten the complexity of access policy. Therefore, both storage cost and encryption
complexity for a cipher text are relieved. The performance analysis and the security proof show
that the proposed scheme is able to achieve efficient and secure data sharing in cloud
computing.

Modules

1. Registration
2. Upload files
3. ABE for Fine-grained Data Access Control
4. Setup and Key Distribution
5. Break-glass
Modules Description

Registration

In this module normal registration for the multiple users. There are multiple owners,
multiple AAs, and multiple users. The attribute hierarchy of files leaf nodes is atomic file
categories while internal nodes are compound categories. Dark boxes are the categories that a
PSDs data reader have access to.
Two ABE systems are involved: for each PSD the revocable KP-ABE scheme is
adopted for each PUD, our proposed revocable MA-ABE scheme.

PUD - public domains

PSD - personal domains

AA - attribute authority

MA-ABE - multi-authority ABE

KP-ABE - key policy ABE

Upload files

In this module, users upload their files with secure key probabilities. The owners upload
ABE-encrypted PHR files to the server. Each owners PHR file encrypted both under a certain
fine grained model.
ABE for Fine-grained Data Access Control

In this module ABE to realize fine-grained access control for outsourced data especially,
there has been an increasing interest in applying ABE to secure electronic healthcare records
(EHRs). An attribute-based infrastructure for EHR systems, where each patients EHR files are
encrypted using a broadcast variant of CP-ABE that allows direct revocation. However, the
cipher text length grows linearly with the number of un revoked users. In a variant of ABE that
allows delegation of access rights is proposed for encrypted EHRs applied cipher text policy
ABE (CP-ABE) to manage the sharing of PHRs, and introduced the concept of
social/professional domains investigated using ABE to generate self-protecting EMRs, which can
either be stored on cloud servers or cell phones so that EMR could be accessed when the health
provider is offline.

Setup and Key Distribution

In this module the system first defines a common universe of data attributes shared by
every PSD, such as basic profile, medical history, allergies, and prescriptions. An
emergency attribute is also defined for break-glass access.
Each PHR owners client application generates its corresponding public/master keys.
The public keys can be published via users profile in an online healthcare social-network (HSN)

There are two ways for distributing secret keys.

First, when first using the PHR service, a PHR owner can specify the access
privilege of a data reader in her PSD, and let her application generate and
distribute corresponding key to the latter, in a way resembling invitations in
GoogleDoc.

Second, a reader in PSD could obtain the secret key by sending a request
(indicating which types of files she wants to access) to the PHR owner via HSN,
and the owner will grant her a subset of requested data types. Based on that, the
policy engine of the application automatically derives an access structure, and
runs keygen of KP-ABE to generate the user secret key that embeds her access
structure.

Break-glass module

In this module when an emergency happens, the regular access policies may no
longer be applicable. To handle this situation, break-glass access is needed to access the victims
PHR. In our framework, each owners PHRs access right is also delegated to an emergency
department ED to prevent from abuse of break-glass option, the emergency staff needs to contact
the ED to verify her identity and the emergency situation, and obtain temporary read keys. After
the emergency is over, the patient can revoke the emergent access via the ED.

MINIMIZING FILE DOWNLOAD TIME IN STOCHASTIC PEER-TO-PEER

NETWORKS
Abstract
The peer to peer(p2p) file-sharing application are becoming increasingly popular and account for
more than 70% of the Internets bandwidth usage. Measurement studies show several hour s
depending on the level of network congestion or the capacity fluctuation. We consider two major
factors that have significant impact on average download time, namely spatial service capability
in different source peer.