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 |
Fingerprint
ASJC Scopus subject areas
- Computer Networks and Communications
- Electrical and Electronic Engineering
Cite this
Topological design of interconnected LAN/MAN networks. / Ersoy, Cem; Panwar, Shivendra.
In: IEEE Journal on Selected Areas in Communications, Vol. 11, No. 8, 10.1993, p. 1172-1182.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - Topological design of interconnected LAN/MAN networks
AU - Ersoy, Cem
AU - Panwar, Shivendra
PY - 1993/10
Y1 - 1993/10
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=0027684070&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0027684070&partnerID=8YFLogxK
U2 - 10.1109/49.245906
DO - 10.1109/49.245906
M3 - Article
VL - 11
SP - 1172
EP - 1182
JO - IEEE Journal on Selected Areas in Communications
JF - IEEE Journal on Selected Areas in Communications
SN - 0733-8716
IS - 8
ER -