SIGN-IN

Publication: Modeling Flow and Congestion in Packet Switching Networks

All || By Area || By Year

Title Modeling Flow and Congestion in Packet Switching Networks
Authors/Editors* A. T. Lawniczak, P.Zhao, A. Gerisch and B. Di Stefano
Where published* IEEE Canadian Review – Winter/Hiver 2002
How published* None
Year* 2002
Volume 0
Number 0
Pages
Publisher
Keywords Data Networks, Packet Switching Networks, Flow, Congestion, Modeling, Simulation
Link http://www.ieee.ca
Abstract
We investigate simplified models of packet switching networks and examine how an introduction of additional randomly generated links influences the performance of these networks. In general, the impact of additional randomly generated links on the performance of a network depends on a routing algorithm used in the network and on a “cost” assigned to each network link. With the shortest path full table routing, where the cost of each link is one, i.e. with the “minimum-hop full table routing”, degradation of performance of a network is observed. However, if the cost of each link is equal to the queue size of the node from which the link originates or to the queue size plus one then an improvement in the network performance is observed.
Go to Mathematical Modeling & Simulation
Back to page 111 of list