Signal flow graphs for path enumeration and deflection routing analysis in multihop networks

IEEE Global Telecommunications Conference, 1989, and Exhibition. 'Communications Technology for the 1990s and Beyond Pub Date : 1989-11-27 DOI:10.1109/GLOCOM.1989.64114

E. Ayanoglu

{"title":"Signal flow graphs for path enumeration and deflection routing analysis in multihop networks","authors":"E. Ayanoglu","doi":"10.1109/GLOCOM.1989.64114","DOIUrl":null,"url":null,"abstract":"The method of signal flow graphs is applied to path enumeration and deflection routing performance analysis in multihop networks. The method uses a labeling of the edges of the network graph and the subsequent solution for the transfer function of the resulting signal flow graph. A Taylor series expansion of the transfer function yields the number of paths of a given length between the source and the destination. It is desirable that this number be large so that routing strategies can provide alternate paths to reach a node in case of congestion or link failure, with increased reliability, recoverability, and reduced delay. On the other hand, the derivative of the transfer function yields the average number of hops in the network as a rational function of the probability of deflection of a packet. A fixed-point algorithm is used to solve for the probability of deflection as a function of the arrival rate of packets. Combining the two results permits the average number of hops to be obtained as a function of the packet arrival rate. Analysis examples chosen from proposed multihop network architectures are given.<<ETX>>","PeriodicalId":256305,"journal":{"name":"IEEE Global Telecommunications Conference, 1989, and Exhibition. 'Communications Technology for the 1990s and Beyond","volume":"65 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1989-11-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"28","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Global Telecommunications Conference, 1989, and Exhibition. 'Communications Technology for the 1990s and Beyond","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOCOM.1989.64114","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 28

Abstract

The method of signal flow graphs is applied to path enumeration and deflection routing performance analysis in multihop networks. The method uses a labeling of the edges of the network graph and the subsequent solution for the transfer function of the resulting signal flow graph. A Taylor series expansion of the transfer function yields the number of paths of a given length between the source and the destination. It is desirable that this number be large so that routing strategies can provide alternate paths to reach a node in case of congestion or link failure, with increased reliability, recoverability, and reduced delay. On the other hand, the derivative of the transfer function yields the average number of hops in the network as a rational function of the probability of deflection of a packet. A fixed-point algorithm is used to solve for the probability of deflection as a function of the arrival rate of packets. Combining the two results permits the average number of hops to be obtained as a function of the packet arrival rate. Analysis examples chosen from proposed multihop network architectures are given.<>

查看原文本刊更多论文

多跳网络中路径枚举和偏转路由分析的信号流图

将信号流图的方法应用于多跳网络的路径枚举和偏转路由性能分析。该方法对网络图的边缘进行标记，并对得到的信号流图的传递函数进行后续求解。传递函数的泰勒级数展开式可以得到给定长度的源点和目标点之间的路径数。希望这个数字足够大，以便路由策略可以在拥塞或链路故障的情况下提供到达节点的替代路径，同时提高可靠性、可恢复性和减少延迟。另一方面，传递函数的导数产生网络中的平均跳数，作为数据包偏转概率的有理函数。采用不动点算法求解偏折概率作为数据包到达率的函数。结合这两个结果，可以得到平均跳数作为包到达率的函数。给出了从所提出的多跳网络结构中选择的分析实例。

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

求助全文

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

来源期刊

IEEE Global Telecommunications Conference, 1989, and Exhibition. 'Communications Technology for the 1990s and Beyond

自引率

0.00%

发文量