By reserving transmission capacity on a series of links from one node to another, making a virtual path connection (VPC) between these nodes, several benefits are obtained. VPCs will simplify routing at transit nodes, connection admission control, and QoS management by traffic segregation. As telecommunications traffics experience variations in the number of calls per time unit due to office hours, inaccurate forecasting, quick changes in traffic loads, and changes in the types of traffic (as in introduction of new services), there is a need to cope for this by adaptive capacity reallocation between different VPCs. We have developed a type of local VPC capacity management policy that uses an allocation function to determine the needed capacity for the coming updating interval, based on the current number of active connections but independently of the offered traffic. We determine its optimal parameters, and the optimal updating interval for different overhead costs. Our policy is shown to be able to combine benefits from both VP and VC routing by fast capacity reallocations. The method of signaling is easy to implement and our evaluations indicate that the method is robust. This paper is based on our earlier work, described in [19]. The calculations are simplified and the methodology is changed.

För att utnyttja ett tele/datornäts kapacitet på bästa möjliga sätt och samtidigt garantera kvalitet på överföringen av data, reserveras kapacitet på nätet med sk logiska länkar (VP=Virtual Paths). Tidigare arbeten har fokuserats på att en central dator gör detta jobb. Denna publikation utvärderar en "lokal" metod, där varje växel använder information som redan finns där. Metoden använder antalet pågående uppkopplingar för att räkna ut hur mycket kapacitet som varje VP från denna nod behöver under kommande uppdateringsintervall. Vi optimerar allokeringsfunktionen map overhead-kostnader och uppdateringsintervall. Metoden drar fördelar av både VP- och VC-vägval genom nätet.