The Shortest-Path Computation in MOSPF Protocol through an Annealed Chaotic Neural Network.pdf

下载文档

3
0
约3.07万字
约 9页
2017-04-09 发布于江苏
举报
版权申诉
保障服务

The Shortest-Path Computation in MOSPF Protocol through an Annealed Chaotic Neural Network.pdf

1、本文档共9页，可阅读全部内容。
2、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。
3、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。

The Shortest-Path Computation in MOSPF Protocol through an Annealed Chaotic Neural Network

–463– I. Introduction A routing algorithm is employed to find an appropri- ate path so that traffic can be relayed in optimal ways. One important issue in routing algorithms is the speed with which they can react to topology changes. Tradition- ally, TCP/IP uses the Routing Information Protocol (RIP) (Hedrick, 1988), in which routing decisions are made based on the number of hops between the source and des- tination. Many RIP systems have been replaced by a more powerful routing method called the Open Shortest Path First (OSPF) (Moy, 1994a, 1994b) protocol. RFC1583 is a specification of the OSPF TCP/IP internet routing proto- col. OSPF is classified as an Interior Gateway Protocol (IGP). This means that it distributes routing information between routers belonging to a single Autonomous Sys- tem (AS). OSPF belongs to a class of link state protocols in which routing information is flooded through the entire network. It provides a dynamic and adaptive routing me- chanism for making topology changes. The performance of most link-state protocols depends heavily on the opti- mal path calculation. One classical work called the short- est path first algorithm proposed by Dijkstra (1959) is employed in many systems for the purpose of shortest path selection. Dijkstra’s algorithm works well but is computationally intensive, especially in the case of multi- cast routing. Multimedia communications have become important in many network services, such as video conferencing, video on demand, and so on. In order to provide efficient data forwarding, a routing protocol must provide the mul- ticast capability. An enhanced version of the OSPF, called the Multicast Open Shortest Path First (MOSPF) protocol (Moy, 1994b), was proposed to deal with IP multicast routing. RFC1584 is the protocol used for multicast ex- tensions to OSPF. MOSPF is a source/destination routing in which each router must construct a tree rooted at the source node. This is different from unicast OSP