Bruce Lowekamp
ABSTRACT
Accurate network topology information is important for both network management and application performance prediction. Most topology discovery research has focused on wide-area networks and examined topology only at the IP router level, ignoring the need for LAN topology information. Recent work has demonstrated that bridged Ethernet topology can be determined using standard SNMP MIBs; however, these algorithms require each bridge to learn about all other bridges in the network. Our approach to Ethernet topology discovery can determine the connection between a pair of the bridges that share forwarding entries for only three hosts. This minimal knowledge requirement significantly expands the size of the network that can be discovered. We have implemented the new algorithm, and it has accurately determined the topology of several different networks using a variety of hardware and network configurations. Our implementation requires access to only one endpoint to perform the queries needed for topology discovery.
- 1.I. Ahmad, Y. Kwok, and M. Wu. Analysis, Evaluation, and Comparison of Algorithms for Scheduling Task Graphs on Parallel Processors. In Proceedings of the Second International Symposium on Parallel Architectures, Algorithms, and Networks, pages 207-213, June 1996. Google Scholar
Digital Library
- 2.A. Bierman and K. Jones. Physical topology MIB. RFC2922, September 2000. Google ScholarDigital Library
- 3.Y. Breitbart, M. Garofalakis, C. Martin, R. Rastogi, S. Seshadri, and A. Silberschatz. Topology discovery in heterogeneous IP networks. In Proceedings of INFOCOM 2000, March 2000.Google ScholarCross Ref
- 4.CAIDA. Skitter. http://www.caida.org/TOOLS/measurement/skitter/.Google Scholar
- 5.P. E. Crandall and M. J. Quinn. A partitioning advisory system for networked data-parallel processing. Concurrency: Practice and Experience, 7(5):479-495, August 1995.Google ScholarCross Ref
- 6.P. A. Dinda and D. R. O'Hallaron. An evaluation of linear models for host load prediction. In Proceedings of the 8th IEEE International Symposium on High Performance Distributed Computing (HPDC), August 1999. Google ScholarDigital Library
- 7.S. Figueira and F. Berman. Modeling the effects of contention on the performance of heterogeneous applications. In Proceedings of the Fifth IEEE International Symposium on High Performance Distributed Computing (HPDC 5), pages 392-401, Syracuse, NY, August 1996. Google ScholarDigital Library
- 8.R. Govindan and H. Tangmunarunkit. Heuristics for internet map discovery. In IEEE INFOCOM 2000, Tel Aviv, Israel, March 2000.Google ScholarCross Ref
- 9.S. Jamin, C. Jin, Y. Jin, D. Raz, Y. Shavitt, and L. Zhang. On the placement of internet instrumentation. In IEEE INFOCOM 2000, Tel Aviv, Israel, March 2000.Google ScholarCross Ref
- 10.P. K. K. Loh, W. J. Hsu, C. Wentong, and N. Sriskanthan. How Network Topology Affects Dynamic Load Balancing. IEEE Parallel and Distributed Technology, pages 25-35, Fall 1996. Google ScholarDigital Library
- 11.B. Lowekamp and A. Beguelin. ECO: Efficient collective operations for communication on heterogeneous networks. In Proceedings of the 10th International Parallel Processing Symposium (IPPS'96), pages 399-405. IEEE, April 1996. Google ScholarDigital Library
- 12.B. Lowekamp, N. Miller, D. Sutherland, T. Gross, P. Steenkiste, and J. Subhlok. A resource query interface for network-aware applications. Cluster Computing, 2(2):139-151, 1999. Google ScholarDigital Library
- 13.B. Lowekamp, D. O'Hallaron, and T. Gross. Direct queries for discovering network resource properties in a distributed environment. In Proceedings of the 8th IEEE International Symposium on High Performance Distributed Computing (HPDC), pages 38-46. IEEE Computer Society, August 1999. Google ScholarDigital Library
- 14.N. Miller and P. Steenkiste. Collecting network status information for network-aware applications. In IEEE INFOCOM 2000, Tel Aviv, Israel, March 2000.Google ScholarCross Ref
- 15.K. Obraczka and G. Gheorghiu. The performance of a service for network-aware applications. In Proceedings of the ACM Sigmetrics SPDT'98, 1998. Google ScholarDigital Library
- 16.G. Shao, F. Berman, and R. Wolski. Using effective network views to promote distributed application performance. In Proceedings of the 1999 International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA'99), 1999.Google Scholar
- 17.R. Siamwalla, R. Sharma, and S. Keshav. Discovering internet topology. http://www.cs.cornell.edu/skeshav/papers/discovery.pdf, July 1998.Google Scholar
- 18.W. Theilmann and K. Rothermel. Dynamic distance maps of the internet. In IEEE INFOCOM 2000, Tel Aviv, Israel, March 2000.Google ScholarCross Ref
Index Terms
- Topology discovery for large ethernet networks
Recommendations
Topology discovery for large ethernet networks
Proceedings of the 2001 SIGCOMM conferenceAccurate network topology information is important for both network management and application performance prediction. Most topology discovery research has focused on wide-area networks and examined topology only at the IP router level, ignoring the ...
Ethernet topology discovery for networks with incomplete information
In this paper, we investigate the problem of finding the layer-2 network topology of large, heterogeneous multisubnet Ethernet networks that may include uncooperative network nodes. We prove that finding a layer-2 network topology for a given incomplete ...
Topology discovery for public IPv6 networks
In just three decades the Internet has grown from a small experimental research network into a complex network of routers, switches, and hosts. Understanding the topology of such large scale networks is essential to the procurement of good architectural ...
Comments