A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All
Vijayalakshmi, R.
- Dynamic Load Balancing with Partial Knowledge of System in Peer to Peer Networks
Authors
1 Department of Computer Science & Engineering, S.A. Engineering College, Chennai-600 089, IN
2 Department of Computer Science & Engineering, S.A. Engineering College, Chennai 600 089, IN
Source
Networking and Communication Engineering, Vol 4, No 3 (2012), Pagination: 163-167Abstract
Load balancing is a critical issue for the efficient operation of peer-to- peer networks. The goal of P2P systems is to harness all available resources (storage, bandwidth, and CPU) in the P2P network so that users can access all available objects efficiently.P2P aims to directly balance the distribution of itemsamong the nodes. With the notion of virtual servers, peers participating in a heterogeneous, structured peer-to-peer (P2P) network may host different numbers of virtual servers, and by migrating virtual servers, peers can balance their loads proportional to their capacities. Peers participating in a Distributed Hash Table (DHT) are often heterogeneous. Potential P2P substrates are based on Distributed Hash Tables. The existing and decentralized load balance algorithms designed for the heterogeneous, structured P2P networks either explicitly construct auxiliary networks to manipulate global information or implicitly demand the P2P substrates organized in a hierarchical fashion. Without relying on any auxiliary networks and independent of the geometry of the P2P substrates, we present, in this paper, a novel efficient, proximity-aware load balancing algorithm by using the concept of virtual servers, that is unique in that each participating peer is based on the partial knowledge of the system to estimate the probability distributions of the capacities of peers and the loads of virtual servers, resulting in imperfect knowledge of the system state. With the imperfect system state, peers can compute their expected loads and reallocate their loads in parallel.
Keywords
Peer-to-Peer Systems, Load Balance, Heterogeneity, Decentralized.
- Secure Data Retrieval for Decentralized Disruption-Tolerant Military Networks
Authors
1 Department of MCA, Krishnasamy College of Engineering & Technology, Tamilnadu, IN
Source
Networking and Communication Engineering, Vol 10, No 4 (2018), Pagination: 92-95Abstract
In worldwide environment to transfer the data in secure fashion everything is rely on another source to transfer the data to corresponding receiver without any data loss during transmission. [9] In military areas like battlefield or an unfriendly region are likely to undergo from improper network connectivity and often partitions. A method is implemented to provide successful communication between source and destination as well as access the confidential information provided by some major authorities like commander or other superiors. The method is said to be Disruption-Tolerant Network (DTN). The [4] DTN system provides a well-planned outline for authenticating the user’s policies and those policies to retrieve the secure data in most challenging cases. The cryptographic solution is introduced to control the unauthorized access issues called Ciphertext Policy Attribute Based Encryption (CP-ABE) [1]. On the other hand, Disruption-tolerant networks introduce lot of security and privacy challenge with regard to the attribute digital certificate, key exchange, and collaboration of attributes issued from various authorities. The DTN is used to authorize the nodes and DTN registers the node details to key Authority. The key Authority generates private Key and the route to transfer packet to destination. Secret key is also automatically changed when the node joins a network and leaves a network by which the level of security is increased.