Computer Science – Performance
Scientific paper
Jun 1989
adsabs.harvard.edu/cgi-bin/nph-data_query?bibcode=1989spie.1059...22g&link_type=abstract
IN: Space sensing, communications, and networking; Proceedings of the Meeting, Los Angeles, CA, Jan. 16-18, 1989 (A90-31926 13-1
Computer Science
Performance
Computerized Simulation, Distributed Processing, Packet Transmission, Satellite Communication, Satellite Networks, Algorithms, Iterative Solution, Performance Prediction, Systems Simulation, Topology
Scientific paper
A comparison of the performance of two algorithms, the distributed form of the Ford and Fulkerson (1962) algorithm and the algorithm developed by Merlin and Segall (1979), is used to determine the performance of distributed routing computation. The two algorithms were applied to a simple network and to a network typical of orbital satellite topologies. It is shown the two algorithms have advantages and disadvantages highly dependent on the topology. For small networks with few hops to the sink node, the Merlin and Segall algorithm is superior in terms of message overhead, with an equal number of iterations for both. For the larger network consisting of a relatively large degree and a frequently large number of hops, the Ford and Fulkerson method is clearly superior, since the Merlin and Segall algorithm complexity leads to excessive messages and iterations.
Gross J. L.
Ziemer R. E.
No associations
LandOfFree
Distributed routing network performance in hostile environments does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Distributed routing network performance in hostile environments, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Distributed routing network performance in hostile environments will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-1052191