Survey – New Routing Technique for Grid Computing
R.RAMESHKUMAR,Research Schlolar,J.N.T.University,Kukatpally,Hyderabad.rramesh1968@gmail.com
Dr. A.DAMODARAMDirector/ U.G.C Academic Staff College,,J.N.T.University,Kukatpally,Hyderabad.
adamodaram@jntuap.ac.in
Abstract-
Trust plays an indispensable role in gridcomputing. Trust-management systems provide applicationswith a standard interface for getting answers to suchquestions and provide users with a standard language for writing the policies and credentials that control what isallowed and what isn’t. Using a trust-management systemfor controlling security-critical services frees the applicationdeveloper from a number of often difficult design andimplementation issues and allows users to take advantage of a flexible, standard, application-independent language for specifying policy. In this paper, we develop trustmanagement architecture for trust enhanced Grid securityincorporating a novel trust model which is capable of capturing various types of trust relationships that exist in aGrid system and providing mechanisms for trust evaluation,recommendations and update for trust decisions. Theoutcomes of the trust decisions can then be employed by theGrid security system to formulate trust enhanced securitysolutions. Here we put forth ant algorithm for implementation. The ant colony algorithm is an algorithmfor finding optimal paths that is based on the behavior of ants searching for food. At first, the ants wander randomly.When an ant finds a source of food, it walks back to thecolony leaving "markers" (pheromones) that show the pathhas food. When other ants come across the markers, they arelikely to follow the path with a certain probability. If theydo, they then populate the path with their own markers asthey bring the food back. As more ants find the path, itgets stronger until there are a couple streams of antstraveling to various food sources near the colony.
Key words
- Grid computing, security, trust, Ant Colony,Service Request.
I. INTRODUCTION
Routers use routing algorithms to find the bestroute to a destination. When we say "best route," weconsider parameters like the number of hops (the trip a packet takes from one router or intermediate point toanother in the network), time delay and communication costof packet transmission. Based on how routers gather information about the structure of a network and their analysis of information to specify the best route, we havetwo major routing algorithms: global routing algorithms anddecentralized routing algorithms. In decentralized routingalgorithms, each router has information about the routers itis directly connected to -- it doesn't know about every router in the network. These algorithms are also known as DV(distance vector) algorithms. In global routing algorithms,every router has complete information about all other routers in the network and the traffic status of the network.These algorithms are also known as
LS
(link state)algorithms.
•
Routing Components
Routing involves two basic activities: determiningthe optimal routing paths for destination networks and
(IJCSIS) International Journal of Computer Science and Information Security,Vol. 8, No. 3, June 2010204http://sites.google.com/site/ijcsis/ISSN 1947-5500
transporting information groups, also known as packets,through an internetwork. Within the context of routing, thelatter can be referred to as switching.
•
Path Determination
A metric is a standard of measurement, such as path length, that is used by routing algorithms to determinethe optimal path to a destination. To aid in this process of path determination, routing algorithms initialize andmaintain routing tables, which contain route information.This information can vary widely depending on whichrouting algorithm generated the routes. Routing algorithmsfill routing tables with a list of networks and itscorresponding "next hop" on the way its destination. Whena router receives an incoming packet, it checks thedestination address and attempts to associate this addresswith a next hop.
Algorithm Types
•
Static versus dynamic
•
Single-path versus multi-path
•
Link state versus distance vector
•
Dynamic vs. Static
Static routing algorithms are hardly algorithms atall, but are table mappings established by the network administrator prior to the beginning of routing. Thesemappings do not change unless the network administrator alters them. Algorithms that use static routes are simple todesign and work well in environments where network trafficis relatively predictable and where network design isrelatively simple.Because static routing systems cannot react tonetwork changes, they generally are considered unsuitablefor today's large, changing networks. Most of the dominantrouting algorithms in the 1990s are dynamic routingalgorithms, which adjust to changing network circumstances by analyzing incoming routing update messages. If themessage indicates that a network change has occurred, therouting software recalculates routes and sends out newrouting update messages. These messages permeate thenetwork, stimulating routers to rerun their algorithms andchange their routing tables accordingly.Dynamic routing algorithms can be supplemented withstatic routes where appropriate. A router of last resort (arouter to which all unroutable packets are sent), for example, can be designated to act as a repository for allunroutable packets, ensuring that all messages are at leasthandled in some way.
•
Single-Path vs. Multipath
Some sophisticated routing protocols supportmultiple paths to the same destination. Unlike single-pathalgorithms, these multipath algorithms permit trafficmultiplexing over multiple lines. The advantages of multipath algorithms are obvious: They can providesubstantially better throughput and reliability.
•
Link State vs. Distance Vector
Link-state algorithms (also known as shortest pathfirst
algorithms) flood routing information to all nodes inthe internetwork. Each router, however, sends only the portion of the routing table that describes the state of its ownlinks. Distance- vector algorithms (also known as Bellman-Ford algorithms) call for each router to send all or some portion of its routing table, but only to its neighbors. Inessence, link- state algorithms send small updateseverywhere, while distance- vector algorithms send larger updates only to neighboring routers.Because they converge more quickly, link- statealgorithms are somewhat less prone to routing loops thandistance- vector algorithms. On the other hand, link- statealgorithms require more CPU power and memory thandistance- vector algorithms. Link-state algorithms,therefore, can be more expensive to implement and support.Despite their differences, both algorithm types perform wellin most circumstances.
(IJCSIS) International Journal of Computer Science and Information Security,Vol. 8, No. 3, June 2010205http://sites.google.com/site/ijcsis/ISSN 1947-5500
Trust Management Architecture
Using a trust-management system for controllingsecurity-critical services frees the application developer from a number of often difficult (and subtle) design andimplementation issues and allows users to take advantage of a flexible, standard, application-independent language for specifying policy. Before trust management, everyapplication had to provide its own mechanisms for specifying policy, interpreting credentials, and binding user authentication with the authorization to perform"dangerous" operations. Trust-management systems, on theother hand, provide a simple interface that takes care of allof these things. All the application designer has to do isidentify the trust management questions in the applicationand formulate appropriate queries to the trust-managementsystem.Fig. 1. Keynote trust Management Architecture
II.
I
MPACT OF ANT ALGORITHM ON GRID COMPUTING
Grid computing
is a term used to describe both a platform and type of application. A
Grid computing platformdynamically provisions, configures, reconfigures, and de provisions servers as needed. Servers in the Grid can be physical machines or virtual machines. The grid computingenvironment typically include other computing resourcessuch as storage area networks (SANs), network equipment,firewall and other security devices. Grid computing alsodescribes applications that are extended to be accessiblethrough the Internet. These Grid applications
use large datacenters and powerful servers that host Web applications andWeb services. Anyone with a suitable Internet connection anda standard browser can access a cloud application. The primary components of Grid architecture are:
•
Users/Brokers:
Users or brokers acting on their behalf submit service requests from anywhere inthe world to the Data Center and Grid Servers to be processed.
•
SLA (Service Level Agreements) ResourceAllocator:
The SLA
Resource Allocator acts as theinterface between the Data Center/Grid service provider and external users/brokers. It requires theinteraction of the defined scheduled mechanisms tosupport SLA-oriented resource management.To access the grid resources and execution, it can be divided in to three phases like resource recovery,scheduling, and executing. In the second phase find the bestmatch between the set of jobs and available resources. Thesecond phase is a NP-hard Problem [6]. The computationalgrid is a dynamic and unpredictable behavior. They are:
•
Computational performance of each resource variesfrom time to time.
•
The connection between computers and mobile phones may be unreliable.
•
The resources may join or give up the grid at anytime
•
The resource may be occupied without anotification.The scheduling of grid architecture is dynamic innature and moreover Grid middleware and applications areusing local scheduling and data co-scheduling. The approachof replication has been also applied and assisted inscheduling and optimization of replication. There aredifferent existing algorithms like the Genetic algorithm (GA)is used for searching large solution space. On other hand,
(IJCSIS) International Journal of Computer Science and Information Security,Vol. 8, No. 3, June 2010206http://sites.google.com/site/ijcsis/ISSN 1947-5500
Search History:
Result 00 of 00
00 results for result for
p.
Survey – New Routing Technique for Grid Computing
Trust plays an indispensable role in grid computing. Trust-management systems provide applications with a standard interface for getting answers to such questions and provide users with a standard language for writing the policies and credentials that…
(More)
848
Reads
6
Readcasts
5
Embed Views
More From This User
Notes
Load more
