scispace - formally typeset
Proceedings ArticleDOI

Application of MultiCast Tree concept to cloud security with optimization algorithm for node search technique

Neelanjana Basu Roy, +1 more
- pp 1-6
Reads0
Chats0
TLDR
This paper attempts to find an optimization algorithm to reduce number of iterations required for a node to be searched in a MultiCast Tee network, and applies this technique in cloud computing, more exactly, cloud information security so that data is safely transferred from one user to another, without any hindrance.
Abstract
This paper attempts to find an optimization algorithm to reduce number of iterations required for a node to be searched in a MultiCast Tee network. After effectively searching the node, it applies this technique in cloud computing, more exactly, cloud information security so that data is safely transferred from one user to another, without any hindrance. The basic idea to incorporate the concept of MultiCast Tree is because it always supports reliable transmission of information, if by any chance, there is a link failure, it does not reduce the availability of resources, nor does it increase any delay in transmission of information, and at the same time minimizes work load. Thus, we can effectively use it in cloud computing, which is nothing but provision of resources to a pool of users through some kind of an interface, for example, Internet. While monitoring the distributed foundation establishment of cloud computing, it becomes extremely important to take into consideration the security of the information provided by users. If we use a vast number of nodes or links, it becomes practically impossible to trace the reliability of transmission, and which might result in important information getting lost. Hence to avoid such a consequence, it becomes necessary to optimize the number of these links, so that it becomes easier to search them in a minimum amount of time. Our main attempt has been to optimize these links and effectively use it in a communication network which has characteristics of a MultiCast Tree incorporated in it. This not only helps in efficient use of cloud computing system, but also ensures users that their data is in safe hands.

read more

Citations
More filters
Proceedings ArticleDOI

Scalable and Adaptive Software Defined Network Management for Cloud-hosted Group Communication Applications

TL;DR: This paper presents an autonomous, dynamic and flexible middleware solution called SDN-based Multicast (SDMC), which provides both network load-aware and switch memory-efficient group communication semantics in DCNs and improves DCN resource utilization while allowing applications to remain agnostic to the underlying group Communication semantics.
References
More filters
Journal ArticleDOI

Cloud computing: state-of-the-art and research challenges

TL;DR: A survey of cloud computing is presented, highlighting its key concepts, architectural principles, state-of-the-art implementation as well as research challenges to provide a better understanding of the design challenges of cloud Computing and identify important research directions in this increasingly important area.
Proceedings ArticleDOI

Achieving Secure, Scalable, and Fine-grained Data Access Control in Cloud Computing

TL;DR: This paper addresses the problem of simultaneously achieving fine-grainedness, scalability, and data confidentiality of access control by exploiting and uniquely combining techniques of attribute-based encryption (ABE), proxy re-encryption, and lazy re- Encryption.
Journal ArticleDOI

Enabling Public Auditability and Data Dynamics for Storage Security in Cloud Computing

TL;DR: To achieve efficient data dynamics, the existing proof of storage models are improved by manipulating the classic Merkle Hash Tree construction for block tag authentication, and an elegant verification scheme is constructed for the seamless integration of these two salient features in the protocol design.
Journal ArticleDOI

ESM: efficient and scalable data center multicast routing

TL;DR: Simulations show that ESM saves 40% ~ 50% network traffic and doubles the application throughputs compared to receiver-driven multicast routing, and the combination routing scheme significantly reduces the number of in-switch entries required.
Proceedings ArticleDOI

An algorithm for multicast tree generation in networks with asymmetric links

S. Ramanathan
TL;DR: A new polynomial-time algorithm is presented that provides for trade-off selection, using a single parameter /spl kappa/, between the tree-cost (Steiner cost) and the runtime efficiency and is shown to give nearly best possible average tree cost while maintaining acceptable runtime efficiency.
Related Papers (5)