Premium
Path enumeration and hot‐potato routeing analysis in multihop networks
Author(s) -
Ayanoǧlu Ender,
Caballero Richard J.
Publication year - 1992
Publication title -
international journal of digital and analog communication systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.344
H-Index - 49
eISSN - 1099-1131
pISSN - 1047-9627
DOI - 10.1002/dac.4510050404
Subject(s) - enumeration , graph , function (biology) , path length , mathematics , taylor series , derivative (finance) , path (computing) , transfer (computing) , computer science , combinatorics , algorithm , computer network , mathematical analysis , parallel computing , evolutionary biology , biology , financial economics , economics
Using a labelling of the edges of the network graph for a multihop network and a Taylor series expansion of the transfer function of the resulting signal flow graph, we calculate the number of paths of a given length in the multihop network. The derivative of the transfer function and a fixed point algorithm yield the average delay as a function of the packet arrival rate.