Topology identification for traffic and configuration management in dynamic networks
- 1 January 1992
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 2197-2204 vol.3
- https://doi.org/10.1109/infcom.1992.263427
Abstract
The authors address the problem of identifying the topology of a network from data collected at a designated node (possibly one of the network nodes). The data considered are descriptions of the local neighborhood about each node, which specify the identities of the node and of its neighbors. These data are neither required to be correct nor complete. The authors propose a model that describes and relates the network topology and the data. They define costs associated with this model, and reduce the identification problem to a combinational optimization problem with and an objective function based on these costs. A pseudo-polynomial-time algorithm is derived, which yields a local minimum of the objective function. The local minimum appears to be a reasonable solution, as shown by a range of examples.<>Keywords
This publication has 8 references indexed in Scilit:
- Multihop lightwave networks: a new approach to achieve terabit capabilitiesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Logically rearrangeable multihop lightwave networksIEEE Transactions on Communications, 1991
- Shortest paths and loop-free routing in dynamic networksPublished by Association for Computing Machinery (ACM) ,1990
- Future directions in packet radio architectures and protocolsProceedings of the IEEE, 1987
- Issues in packet radio network designProceedings of the IEEE, 1987
- A design concept for reliable mobile radio networks with frequency hopping signalingProceedings of the IEEE, 1987
- Regular Mesh Topologies in Local and Metropolitan Area NetworksAT&T Technical Journal, 1985
- The Organization of Computer Resources into a Packet Radio NetworkIEEE Transactions on Communications, 1977