Portal Perguruan Tinggi
Select Language
Simple Search
Advanced Search
OPAC
Katalog Online Perpustakaan Universitas Ma Chung Villa Puncak Tidar N-01 Malang - Jawa Timur.
DDC v.22
Klasifikasi & Katalogisasi DDC versi 22
Validated
| Title | LP-Based Heuristic Algorithms for Interconnecting Token Rings via Source Routing Bridges |
| Edition | Volume 6, Number 1 |
| Call Number | |
| ISBN/ISSN | 1381-1231 |
| Author(s) | V. SRIDHAR GAVISH,BEZALEL PARK,JUNE S. |
| Subject(s) | |
| Classification | |
| Series Title | Journal of Heuristics | GMD | Electronic Journal |
| Language | English |
| Publisher | Springer Netherlands |
| Publishing Year | 2000 |
| Publishing Place | Netherlands |
| Collation | 18p |
| Abstract/Notes | We develop a method to determine the topology of a network that interconnects a number of token rings using source routing bridges. The purpose is to compute a topology that provides low response delays for network users at a minimal cost of bridge installations.We formulate this network design problem as a mixed binary integer linear program. We develop effective heuristic algorithms. The algorithms exploit the topology and routing solutions of the linear programming relaxation in a sophisticated manner which we believe is new in the literature. The model incorporates performance issues, such as network stability, bridge overflow, back pressure effect and broadcast storm, that are specific to the underlying communication technology. By formally incorporating these performance issues, we tighten the model formulation and improve the quality of the LP bound considerably. Computational results are reported for problems with up to 20 token rings and 190 potential bridge locations. |
| Specific Detail Info | |
| Image |  |
| File Attachment | LOADING LIST... |
| Availability | LOADING LIST... |
| Back To Previous |