LP-Based Heuristic Algorithms for Interconnecting Token Rings viaSource Routing Bridges

Authors:
V. Sridhar;June S. Park;Bezalel Gavish
Affiliations:
Management Department, The Kogod College of Business Administration, American University, Washington DC 20016-8044, USA;Department of Management Sciences, 108 Pappajohn Business Administration Bldg., The University of Iowa, Iowa City, IA 52242-1000, USA. june-park@uiowa.edu;Owen Graduate School of Management, Vanderbilt University, Nashville, TN 37203, USA
Venue:
Journal of Heuristics
Year:
2000

Citing 11
Cited 2

Graphs and algorithms

Graphs and algorithms
Congestion control in interconnected local area networks

Local area and multiple access networks
Strong formulations for mixed integer programming: a survey

Mathematical Programming: Series A and B
Performance modeling and optimization of networks of bridged LANs

Queueing Systems: Theory and Applications
Interconnections: bridges and routers

Interconnections: bridges and routers
A Lagrangian relaxation technique for optimizing interconnection of local area networks

Operations Research
Optimal design of LAN-WAN internetworks: an approach using simulated annealing

Annals of Operations Research - Special issue on operations research in telecommunications
A bootstrap heuristic for designing minimum cost survivable networks

Computers and Operations Research
Performance Issues

Proceedings on Local Area Networks: An Advanced Course
Interconnecting Lans and a Fddi Backbone Using Transparent Bridges: a Model and Solution Algorithms

INFORMS Journal on Computing
Algorithms for designing survivable lan-interconnection networks using transparent bridges

Algorithms for designing survivable lan-interconnection networks using transparent bridges

A survey on benders decomposition applied to fixed-charge network design problems

Computers and Operations Research
Local search starting from an LP solution: Fast and quite good

Journal of Experimental Algorithmics (JEA)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We develop a method to determine the topology of a network thatinterconnects a number of token rings using source routing bridges.The purpose is to compute a topology that provides low responsedelays for network users at a minimal cost of bridge installations.We formulate this network design problem as a mixed binary integerlinear program. We develop effective heuristic algorithms. Thealgorithms exploit the topology and routing solutions of the linearprogramming relaxation in a sophisticated manner which we believeis new in the literature. The model incorporates performanceissues, such as network stability, bridge overflow, back pressureeffect and broadcast storm, that are specific to the underlyingcommunication technology. By formally incorporating theseperformance issues, we tighten the model formulation and improvethe quality of the LP bound considerably. Computational results arereported for problems with up to 20 token rings and 190 potentialbridge locations.