Earticle

The current BDII model relies on information gathering from agents that run on each core node of a Grid. This information is then published into a Grid wide information resource known as Top BDII. The Top level BDIIs are updated typically in cycles of a few minutes each. A new BDDI architecture is proposed and described in this paper based on the hypothesis that only a few attribute values change in each BDDI information cycle and consequently it may not be necessary to update each parameter in a cycle. It has been demonstrated that significant performance gains can be achieved by exchanging only the information about records that changed during a cycle. Our investigations have led us to implement a low latency and fault tolerant BDII system that involves only minimal data transfer and facilitates secure transactions in a Grid environment.

Grid computing is a form of distributed computing involves coordinating and sharing computing, application, data storage or network resources across dynamic and geographically dispersed organization. One of the scheduling techniques in Grid Computing is Tabu Search algorithm. A good scheduling algorithm is normally shows lower value of total tardiness and schedule time. The implementation Tabu Search algorithm was tested and evaluated on universal datasets using GridSim tool. The results indicate performance of tardiness is directly related to number of machines up to certain number of resources. Small and medium company can use grid in operation process because it saves cost and times.

In a wireless network, an user has the possibility of remaining link while moving in a more or less spread geographical perimeter, it is the reason for which they intend to sometimes speak about "mobility". The wireless Grid represent a new type of network of distribution of means linking up mobile phones and other implements of edge some with the others with different access points. In this article, we offer a service allowing to manage the consistency of the replicas of data in such environment where the users can move at any time. Offered service combines between optimistic and pessimistic approaches. We go shown with the aid of several results of experimentation which our proposal allows to reduce in a remarkable manner the number of divergences and conflicts between replicas of the same data in environment Wireless Grid.

Grid Computing is mainly concerned with coordinated way of sharing diverse resources that are available in distributed “Virtual Organizations”. A prominent feature of grid computing is the collaboration of multiple entities to perform collaborative tasks that rely on two important functions such as communication and resource sharing. Since the grid collaboration happens by means of the Internet and since the Internet is not security – oriented by design, there is a possibility of many attacks, in particular malicious internal and external users or hackers. This paper proposes a simple and yet an efficient key computation and management protocols in dynamic Grid Environment based on Euclidian Algorithm (EAB).

Genetic Algorithm with Multiobjective formulations are realistic models for many complex engineering optimization problems such as QoS routing protocol for mobile ad hoc network. The paper presents QoS routing protocol for MANET with specialized encoding, initialization, crossovers, mutations, fitness selections and route search using genetic algorithm with multiple objectives. The aim is to find the best QoS route in order to optimize the design of MANET routing protocols. This NP-hard problem is often highly constrained such that random initialization and standard genetic operators usually generate infeasible networks. The performances of the protocol was done to indicate the feasible of the proposed multiobjectives formulation.

The telecommunication world is evolving towards networks and different services. It is necessary to ensure interoperability between different networks to provide seamless and on-demand services. As the number of services and users in Internet Protocol Multimedia Subsystem (IMS) keeps increasing, network virtualization and cloud computing technologies seem to be a good alternative for Mobile Virtual Network Operators (MVNOs) in order to provide better services to customers and save cost and time. Cloud computing known as an IT environment that includes all elements of the IT and network stack, enabling the development, delivery, and consumption of Cloud Services. In this paper, we will present the challenges and issues of these emerging technologies. The first part of this paper describes Cloud computing as the networks of the future. It presents an overview of some works in this area. Some concepts like cloud services and Service oriented Architecture designed to facilitate rapid prototyping and deployment of on demand services that enhance flexibility, communication performance, robustness, and scalability are detailed. The second part exposes SOA and its concept, the third one deals with virtualization.

Transmission errors are inherent in wireless communications because of the instability of wireless channels resulting due to channel fading, time - frequency coherence, inter-band interference, etc, and thus receiving unreliable message packet. This necessitates the retransmission of packet which further results into extra processing and increased energy consumption of the sensor nodes. In this paper, we propose a new approach of an energy - efficient transmission error recovery algorithm for wireless sensor networks. In the proposed methodology, the data packet is divided into small sub - packets and retransmission is done for only corrupted portion of the sub - packets. The algorithm also helps in determining optimum size of the sub-packet. These results into minimum battery power requirement for the sensor nodes and increased lifespan of the sensor network. The results show that more than 30% of the power savings can be achieved by implementing proposed system as compared to conventional retransmission of complete packet.