Analysis of shortest-path routing algorithms in a dynamic network environment

Author:

Wang Zheng,Crowcroft Jon

Abstract

In a dynamic network environment under heavy traffic load, shortest-path routing algorithms, particularly those that attempt to adapt to traffic changes, frequently exhibit oscillatory behaviors and cause performance degradation. In this paper we first examine the problems from the perspective of control theory and decision making, and then analyze the behaviors of the shortest-path routing algorithms in details.

Publisher

Association for Computing Machinery (ACM)

Subject

Computer Networks and Communications,Software

Reference15 articles.

1. The ARPA Network Design Decision;McQuillan J. M.;Computer Networks,1977

2. A correctness proof of a topology information maintenance protocol for a distributed computer network

3. [ 3 ] C. L. Hedrick "An Introduction to IGRP" Preprint RUTGERS Centre for Computers and Information Services The State University of New Jersey Oct. 1989. [3] C. L. Hedrick "An Introduction to IGRP" Preprint RUTGERS Centre for Computers and Information Services The State University of New Jersey Oct. 1989.

4. The New Routing Algorithm for the ARPANET;McQuillan J. M.;IEEE Transactions on Communications,1980

5. [ 5 ] J. Moy The OSPF Specification" RFC 1131 SRI International Menlo Park Calif. Oct. 1989. [5] J. Moy The OSPF Specification" RFC 1131 SRI International Menlo Park Calif. Oct. 1989.

Cited by 45 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Achieving Predictable and Scalable Load Balancing Performance in LEO Mega-Constellations;ICC 2024 - IEEE International Conference on Communications;2024-06-09

2. Early Prevention and Mitigation of Link Flooding Attacks in Software Defined Networks;Journal of Network and Computer Applications;2024-04

3. Link Analysis and Shortest Path Algorithm for Money Laundry Detection;2023 International Symposium on Networks, Computers and Communications (ISNCC);2023-10-23

4. flow-models: A framework for analysis and modeling of IP network flows;SoftwareX;2022-01

5. On-demand Intelligent Routing Algorithms for the Deterministic Networks;2021 IEEE 23rd Int Conf on High Performance Computing & Communications; 7th Int Conf on Data Science & Systems; 19th Int Conf on Smart City; 7th Int Conf on Dependability in Sensor, Cloud & Big Data Systems & Application (HPCC/DSS/SmartCity/DependSys);2021-12

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3