A STOCHASTIC MODEL TO IMPROVING PERFORMANCE AND QOS IN IAAS CLOUD SYSTEMS

S.Pavithra, K.Savima

¹PG Student STET Women’s college, mannargudi.

²Professor of IT department, STET Women’s college, mannargudi.

Cloud data center management is a key problem due to the numerous and heterogeneous strategies that can be applied, ranging from the VM placement to the federation with other clouds. Performance evaluation of Cloud Computing infrastructures is required to predict and quantify the cost-benefit of a strategy portfolio and the corresponding Quality of Service (QoS) experienced by users. Such analyses are not feasible by simulation or on-the-field experimentation, due to the great number of parameters that have to be investigated. In this paper, we present an analytical model, based on Stochastic Reward Nets (SRNs), that is both scalable to model systems composed of thousands of resources and flexible to represent different policies and cloud-specific strategies. Several performance metrics are defined and evaluated to analyze the behavior of a Cloud data center: utilization, availability, waiting time, and responsiveness. A resiliency analysis is also provided to take into account load bursts. Finally, a general approach is presented that, starting from the concept of system capacity, can help system managers to opportunely set the data center parameters under different working conditions. Cloud data center management is a key problem due to the numerous and heterogeneous strategies that can be applied, ranging from the VM placement to the federation with other clouds. Performance evaluation of Cloud Computing infrastructures is required to predict and quantify the cost-benefit of a strategy portfolio and the corresponding Quality of Service (QoS) experienced by users. Analyses are not feasible by simulation or on-the-field experimentation, due to the great number of parameters that have to be investigated. An analytical model, based on Stochastic Reward Nets (SRNs), that is both scalable to model systems composed of thousands of resources and flexible to represent different policies and cloud-specific strategies. Several performance metrics are defined and evaluated to analyze the behavior of a Cloud data center: utilization, availability, waiting time, and responsiveness. A resiliency analysis is also provided to take into account load bursts.  A general approach is presented that, starting from the concept of system capacity to help system managers opportunely set the data center parameters under different working conditions.

View full abstract...

SECURING SERVER BROKER LESS PUBLISH/SUBSCRIBE USING ID BASED ENCRYPTION

E.Deepika,V.Geetha

¹PG Student STET Women’s college, mannargudi

²Professor of CS department, STET Women’s college, mannargudi

The publish/subscribe (pub/sub) communication paradigm has gained high popularity because of its inherent decoupling of publishers from subscribers inters of time, space, and synchronization. Publishers inject information into the pub/sub system, and subscribers specify the events of interest by means of subscriptions. Authentication of publishers and subscribers is difficult to achieve due to the loose coupling of publishers and subscribers. Likewise, confidentiality of events and subscriptions conflicts with content-based routing. This paper presents a novel approach to provide confidentiality and authentication in a broker-less content-based publish/subscribe system. The authentication of publishers and subscribers as well as confidentiality of events is ensured, by adapting the pairing-based cryptography mechanisms, to the needs of a publish/subscribe system. Furthermore, an algorithm to cluster subscribers according to their subscriptions preserves a weak notion of subscription confidentiality. In addition to our previous work this paper contributes use of searchable encryption to enable efficient routing of encrypted events, multi credential routing a new event dissemination strategy to strengthen the weak subscription confidentiality, and  thorough analysis of different attacks on subscription confidentiality. The overall approach provides fine-grained key management and the cost for encryption, decryption, and routing is in the order of subscribed attributes. Moreover, the evaluations show that providing security is affordable throughput of the proposed cryptographic primitives, and  delays incurred during the construction of the publish/subscribe overlay and the event dissemination.

View full abstract...

A STUDY ON RELIABLE SERVICE THAT ENABLING SECURING SERVICE ORIENTED MOBILE SOCIAL NETWORK

P.Abirami, R.BhuvanaPriya

¹PG Student STET Women’s college, mannargudi

²Professor of CS department, STET Women’s college, mannargudi

A Trustworthy Service Evaluation (TSE) system to enable users to share service reviews in service-oriented mobile social networks (S-MSNs). Each service provider independently maintains a TSE for itself, which collects and stores users’ reviews about its services without requiring any third trusted authority. The service reviews can then be made available to interested users in making wise service selection decisions. Identify three unique service review attacks, i.e., link ability, rejection, and modification attacks, and develop sophisticated security mechanisms for the TSE to deal with these attacks.  The basic TSE (bTSE) enables users to distributed and cooperatively submit their reviews in an integrated chain form by using hierarchical and aggregate signature techniques. It restricts the service providers to reject, modify, or delete the reviews. Thus, the integrity and authenticity of reviews are improved. Further, extend the bTSE to a Sybil-resisted TSE (SrTSE) to enable the detection of two typical Sybil attacks.In the SrTSE, if a user generates multiple reviews toward a vendor in a predefined time slot with different pseudonyms, the real identity of that user will be revealed. Through security Analysis and numerical results, that the bTSE and the SrTSE effectively resist the Service review attacks and the SrTSE additionally detect the Sybil attacks in an efficient manner. Through performance evaluation, the bTSE achieves better performance in terms of submission rate and delay than a service review system that does not adopt user cooperation

View full abstract...

TRAFFIC SPLITTING IN MULTIPATH WIRELESS NETWORK

Ms.E.Pandiyammal¹, Mr.P.N.Karthikayan²

¹PG student- Department of CSE - Vellammal college of Engineering and technology, Madurai, Tamilnadu, India.

²Assistant Professor - Department of CSE- Vellammal college of Engineering and technology, Madurai, Tamilnadu, India.

In network, multiple paths are existing between source and destination. Source splits the traffic among its entire available path. But how we achieve the lowest transmission rate per unit time is a problem here. If any traffic terminus between two nodes then consumes the reverse path for packet transmission. This type of packet transmission method is called as “REVERSE CARPOOLING”. And also the reverse path is called as “HYPERLINKS”. In reverse carpooling technique, use the longer paths at lowest cost by conveying a hyperlink capacity to each node. Conversely there is a strange situation among sources (i.e.) if there is traffic in both directions of a shared path, deliberate as a problem of routing with network coding. By conveying a hyperlink capacity, permitting sources to split their traffic selfishly in a scattered fashion, and then altering the hyperlink capacity based on user actions. Additionally, each hyperlink has a scheduling restriction in terms of the maximum number of transmissions allowed per unit time.

 

View full abstract...