WO2009002140A2 - A continuous multi - agent convergence process through peering update in a grid resource monitoring system - Google Patents

A continuous multi - agent convergence process through peering update in a grid resource monitoring system Download PDF

Info

Publication number
WO2009002140A2
WO2009002140A2 PCT/MY2008/000060 MY2008000060W WO2009002140A2 WO 2009002140 A2 WO2009002140 A2 WO 2009002140A2 MY 2008000060 W MY2008000060 W MY 2008000060W WO 2009002140 A2 WO2009002140 A2 WO 2009002140A2
Authority
WO
WIPO (PCT)
Prior art keywords
agent
node
grid
record
peering
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Ceased
Application number
PCT/MY2008/000060
Other languages
French (fr)
Other versions
WO2009002140A3 (en
Inventor
Wai Keat Ng
Sock Yin Tai
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Mimos Bhd
Original Assignee
Mimos Bhd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Mimos Bhd filed Critical Mimos Bhd
Publication of WO2009002140A2 publication Critical patent/WO2009002140A2/en
Publication of WO2009002140A3 publication Critical patent/WO2009002140A3/en
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/50—Network service management, e.g. ensuring proper service fulfilment according to agreements
    • H04L41/5003—Managing SLA; Interaction between SLA and QoS
    • H04L41/5009—Determining service level performance parameters or violations of service level contracts, e.g. violations of agreed response time or mean time between failures [MTBF]
    • H04L41/5012—Determining service level performance parameters or violations of service level contracts, e.g. violations of agreed response time or mean time between failures [MTBF] determining service availability, e.g. which services are available at a certain point in time
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00—Error detection; Error correction; Monitoring
    • G06F11/30—Monitoring
    • G06F11/34—Recording or statistical evaluation of computer activity, e.g. of down time, of input/output operation ; Recording or statistical evaluation of user activity, e.g. usability assessment
    • G06F11/3404—Recording or statistical evaluation of computer activity, e.g. of down time, of input/output operation ; Recording or statistical evaluation of user activity, e.g. usability assessment for parallel or distributed programming
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/04—Network management architectures or arrangements
    • H04L41/046—Network management architectures or arrangements comprising network management agents or mobile agents therefor

Definitions

  • Each node keeps a record, R, to record its neighboring nodes' status, S, such loads, bottleneck bandwidth, CPU and memory utilization.
  • R to record its neighboring nodes' status, S, such loads, bottleneck bandwidth, CPU and memory utilization.
  • This record will be updated by any agent that carries the latest tine, t and shortest path, P..
  • R will also provide a historical record as predicted measure, if the convergence takes longer time to achieve.
  • the administrator who understands the topology of the grid computing system determines the amount of agents to be released.
  • Each agent will travel to its designated node and response to the seeding node once it reaches its destination. In occurrence of loss agent, sufficient agents will be released to make sure each node has an agent.
  • Floating agents are released randomly through a specific node.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • General Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Computer Hardware Design (AREA)
  • Quality & Reliability (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Debugging And Monitoring (AREA)

Abstract

The present invention relates to a continuous multi agent convergence process through peering update for grid resource monitoring characterized in that wherein the process that is utilized by using a continuous multi agent convergence through peering update wherein said process is designed to allow more efficient monitoring of current and recent status across grid sites by using multiple agents to keep track and consolidate information of the adjacent nodes and wherein said process uses a random updating process that is triggered by arrival of agent, rather than bases on predefined threshold and periodic invocation to accommodate the frequent changes of nodes information in grid environment.

Description

A CONTINUOUS MULTI - AGENT CONVERGENCE PROCESS THROUGH PEERING UPDATE IN A GRID RESOURCE MONITORING SYSTEM
FmLD OF THE INVENTION
The present invention relates to a continuous multi agent convergence process through peering update in a grid resource monitoring system.
BACKGROUND OF THE INVENTION
Grid computing is a collection of distributed systems that involves heterogeneous computing platform across different geographical boundaries. This computing environment requires up - to - date information among the grid nodes to ensure the availability and efficiency of the system to deliver its optimum resource monitoring result. Keeping the latest information of each grid node has been a great challenge due to its dynamic nature and continuous extension. Despite having more alternatives, the availability of different grid technologies such as Globus, Legion, Unicore and etc, has also increase the complexity.
The problem with the current technology is that monitoring resources in grid environment often takes presumption of the status and the optimization level based on the most recent information. However, due to the nature of the grid computing platform, acquiring the latest information on the status of each resource may be procrastinated by various delaying factors such as network bandwidth, resource over subscription and etc.
As a result of the delayed information, job may be submitted to grid nodes with large amount job queuing while resources which are recently completed all the jobs will be left idle. Thus, optimizing the utilization of resources with the job submission loads would be a major hurdle to overcome. Moreover, the scalability and adaptability of the grid would also be relentlessly affected due to this varying condition. Therefore, it is an objective of the present invention to overcome or reduce the above-mentioned problems by introducing a continuous multi - agent convergence process through peering update in a grid resource monitoring system.
SUMMARY QF THE INVENTION
The present invention relates to a continuous multi agent convergence process through peering update for grid resource monitoring characterized in that wherein the process that is utilized by using a continuous multi agent convergence through peering update wherein said process is designed to allow more efficient monitoring of current and recent status across grid sites by using multiple agents to keep track and consolidate information of the adjacent nodes and wherein said process uses a random updating process that is triggered by arrival of agent, rather than bases on predefined threshold and periodic invocation to accommodate the frequent changes of nodes information in grid environment.
BRIEF DESCRIPTION OF THE FIGURES
Figure 1 shows a flow chart of a disperse nodes in a grid environment
Figure 2 shows a flow diagram of the process according to the present invention
DETAILED DESCRIPTION OF THE PRESENT INVENTION
The present invention would be described with reference made to the accompanied figures but limited thereto therein.
According to the present invention, the technique that would be utilized herein would address the earlier mentioned disadvantages by using a continuous multi agent convergence through peering update. This process would allow more efficient monitoring of current and recent status across grid sites by using multiple agents to keep track and consolidate information of the adjacent nodes. In addition, this technique uses a random updating process that is triggered by arrival of agent, rather than bases on predefined threshold and periodic invocation to accommodate the frequent changes of nodes information in grid environment.
The steps according to the present invention comprises of:-
1. A node disperses a predefined number of agents, A, to its adjacent nodes, N, in the grid environment. An agent, aj, will reside at a node, n* that it traverses if there is no existing agent reporting.
2. Each node keeps a record, R, to record its neighboring nodes' status, S, such loads, bottleneck bandwidth, CPU and memory utilization. This record will be updated by any agent that carries the latest tine, t and shortest path, P..
3. Agent that resides at each node will continue to traverse across the nearest path to the node's neighbors with the latest information of the resided node. For example, agents at n2 travel to n3, n4 and ns. As n5 has a nearer path to ni, information in R will be updated according to agent traversing from τi\.
4. As agent travel back by passing through other nodes, the information of other nodes will be updated together before reaching the agent's source, for example Dt1.
5. R will provide the information to facilitate agent for routing submitted job from overloaded local queue to neighboring under utilized resources.
6. R will also provide a historical record as predicted measure, if the convergence takes longer time to achieve.
Record, R is information kept in each node. It consists of list of statuses, S such as loads, bottleneck bandwidth, CPU and memory utilization, disk utilization and queue availability. The updating of the record, R will be carried out by agent with the latest time, t and shortest path, P. Once the convergence is achieved, record, R of each node will be able to have status, S of its neighboring nodes.
Reference is made now to Figure 2 wherein a detail process according to the present invention which reference to Figure 1 comprises the steps of:-
1. During the initiation of the Grid Resource Monitoring system, the administrator who understands the topology of the grid computing system determines the amount of agents to be released.
2. A seeding node is determined randomly based on the topology of the Grid deployment.
3. The number of nodes in the Grid deployment is computed and the agents are released into the Grid through the seeding node.
4. Each agent will travel to its designated node and response to the seeding node once it reaches its destination. In occurrence of loss agent, sufficient agents will be released to make sure each node has an agent.
5. Floating agents are released randomly through a specific node.
6. When a floating agent, aj reaches a node that does not have a residing agent, it will reside at the current node.
7. If there is already a residing agent, 02 at a node, the floating node, c/ will take the place of the residing agent.
8. Before leaving the current node, the residing agent, «2 computes the distance of all the neighboring nodes and identifies the nearest node as the next destination. 9. The residing agent, a∑ travel to the next designated node together with the information (status, S) gathered during dwelling in the previous node. The residing agent, 02 turns into a floating agent until it reaches the targeted node.
10. Once the floating agent, a.2 reaches the targeted node, step 6-9 repeats. In addition, the floating agent, 02 updates the record, R of the targeted node with status, S of the previous node.
11. When the state of convergence is achieved, record, R in each of the node in Grid will have the status, S of each of its neighboring node.
12. Record, R can be consolidated in historical manner to serve as prediction measure for Grid meta-scheduler or to facilitate rerouting of job at overloaded local queue to other under-utilized resources.

Claims

1. A continuous multi agent convergence process through peering update for grid resource monitoring characterized in that wherein the process that is utilized by using a continuous multi agent convergence through peering update wherein said process is designed to allow more efficient monitoring of current and recent status across grid sites by using multiple agents to keep track and consolidate information of the adjacent nodes and wherein said process uses a random updating process that is triggered by arrival of agent, rather than bases on predefined threshold and periodic invocation to accommodate the frequent changes of nodes information in grid environment.
2. A method of monitoring peering update in a grid resource monitoring system as claimed in Claim 1 characterized in that wherein the method comprises of a continuous multi agent process through peering update and wherein the method comprises of:-
(a) A node disperses a predefined number of agents, A, to its adjacent nodes, N, in the grid environment and wherein an agent, ai, will reside at a node, n, that it traverses if there is no existing agent reporting.
(b) Each node keeps a record, R, to record its neighboring nodes' status, S, such as loads, bottleneck bandwidth, CPU and memory utilization. This record will be updated by any agent that carries the latest tine, t and shortest path, P.
(c) Agent that resides at each node will continue to traverse across the nearest path to the node's neighbors with the latest information of the resided node. (d) As agent travel back by passing through other nodes, the information of other nodes will be updated together before reaching the agent's source, for example B1.
(e) R will provide the information to facilitate agent for routing submitted job from overloaded local queue to neighboring under utilized resources.
(f) R will also provide a historical record as predicted measure, if the convergence takes longer time to achieve.
3. A method as claimed in Claim 1 wherein the method further comprises of:
a. During the initiation of the Grid Resource Monitoring system, an administrator who understands the topology of the grid computing system determines the amount of agents to be released.
b. A seeding node is determined randomly based on the topology of the Grid deployment.
c. The number of nodes in the Grid deployment is computed and the agents are released into the Grid through the seeding node.
d. Each agent will travel to its designated node and response to the seeding node once it reaches its destination. In occurrence of loss agent, sufficient agents will be released to make sure each node has an agent.
e. Floating agents are released randomly through a specific node.
f. When a floating agent, α/ reaches a node that does not have a residing agent, it will reside at the current node. g. If there is already a residing agent, at at a node, the floating node, aj will take the place of the residing agent.
h. Before leaving the current node, the residing agent, at computes the distance of all the neighboring nodes and identifies the nearest node as the next destination.
i. The residing agent, at travel to the next designated node together with the information (status, S) gathered during dwelling in the previous node. The residing agent, at turns into a floating agent until it reaches the targeted node.
j. Once the floating agent, at reaches the targeted node, step 6-9 repeats. Ia addition, the floating agent, a∑ updates the record, R of the targeted node with status, S of the previous node.
k. When the state of convergence is achieved, record, R in each of the node in Grid will have the status, S of each of its neighboring node.
1. Record, R can be consolidated in historical manner to serve as prediction measure for Grid meta-scheduler or to facilitate rerouting of job at overloaded local queue to other under-utilized resources.
4. A continuous multi agent convergence process through peering update for grid resource monitoring as claimed in any of the preceding claims wherein the
Record, R is information kept in each node and wherein it consists of list of statuses, S such as loads, bottleneck bandwidth, CPU and memory utilization, disk utilization and queue availability.
5. A continuous multi agent convergence process through peering update for grid resource monitoring as claimed in any of the preceding claims wherein the updating of the record, R will be carried out by agent with the latest time, t and shortest path, P.
6. A continuous multi agent convergence process through peering update for grid resource monitoring as claimed in any of the preceding claims wherein the once the convergence is achieved, record, R of each node will be able to have status,
*
S of its neighboring nodes.
PCT/MY2008/000060 2007-06-26 2008-06-26 A continuous multi - agent convergence process through peering update in a grid resource monitoring system Ceased WO2009002140A2 (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
MYPI20071009 MY150908A (en) 2007-06-26 2007-06-26 A continuous multi-agent convergence process through peering update in a grid resource monitoring system
MY20071009 2007-06-26

Publications (2)

Publication Number Publication Date
WO2009002140A2 true WO2009002140A2 (en) 2008-12-31
WO2009002140A3 WO2009002140A3 (en) 2009-03-26

Family

ID=40186184

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/MY2008/000060 Ceased WO2009002140A2 (en) 2007-06-26 2008-06-26 A continuous multi - agent convergence process through peering update in a grid resource monitoring system

Country Status (2)

Country Link
MY (1) MY150908A (en)
WO (1) WO2009002140A2 (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101964545A (en) * 2010-10-19 2011-02-02 天津理工大学 Self-adaptive intelligent coordination protection and control system for power grids based on WANs (Wide Area Network) and multiple agents
CN105262070A (en) * 2015-09-29 2016-01-20 中国人民解放军海军工程大学 Ship AC power distribution network selectivity protection method based on multi-Agent system

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7584274B2 (en) * 2004-06-15 2009-09-01 International Business Machines Corporation Coordinating use of independent external resources within requesting grid environments

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101964545A (en) * 2010-10-19 2011-02-02 天津理工大学 Self-adaptive intelligent coordination protection and control system for power grids based on WANs (Wide Area Network) and multiple agents
CN105262070A (en) * 2015-09-29 2016-01-20 中国人民解放军海军工程大学 Ship AC power distribution network selectivity protection method based on multi-Agent system
CN105262070B (en) * 2015-09-29 2017-11-17 中国人民解放军海军工程大学 Ship AC distribution net selective protection method based on Agent system

Also Published As

Publication number Publication date
WO2009002140A3 (en) 2009-03-26
MY150908A (en) 2014-03-14

Similar Documents

Publication Publication Date Title
Wang et al. An efficient route management framework for load balance and overhead reduction in SDN-based data center networks
US7457257B2 (en) Apparatus, system, and method for reliable, fast, and scalable multicast message delivery in service overlay networks
US8773992B2 (en) Methods and apparatus for hierarchical routing in communication networks
EP0540151B1 (en) Method of operating a computer in a network
Thompson et al. Retiring replicants: Congestion control for intermittently-connected networks
US20120155264A1 (en) Dynamic Balancing Priority Queue Assignments for Quality-of-Service Network Flows
US20040205219A1 (en) Virtual active network for live streaming media
CN108306971A (en) A kind of method and system of the acquisition request of transmission data resource
EP1034641B1 (en) A routing functionality application in a data communications network with a number of hierarchical nodes
WO2011117570A1 (en) Network routing adaptation based on failure prediction
WO2012085498A1 (en) Communications network management
CN101610433A (en) A multi-constraint routing selection method supporting policy resolution
CN102088402A (en) Novel bandwidth management algorithm
CN105141617A (en) Deploying and adjusting method for service functions among data centers and deploying and adjusting device for service functions among data centers
CN119676150B (en) A Topology-Aware Dynamic Microservice Migration and Route Redirection Method and System
CN1409526A (en) Intelligent routing for effectively using network signal resource
Oida et al. An agent-based routing system for QoS guarantees
Chen et al. Scalable request routing with next-neighbor load sharing in multi-server environments
Alshathri et al. Latency-aware dynamic second offloading service in SDN-based fog architecture
WO2009002140A2 (en) A continuous multi - agent convergence process through peering update in a grid resource monitoring system
KR101758326B1 (en) Method of load balancing in network
Biswas et al. Efficient switch migration for controller load balancing in software defined networking
CN113596109A (en) Service request operation method, system, device, equipment and storage medium
CN101193053B (en) A multi-gateway route selection method based on central management
CN113162863A (en) Fair multipath routing strategy based on wheel disc algorithm

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 08766698

Country of ref document: EP

Kind code of ref document: A2

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 08766698

Country of ref document: EP

Kind code of ref document: A2