By Topic

A fast topology maintenance algorithm for high-bandwidth networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Abu-Amara, H. ; IBM T. J. Watson Res. Center, Hawthorne, NY, USA

A fast time-driven algorithm for topology maintenance in high-speed networks is presented. The algorithm uses only four time units for each broadcast by each computer. The best previous algorithm required O(log m) time units for each broadcast by each computer, where m is the number of currently operational computers in the network. In addition to its speed, the presented algorithm makes several significant contributions. I. Cidon et al. (1988) have shown that Ω(log m) time units are necessary for time-driven topology maintenance algorithms of high-speed networks that do not allow a packet to traverse the same edge in both directions. The proposed algorithm shows that this lower bound does not hold for networks that do allow a packet to traverse the same edge in both directions. The O(log m) algorithm assumed that it takes each computer at most one time unit to simultaneously broadcast messages to all neighbors of the computer. In contrast, a node in the proposed algorithm can send at most, one message per time unit. As in the O(log m) algorithm, the algorithm requires O (D) broadcasts per node before all nodes know the correct topology of the network, where D is the diameter of the currently operational portion of the network

Published in:

Networking, IEEE/ACM Transactions on  (Volume:1 ,  Issue: 3 )