Design and Configuration of Reconfigurable ATM Networks with Unreliable Links

This paper considers a problem of configuring both physical backbone and logical virtual path (VP) networks in a reconfigurable asynchronous transfer mode (ATM) network where links are subject to failures. The objective is to determine jointly the VP assignment, the capacity assignment of physical l...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:ETRI journal Jg. 21; H. 4; S. 9 - 22
1. Verfasser: Lee, Jong Hyup
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Taejon Electronics and Telecommunications Research Institute 01.12.1999
Schlagworte:
Applied sciences
Exact sciences and technology
Networks and services in france and abroad
Organization and planning of networks (techniques and equipments)
Public networks and services (including isdn)
Systems, networks and services of telecommunications
Telecommunications
Telecommunications and information theory
Teleprocessing networks. Isdn
Configuration
Resource allocation
Routing
System design
Mixed integer programming
Non linear programming
Integrated services digital network
Wide band
Heuristic method
Relaxation method
Reliability
Lagrangian method
Asynchronous transfer mode
ISSN:1225-6463, 2233-7326
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This paper considers a problem of configuring both physical backbone and logical virtual path (VP) networks in a reconfigurable asynchronous transfer mode (ATM) network where links are subject to failures. The objective is to determine jointly the VP assignment, the capacity assignment of physical links and the bandwidth allocation of VPs, and the routing assignment of traffic demand at least cost. The network cost includes backbone link capacity expansion cost and penalty cost for not satisfying the maximum throughput of the traffic due to link failures or insufficient link capacities. The problem is formulated as a zero‐one non‐linear mixed integer programming problem, for which an effective solution procedure is developed by using a Lagrangean relaxation technique for finding a lower bound and a heuristic method exploited for improving the upper bound of any intermediate solution. The solution procedure is tested for its effectiveness with various numerical examples.
Bibliographie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:1225-6463
2233-7326
DOI:10.4218/etrij.99.0199.0402