Dynamic management of routing tables and connection re-routing in ATM networks

1999 2nd International Conference on ATM. ICATM'99 (Cat. No.99EX284) Pub Date : 1999-06-21 DOI:10.1109/ICATM.1999.786791

S. Kumar, S. Raghavan

{"title":"Dynamic management of routing tables and connection re-routing in ATM networks","authors":"S. Kumar, S. Raghavan","doi":"10.1109/ICATM.1999.786791","DOIUrl":null,"url":null,"abstract":"Virtual path and virtual channel management are very important to ATM networks. By using the VP concept the virtual layout of the network can be modified to improve the utilization of the network. With large bandwidths freely available the existing VP management strategies need to be modified. One of the problems that may arise as a result of this is that the number of connections supported by the link, does not scale proportionately with increase in bandwidth. The number of VCs is limited by the size of the VCI. The connection routing tables in a switch may overflow which would result in unused bandwidth. The existing VP layout algorithms can handle this problem but they suffer from the following deficiencies. They are, 1) Time-driven, 2) Their effect is global and, 3) They are generally centralized. In this paper we have discuss the issues regarding this problem. We first study the switch routing table design issues and how they can handle these problems to some extent. We then present a distributed algorithm to dynamically reduce the number of connection table entries in an ATM switch.","PeriodicalId":370762,"journal":{"name":"1999 2nd International Conference on ATM. ICATM'99 (Cat. No.99EX284)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"1999 2nd International Conference on ATM. ICATM'99 (Cat. No.99EX284)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICATM.1999.786791","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

Abstract

Virtual path and virtual channel management are very important to ATM networks. By using the VP concept the virtual layout of the network can be modified to improve the utilization of the network. With large bandwidths freely available the existing VP management strategies need to be modified. One of the problems that may arise as a result of this is that the number of connections supported by the link, does not scale proportionately with increase in bandwidth. The number of VCs is limited by the size of the VCI. The connection routing tables in a switch may overflow which would result in unused bandwidth. The existing VP layout algorithms can handle this problem but they suffer from the following deficiencies. They are, 1) Time-driven, 2) Their effect is global and, 3) They are generally centralized. In this paper we have discuss the issues regarding this problem. We first study the switch routing table design issues and how they can handle these problems to some extent. We then present a distributed algorithm to dynamically reduce the number of connection table entries in an ATM switch.

查看原文本刊更多论文

ATM网络中路由表的动态管理与连接重路由

虚拟路径和虚拟通道管理是ATM网络的重要组成部分。利用虚拟空间的概念，可以修改网络的虚拟布局，提高网络的利用率。随着大带宽的免费使用，现有的VP管理策略需要进行修改。由此可能出现的一个问题是，链路支持的连接数量不能随着带宽的增加而成比例地扩展。vc的数量受VCI大小的限制。交换机中的连接路由表可能溢出，从而导致未使用的带宽。现有的VP布局算法可以处理这一问题，但存在以下不足。它们是，1)时间驱动的，2)它们的影响是全球性的，3)它们通常是集中的。本文就这一问题进行了探讨。我们首先研究了交换机路由表的设计问题以及如何在一定程度上处理这些问题。然后，我们提出了一种分布式算法来动态地减少ATM交换机中连接表项的数量。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

1999 2nd International Conference on ATM. ICATM'99 (Cat. No.99EX284)

自引率

0.00%

发文量