Strategies for Dynamic Capacity Management

Document type: Conference Papers
Peer reviewed: Yes
Full text:
Author(s): Åke Arvidsson
Title: Strategies for Dynamic Capacity Management
Conference name: Eighth Australian Teletraffic Research Seminar
Year: 1993
Pagination: 291-300
City: Melbourne
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
http://www.hk-r.se/itm/index.html
Authors e-mail: ake.arvidsson@itm.hk-r.se
Language: English
Abstract: We study networks based on virtual paths, i.e. rearrangable end-to-end transport network. Virtual
paths networks are readily implemented in any network using the synchronous digital hierarchy
and/or the asynchronous transfer mode. The concept and its advantages, for example cost savings,
network operation simplification and enhanced network management capabilities, are discussed.
Algorithms for virtual path designs are reviewed and a new algorithm is presented which is found
to compare favourably with the algorithm providing the most similar features. Applying it to
a real network, we turn to operational aspects of reconfigurable networks such as methods and
parameters for traffic estimation and network updating. The validity of the results is demonstrated
by means of simulations of a number of networks subject to variable traffics.
Subject: Telecommunications\VP and VC Assignment and Routing
Note: This article is written under the Project "VP and VC Assignment and Routing"
Edit