arXiv · adap-org/9909006
Performance of data networks with random links
Abstract
We investigate simplified models of computer data networks and examine how the introduction of additional random links influences the performance of these net works. In general, the impact of additional random links on the performance of the network strongly depends on the routing algorithm used in the network. Significant performance gains can be achieved if the routing is based on "geometrical distance" or shortest path reduced table routing. With shortest path full table routing degradation of performance is observed.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Henryk Fuks, Anna T. Lawniczak. 2001-01-04. Performance of data networks with random links. https://doi.org/10.1016/s0378-4754(99)00125-1
Cite the original work for its findings. Save a collection to share your selection of sources.