Font Size: a A A

Research On Multi-Agent System For The QoS Multi-Multicast Routing

Posted on:2011-11-22Degree:MasterType:Thesis
Country:ChinaCandidate:F ZhuFull Text:PDF
GTID:2178360305970158Subject:Pattern Recognition and Intelligent Systems
Abstract/Summary:PDF Full Text Request
The development of internet has given rise to many new communication services such as video broadcasting, multimedia conference, and remote education; Uncertain network performance parameters of the multi-constrained QoS multicast routing optimization has become a secure multicast is an important research area, but also the next generation of Internet and high-performance networking problems demanding prompt solution. In this article. The multicast with single-source and multi-purpose is called multicast.and multi-source and multi-purpose will be called Multi-multicast, The multiple-multicast routing problem can be formulated as finding a minimal-cost routes set from many sources to many destinations and satisfied with bandwidth and delay constraints in a given networks. This is a more complex problem than the problem from one source to multiple destinations. It is a typical NP-hard problem.This paper studies the multi-agent systems applied to many multicast routing problem. Approach from the agent point of view. Nodes in the network as an agent with local perceptions, competition and cooperation, and self-learning.The agent through the neighborhood of the collection of information and response to information.and interactions between Agent and Agent or between Agent and environment that Agent survivals to achieve the purpose of global optimization. To further build a distributed multicast routing algorithm for multi-multicast.Agent technology can better adapt to the distributed characteristics of Internet,and The introduction of the Agent network distributed routing computing is an innovative Internet routing system. With the Internet's explosive growth. The existing routing algorithms have been more difficult to meet the Qos requirements. The existing routing algorithms are basically the use of static information,so calculated multicast tree does not reflect the actual situation, with great limitations. For this problem, This paper presents the use of Agent technology, pre-collection, update the network link state information, so as to reflect the actual situation as much as possible.and proposing a distributed routing algorithm based on Agent. The path selection strategy of the algorithm is not use "Source node control algorithm",but use measured delay received in routing and the control of the number of path's hop when multicast trees establishes. Then each node choose independently the next node(Best Node). Numerical experimental results show that the algorithm in this paper can effectively find a more optimal solution multicast routing problem.
Keywords/Search Tags:Agent, Multi-Agent System, Multi-multicast routing problem, Bandwidth Delay-Constrained
PDF Full Text Request
Related items