Strategies for Dynamic Network Management

Document type: Conference Papers
Peer reviewed: Yes
Full text:
Author(s): Åke Arvidsson
Title: Strategies for Dynamic Network Management
Conference name: Elfte Nordiska Teletrafikseminariet
Year: 1993
City: Stockholm
Organization: Blekinge Institute of Technology
Department: Dept. of Telecommunications and Mathematics (Institutionen för telekommunikation och matematik)
Dept. of Telecommunications and Mathematics S-371 79 Karlskrona
+46 455 780 00
Authors e-mail:
Language: English
Abstract: We study management of transport networks based on virtual paths, i.e. rearrangable end-to-end
transport network \highways". Among its main advantages are found cost savings, network op-
eration simplification and enhanced network management capabilities. Virtual paths networks
are readily implemented in any network using the synchronous digital hierarchy and/or the asyn-
chronous transfer mode.
Algorithms for virtual path designs are reviewed and found to have a few shortcomings. A
new algorithm is therefore proposed and it is found to compare favourably with the algorithm
providing the most similar features.
Applying the proposed algorithm to a large number of networks, we discuss operational con-
siderations associated with reconfigurable networks and investigate simple traffic estimation pro-
cedures and their performance in this context. Finally, the choice of reconfiguration parameters
such as updating frequency, and the impact of network design time are examined.
Subject: Telecommunications\VP and VC Assignment and Routing
Note: This article is written under the Project "VP and VC Assignment and Routing"