Abstract
This paper describes a methodology for designing interconnected LAN/MAN networks with the objective of minimizing the average network delay. We first consider IEEE 802 standard LAN's interconnected by transparent bridges. These bridges are required to form a spanning tree topology. We propose a simulated annealing-based algorithm for designing minimum delay spanning tree topologies. In order to measure the quality of the solutions, we find a lower bound for the average network delay. We extend the algorithm to design the overall LAN/MAN topology consisting of a MAN or high-speed data service interconnecting several clusters of bridged LAN's. Comparison with the lower bound and several other goodness measures show that the solutions are not very far from the global minimum.
Original language | English (US) |
---|---|
Pages (from-to) | 1172-1182 |
Number of pages | 11 |
Journal | IEEE Journal on Selected Areas in Communications |
Volume | 11 |
Issue number | 8 |
DOIs | |
State | Published - Oct 1993 |
ASJC Scopus subject areas
- Computer Networks and Communications
- Electrical and Electronic Engineering