Nothing Special   »   [go: up one dir, main page]

EP0941619A1 - Method and system of dynamic trafic control in a communication network - Google Patents

Method and system of dynamic trafic control in a communication network

Info

Publication number
EP0941619A1
EP0941619A1 EP97947027A EP97947027A EP0941619A1 EP 0941619 A1 EP0941619 A1 EP 0941619A1 EP 97947027 A EP97947027 A EP 97947027A EP 97947027 A EP97947027 A EP 97947027A EP 0941619 A1 EP0941619 A1 EP 0941619A1
Authority
EP
European Patent Office
Prior art keywords
route
alternative
fan
routes
alternative routes
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Withdrawn
Application number
EP97947027A
Other languages
German (de)
French (fr)
Inventor
Rainer Stademann
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Siemens AG
Original Assignee
Siemens AG
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Siemens AG filed Critical Siemens AG
Publication of EP0941619A1 publication Critical patent/EP0941619A1/en
Withdrawn legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q3/00—Selecting arrangements
    • H04Q3/64—Distributing or queueing
    • H04Q3/66—Traffic distributors
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13103—Memory
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13109—Initializing, personal profile
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13141—Hunting for free outlet, circuit or channel
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13164—Traffic (registration, measurement,...)
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13166—Fault prevention
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13213—Counting, timing circuits
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13217—Cranckback in routing, trombone connection, loopback circuit
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13332—Broadband, CATV, dynamic bandwidth allocation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13344—Overflow
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
    • H04Q2213/13353—Routing table, map memory

Definitions

  • the invention relates to a method and a routing system for dynamic traffic control in a communication network
  • Non-hierarchically organized, circuit-switched communication networks require dynamic routing, which adapts to the traffic load in the network in such a way that network throughput is optimized. In particular, unbalanced load situations must be mitigated by routing.
  • any overflow traffic that occurs is assigned to one or more active alternative routes.
  • This active alternative route or these active alternative routes are not fixed, but are selected in accordance with the respective method for dynamic routing or are even redetermined for each call.
  • the advantages of dynamic routing lie in its robustness and flexibility compared to unbalanced load situations in the network, which e.g. due to fluctuating loads (spatially limited high volume of traffic, e.g. in the event of disasters) and network degradation (failure of trunk bundles, failures of switching units).
  • uncertainties in network planning can be better compensated for.
  • Central state-controlled (dynamic) routing methods are based on a network-central processor, which provides information about the existing local network nodes
  • Decentralized, state-controlled (dynamic) methods are based on the feedback of load states of the trunk groups to the origin node of the non-hierarchical (sub) network.
  • Methods have the disadvantage that the non-standardized interface between the network nodes requires a homogeneous network (e.g. network nodes from only one manufacturer) and that a high signaling effort is also required.
  • Decentralized event-controlled (dynamic) routing methods can increase performance achieve by learning the respective load situation by evaluating the busy events. These methods use the blocking event information to replace the blocked path with another path.
  • sporadic blockages caused by statistical fluctuations in the offered traffic
  • almost complete blockages caused by unbalanced loads or partial network overload.
  • a decentralized event-controlled method according to the preamble of claim 1 is known from European application EP 0 696 147 AI (internal to SAG 94P1542E).
  • the invention has for its object to avoid the disadvantage mentioned.
  • the invention prevents that highly loaded alternative routes too soon after leaving the
  • the figure shows a diagram of a small, fully meshed network with six network switching nodes and the corresponding capacities of the path sections (links) between the network nodes, a link comprising at least one trunk group.
  • switching node 1 has a call for switching node 2, but the direct route between the two switching nodes is not available.
  • the path fan i.e. the subjects of the active alternative routes, after its last reinitialization, comprise three alternative routes, namely the two-link alternative routes via the switching nodes 3, 4 and
  • routing system would cyclically distribute the overflowing traffic over these active alternative routes in the order of transit nodes 3, 4 and 5.
  • the routing system at switching node 1 first checks whether the first link of the active alternative route is available via transit node 3, i.e. whether the link between switching nodes 1 and 3 has assignable free lines or channels (hereinafter referred to as "channels").
  • the routing system stores in switching node 1 the maximum capacity of the link between switching nodes 1 and 3, namely, for example, 125 channels and the trunk reservation parameter associated with this link, which is 10 here, for example.
  • the routing system also stores the number of channels currently in use. From the point of view of the routing system, the link between switching nodes 1 and 3 is therefore available for overflow traffic if the sum of the channels used and the trunk reservation parameter is less than 125 (the trunk reservation guarantees the stability of a routing method in the high-load range ).
  • the switching node 1 initially establishes the connection up to the switching node 3.
  • the routing system of the switching node 3 checks the availability of the second link before continuing to set up the connection to the destination switching node 2 by checking whether the sum of occupied channels plus the trunk reservation parameter is less than the capacity of the second link is (the routing system of switching node 3 knows the maximum capacity of the link between switching nodes 3 and 2, the trunk reservation parameter of this link and the number of channels currently occupied by this link).
  • the next call for the switching node 2 if the direct route is not available, an attempt is made to route the overflowing call via the transit node 3.
  • the number of successful calls immediately following the alternative route is counted. Only when a predetermined maximum number of successfully offered calls is reached is there a cyclical change, ie the next overflowing call is then routed via the next active alternative route, ie the active alternative route via transit node 4.
  • Short-term autocorrelations in the traffic offer on the second link can be used, which increase the probability that another connection can be established in the same way immediately after a successful connection establishment.
  • the removed alternative route is included in a first set (so-called first passive set) of alternative routes if the number of calls successfully offered to the alternative route is below a certain value and in a second (passive) set of alternative routes if the number is reached or exceeded a certain value.
  • first passive set a first passive set of alternative routes if the number of calls successfully offered to the alternative route is below a certain value
  • second (passive) set of alternative routes if the number is reached or exceeded a certain value.
  • the path fan will be designated after the entry of a
  • Event e.g. command from network management or expiry of a time period
  • a certain condition e.g. falling short of a predetermined number of alternative routes in the route fan.
  • the reinitialization is carried out by refilling the route fan with those alternative routes which, according to the chronological order, have been the longest removed from the route fan.
  • First of all only alternative route from the first set of liabilities is taken into account. However, if this is not sufficient to fill the route fan, alternative routes from the second set of liabilities are also taken into account.
  • the transit node 3 determines that the link to the destination node 2 (second link) is not available, the transit node 3 triggers the connection section to the originating node 1 with a specially marked reverse message (crankback message).
  • the routing system of the originating node 1 then removes the alternative route via transit node 3 from the route fan for destination node 2.
  • the alternative routes removed from the route fan because of the unavailability on the second link are again treated as explained above.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Telephonic Communication Services (AREA)

Abstract

The dynamic trafic control in a communication network must be adapted to the trafic load so as to optimize the trafic flow. Disclosed is a solution taking the form of a dynamic range of alternate routes. When (re)initializing it, due account is taken of the time sequence at the end of which the alternate routes have been removed from said range.

Description

Beschreibungdescription
Verfahren und Routing-System zur dynamischen Verkehrslenkung in einem KommunikationsnetzMethod and routing system for dynamic traffic control in a communication network
Die Erfindung betrifft ein Verfahren und ein Routing-System zur dynamischen Verkehrslenkung in einem KommunikationsnetzThe invention relates to a method and a routing system for dynamic traffic control in a communication network
In einem vollvermaschten nicht hierarchischen Netz mit n- Netzknoten existieren zu jedem Ursprungs-Ziel-Paar n-2In a fully meshed, non-hierarchical network with n network nodes, there are n-2 for each origin-destination pair
Alternativwege mit nur 2 Wegeabschnitten. Von diesen netzweit insgesamt n x (n-1) x (n-2) Alternativwegen sind bei schief belastetem Netz einige Wege unterbelastet, andere Wege überbelastet .Alternative routes with only 2 sections. Of these network-wide altogether n x (n-1) x (n-2) alternative routes, some routes are under-loaded and other routes are overloaded when the network is loaded with a skew.
Nichthierarchisch organisierte, leitungsvermittelnde Kommunikationsnetze benötigen eine dynamische Leitweglenkung (dynamic routing) , die sich an die jeweilige im Netz vorliegende Verkehrslast so anpaßt, daß der Netzdurchsatz optimiert wird. Dabei müssen insbesondere auch Schieflastsituationen durch die Leitweglenkung entschärft werden.Non-hierarchically organized, circuit-switched communication networks require dynamic routing, which adapts to the traffic load in the network in such a way that network throughput is optimized. In particular, unbalanced load situations must be mitigated by routing.
So wie bei der konventionellen Leitweglenkung in hierarchischen Netzen wird auch bei einer dynamischen Leitweglenkung erst versucht, Verbindungen über einen oder mehrere Planwege, die zumeist Direktwege sind, aufzubauen. Ist dies nicht möglich, weil z.B. alle Verbindungsleitungsbündel des Direktwe- ges vollständig belegt sind, wird der Überlaufverkehr Alternativwegen zugewiesen.As with conventional routing in hierarchical networks, dynamic routing is first attempted to establish connections via one or more planned routes, which are mostly direct routes. Is this not possible because e.g. all trunk groups of the direct route are fully occupied, the overflow traffic is assigned to alternative routes.
In der Auswahl der Alternativwege liegt der prinzipielle Unterschied zwischen dynamischer und konventioneller Leitweglenkung. Bei der konventionellen Leitweglenkung werden administrativ festgelegte Alternativwege in starrer Reihenfolge nach einer unbelegten Leitung bzw. einem unbelegten Kanal abgesucht ("fixed alternate routing") . Dadurch kann die Leit- weglenkung nur sehr ungenügend auf nicht geplante, außergewöhnliche Lastsituationen reagieren.The basic difference between dynamic and conventional routing lies in the choice of alternative routes. In conventional routing, administratively determined alternative routes are searched in rigid order for an unused line or channel ("fixed alternate routing"). This allows the control routing reacts only very inadequately to unplanned, extraordinary load situations.
Bei der dynamischen Leitweglenkung wird entstehender Über- laufverkehr einem oder mehreren aktiven Alternativwegen zugewiesen. Dieser aktive Alternativweg bzw. diese aktiven Alternativwege sind nicht fest, sondern werden entsprechend dem jeweiligen Verfahren zur dynamischen Leitweglenkung ausgewählt oder sogar bei jedem Call neu bestimmt. Die Vorteile der dynamischen Leitweglenkung liegen in Robustheit und Flexibilität gegenüber SchieflastSituationen im Netz, die z.B. durch zeitlich schwankende Lasten (räumlich begrenztes starkes Verkehrsaufkommen z.B. bei Katastrophen) und Netzdegra- dierung (Verbindungsleitungsbündelausfalle, Ausfälle von Ver- mittlungseinheiten) entstehen können. Außerdem können Unsicherheiten bei der Netzplanung besser kompensiert werden.In dynamic routing, any overflow traffic that occurs is assigned to one or more active alternative routes. This active alternative route or these active alternative routes are not fixed, but are selected in accordance with the respective method for dynamic routing or are even redetermined for each call. The advantages of dynamic routing lie in its robustness and flexibility compared to unbalanced load situations in the network, which e.g. due to fluctuating loads (spatially limited high volume of traffic, e.g. in the event of disasters) and network degradation (failure of trunk bundles, failures of switching units). In addition, uncertainties in network planning can be better compensated for.
Zentrale zustandsgesteuerte (dynamische) Routingverfahren stützen sich auf einen netzzentralen Prozessor, der von den Netzknoten Informationen über die vorliegende lokaleCentral state-controlled (dynamic) routing methods are based on a network-central processor, which provides information about the existing local network nodes
Lastsituation erhält. Günstige, unterbelastete Wege können so zentral bestimmt und an die Netzknoten entsprechend benachrichtigt werden. Nachteilig ist dabei unter anderem der große Aufwand für Netzzentrale, Datenübertragung und zusätzlich benötigte Rechenkapazität in den Netzknoten.Receives load situation. In this way, cheap, underloaded routes can be determined centrally and notified to the network nodes accordingly. Disadvantages include the great effort for the network center, data transmission and additional computing capacity required in the network nodes.
Dezentrale, zustandsgesteuerte (dynamische) Verfahren (s. z.B. EP 0 449 480 A3, EP 0 376 556 A3) basieren auf der Rückmeldung von Belastungszuständen der trunk-groups zum Ursprungsknoten des nicht hierarchischen (Teil-) Netzes . DieseDecentralized, state-controlled (dynamic) methods (see e.g. EP 0 449 480 A3, EP 0 376 556 A3) are based on the feedback of load states of the trunk groups to the origin node of the non-hierarchical (sub) network. This
Verfahren haben den Nachteil, daß die nicht standardisierte Schnittstelle zwischen den Netzknoten ein homogenes Netz (z.B. Netzknoten nur eines Herstellers) erfordert und außerdem ein hoher Signalisierungsaufwand erforderlich ist.Methods have the disadvantage that the non-standardized interface between the network nodes requires a homogeneous network (e.g. network nodes from only one manufacturer) and that a high signaling effort is also required.
Dezentrale ereignisgesteuerte (dynamische) Routingverfahren (s. z.B. EP 0 229 494 Bi) können eine Performancsteigerung erzielen, indem sie die jeweilige Lastsituation durch Auswertung der Gassenbesetzt-Ereignisse erlernen. Diese Verfahren nutzen die Gassenbesetzt-Information (blocking event Information) , um den blockierten Weg durch einen anderen Weg zu ersetzen. Dabei wird jedoch nicht zwischen sporadischen Blockierungen (hervorgerufen durch statistische Schwankungen des angebotenen Verkehrs) und fast vollständiger Blockierung (hervorgerufen durch Schieflast oder partielle Netzüberlast) unterschieden.Decentralized event-controlled (dynamic) routing methods (see EP 0 229 494 Bi, for example) can increase performance achieve by learning the respective load situation by evaluating the busy events. These methods use the blocking event information to replace the blocked path with another path. However, no distinction is made between sporadic blockages (caused by statistical fluctuations in the offered traffic) and almost complete blockages (caused by unbalanced loads or partial network overload).
Aus der europäischen Anmeldung EP 0 696 147 AI (SAG-intern 94P1542E) ist ein dezentrales ereigniεgesteuertes Verfahren nach dem Oberbegriff des Anspruchs 1 bekannt.A decentralized event-controlled method according to the preamble of claim 1 is known from European application EP 0 696 147 AI (internal to SAG 94P1542E).
Bei einer HochlastSituation kann es nun vorkommen, daß der Wegefächer sehr schnell kleiner wird und es so sehr schnell zu einer Reinitialisierung kommt. Da der Wegfächer in diesem Fall erneut mit vorher entfernten Alternativwegen wieder aufgefüllt wird, kann es vorkommen, daß erst relativ kurz vorher entfernte Alternativwege erneut in den Wegefächer aufgenommen werden. Da sich die Belastung dieser Alternativwege innerhalb der kurzen Zeit mit hoher Wahrscheinlichkeit kaum geändert hat, wird sich der Wegefächer erneut schnell verkleinern und es wird bald zu einer erneuten Reinit kommen. Der erläuterte Prozess reduziert die Performance des Verfahren insbesonder bei Hochlast sehr.In a high-load situation, it can happen that the path fan becomes smaller very quickly and reinitialization occurs very quickly. Since in this case the path fan is again refilled with previously removed alternative paths, it can happen that alternative paths that were removed relatively shortly before are again included in the path fan. Since the load on these alternative routes has hardly changed within the short time, the route fan will shrink again quickly and there will soon be a new reinit. The explained process greatly reduces the performance of the process, particularly under high load.
Der Erfindung liegt die Aufgabe zugrunde, den genannten Nachteil zu vermeiden.The invention has for its object to avoid the disadvantage mentioned.
Diese Aufgabe wird durch die Merkmale des Anspruchs 1 gelöst.This object is solved by the features of claim 1.
Durch die Erfindung wird verhindert, daß hochbelastete Alternativwege zu früh nach ihrem Ausscheiden aus demThe invention prevents that highly loaded alternative routes too soon after leaving the
Wegefächer bereits wieder für den Überlaufverkehr angeboten werden und damit wieder Verkehr erhalten, obwohl bei bereits längerfristig entfernten Alternativwegen wieder genügend Kapazität zur Verfügung stehen würde.Way compartments are already offered again for overflow traffic and thus receive traffic again, although at already sufficient alternative capacity would be available again in the longer term.
Im folgenden wird ein Ausführungsbeispiel des erfindungsgemä- ßen Verfahrens anhand der Figur näher erläutert .An exemplary embodiment of the method according to the invention is explained in more detail below with reference to the figure.
Die Figur zeigt ein Diagramm eines kleinen vollvermaschten Netzwerks mit sechs Netz-Vermittlungsknoten und den entsprechenden Kapazitäten der Wegabschnitte (Links) zwischen den Netzknoten, wobei ein Link mindestens ein Verbindungsleitungsbündel umfaßt .The figure shows a diagram of a small, fully meshed network with six network switching nodes and the corresponding capacities of the path sections (links) between the network nodes, a link comprising at least one trunk group.
Es werde nun angenommen, daß der Vermittlungsknoten 1 einen Call für Vermittlungsknoten 2 hat, aber die direkte Route zwischen den beiden Vermittlungsknoten nicht verfügbar ist.It is now assumed that switching node 1 has a call for switching node 2, but the direct route between the two switching nodes is not available.
Weiter werde angenommen, daß der Wegefächer, d.h. der Fächer der aktiven Alternativwege, nach seiner letztmaligen Reinitialisierung, drei Alternativwege umfaßt, nämlich die Zweilink-Alternativwege über die Vermittlungsknoten 3, 4 undIt is further assumed that the path fan, i.e. the subjects of the active alternative routes, after its last reinitialization, comprise three alternative routes, namely the two-link alternative routes via the switching nodes 3, 4 and
5.5th
Es werde weiterhin davon ausgegangen, daß der überlaufende Verkehr vom Routing-System zyklisch auf diese aktiven Alter- nativwege gleichmäßig verteilt wird und zwar in der Reihenfolge Transitknoten 3, 4 und 5.It was further assumed that the routing system would cyclically distribute the overflowing traffic over these active alternative routes in the order of transit nodes 3, 4 and 5.
Unter den genannten Voraussetzungen überprüft das Routing- System am Vermittlungsknoten 1 zunächst, ob der erste Link des aktiven Alternativwegs über Transitknoten 3 verfügbar ist, d.h. ob der Link zwischen Vermittlungsknoten 1 und 3 belegbare freie Leitungen bzw. Kanäle aufweist (im folgenden wird nur von "Kanälen" gesprochen) .Under the above conditions, the routing system at switching node 1 first checks whether the first link of the active alternative route is available via transit node 3, i.e. whether the link between switching nodes 1 and 3 has assignable free lines or channels (hereinafter referred to as "channels").
Um dies überprüfen zu können, speichert das Routing-System in Vermittlungsknoten 1 die maximale Kapazität des Links zwischen Vermittlungsknoten 1 und 3, nämlich z.B. 125 Kanäle und den für diesen Link zugehörigen Trunk-Reservation- Parameter, der hier beispielsweise 10 sei. Das Routing-System speichert darüber hinaus die Anzahl der momentan benutzten Kanäle. Der Link zwischen Vermittlungsknoten 1 und 3 ist somit aus der Sicht des Routing-System dann für Überlaufverkehr verfügbar, wenn die Summe der benutzten Kanäle und des Trunk-Reservation-Parameters kleiner als 125 is (die Trunkreservierung garantiert die Stabilität eines Routing-Verfahrens im Hochlastbereich) .To be able to check this, the routing system stores in switching node 1 the maximum capacity of the link between switching nodes 1 and 3, namely, for example, 125 channels and the trunk reservation parameter associated with this link, which is 10 here, for example. The routing system also stores the number of channels currently in use. From the point of view of the routing system, the link between switching nodes 1 and 3 is therefore available for overflow traffic if the sum of the channels used and the trunk reservation parameter is less than 125 (the trunk reservation guarantees the stability of a routing method in the high-load range ).
Ist der erste Link verfügbar, so baut der Vermittlungsknoten 1 die Verbindung zunächst bis zum Vermittlungsknoten 3 auf . Das Routing-System des Vermittlungsknotens 3 prüft dann vor der Weiterführung des Verbindungsaufbaus zum Ziel-Vermitt- lungsknoten 2 die Verfügbarkeit des zweiten Links, indem es überprüft, ob die Summe von belegte Kanäle plus Trunk-Reser- vation-Parameter kleiner als die Kapazität des zweiten Links ist (Das Routing-System des Vermittlungsknotenε 3 kennt hierzu die maximale Kapazität des Links zwischen Vermittlungsknoten 3 und 2, den Trunk-Reservation Parameter dieses Links und die Anzahl der momentan belegten Kanäle dieses Links) .If the first link is available, the switching node 1 initially establishes the connection up to the switching node 3. The routing system of the switching node 3 then checks the availability of the second link before continuing to set up the connection to the destination switching node 2 by checking whether the sum of occupied channels plus the trunk reservation parameter is less than the capacity of the second link is (the routing system of switching node 3 knows the maximum capacity of the link between switching nodes 3 and 2, the trunk reservation parameter of this link and the number of channels currently occupied by this link).
Falls auch der zweite Link des genannten aktiven Alternativweges verfügbar ist, wird die Verbindung vom Transitknoten 3 zum Zielknoten 2 aufgebaut.If the second link of the active alternative route mentioned is also available, the connection from the transit node 3 to the destination node 2 is established.
Im dem genannten Fall der erfolgreichen Vermittlung des Calls über Transitknoten 3 wird beim nächsten Call für den Vermittlungsknoten 2 bei NichtVerfügbarkeit der direkten Route nochmals versucht, den überlaufenden Call über den Transitknoten 3 zu lenken. Die Zahl der dem Alternativweg unmittelbar aufeinander folgenden erfolgreich angebotenen Calls wird gezählt. Erst bei Erreichen einer vorgegebbaren Maximalzahl von erfolgreich angebotenen Calls wird zyklisch gewechselt, d.h. der nächsfolgende überlaufende Call wird dann über den nächsten aktiven Alternativweg gelenkt, d.h. den aktiven Alternativweg über Transitknoten 4. Dadurch können kurzzeitige Autokorrelationen im Verkehrsangebot auf dem zweiten Link genutzt werden, die die Wahrscheinlichkeit erhöhen, daß unmittelbar nach einem erfolgreichen Verbindungsaufbau eine weitere Verbindung auf dem gleichen Weg aufgebaut werden kann.In the case of the successful transfer of the call via transit node 3, the next call for the switching node 2, if the direct route is not available, an attempt is made to route the overflowing call via the transit node 3. The number of successful calls immediately following the alternative route is counted. Only when a predetermined maximum number of successfully offered calls is reached is there a cyclical change, ie the next overflowing call is then routed via the next active alternative route, ie the active alternative route via transit node 4. As a result Short-term autocorrelations in the traffic offer on the second link can be used, which increase the probability that another connection can be established in the same way immediately after a successful connection establishment.
Wird vor oder bei Erreichen der genannten Maximalzahl die Nichtverfügbarkeit eines Alternativwegs festgestellt (Transitknoten 3 stellt z.B. fest, daß der Link zum Ziel- knoten 2 nicht verfügbar ist und löst den Ver- bindungsabschnitt zum Ursprungsknoten 1 mit einer speziell gekennzeichneten Rückwärtsmeldung (crankback-Meldung) aus) , so wird der Alternativweg aus dem Wegefächer entfernt, wobei die zeitliche Reihenfolge, nach der der Alternativweg aus dem Wegewefächer entfernt wird, registriert wird.If the unavailability of an alternative route is determined before or when the maximum number mentioned is reached (transit node 3 determines, for example, that the link to destination node 2 is not available and releases the connection section to originating node 1 with a specially marked reverse message (crankback message) off), the alternative route is removed from the route fan, the chronological order in which the alternative route is removed from the route fan is registered.
Der entfernte Alternativweg wird in eine erste Menge (sogenannte erste Passiv-Menge) von Alternativwegen aufgenommen, wenn die Zahl der dem Alternativweg erfolgreich angebotenen Calls unter einem bestimmten Wert liegt und in eine zweite (Passiv- ) Menge von Alternativwegen aufgenommen, wenn die Zahl den bestimmten Wert erreicht oder übersteigt . Die zeitliche Reihenfolge, nach der die Alternativwege aus dem Wegefächer entfernt werden, wird registriert, und der Wegefächer wird bei einer Reinitialisierung mit denjenigen Alternativwegen wieder aufgefüllt, die gemäß der zeitlichen Reihenfolge bereits am längsten aus dem Wegefächer entfernt sind.The removed alternative route is included in a first set (so-called first passive set) of alternative routes if the number of calls successfully offered to the alternative route is below a certain value and in a second (passive) set of alternative routes if the number is reached or exceeded a certain value. The time sequence in which the alternative routes are removed from the route fan is registered, and the route fan is replenished during reinitialization with those alternative routes that have been longest removed from the route fan according to the time sequence.
Der Wegefächer wird nach Eintreten eines bes immtewnThe path fan will be designated after the entry of a
Ereignisses (z.B. Kommando von Netzmanagement oder Ablauf einer Zeitperiode) und/oder einer bestimmten Bedingung (z.B. Unterschreiten einer vorgegebenen Zahl von Alternativwegen im Wegefächer) reinitialisiert. Die Reinitialisierung erfolgt, indem der Wegefächer mit denjenigen Alternativwegen wieder aufgefüllt wird, die gemäß der zeitlichen Reihenfolge bereits am längsten aus dem Wegefächer entfernt sind. Zunächst werden dabei nur Alternativweg aus der ersten Passiv-Menge berücksichtigt. Falls dies jedoch zum Auffüllen des Wegefächers nicht ausreicht, werden auch Alternativwege aus der zweiten Passiv-Menge berücksichtigt.Event (e.g. command from network management or expiry of a time period) and / or a certain condition (e.g. falling short of a predetermined number of alternative routes in the route fan). The reinitialization is carried out by refilling the route fan with those alternative routes which, according to the chronological order, have been the longest removed from the route fan. First of all only alternative route from the first set of liabilities is taken into account. However, if this is not sufficient to fill the route fan, alternative routes from the second set of liabilities are also taken into account.
Falls der Transitknoten 3 feststellt, daß der Link zum Ziel- knoten 2 (zweiter Link) nicht verfügbar ist, löst Transitknoten 3 den Verbindungsabschnitt zum Ursprungsknoten 1 mit einer speziell gekennzeichneten Rückwärtsmeldung (crankback-Meldung) aus.If the transit node 3 determines that the link to the destination node 2 (second link) is not available, the transit node 3 triggers the connection section to the originating node 1 with a specially marked reverse message (crankback message).
Das Routing-System des Ursprungsknotens 1 entfernt daraufhin den Alternativweg über Transitknoten 3 aus dem Wegefächer für Zielknoten 2. Der wegen der NichtVerfügbarkeit auf dem zweiten Link aus dem Wegefächer entfernte Alternativwege wird wiederum wie oben erläutert behandelt. The routing system of the originating node 1 then removes the alternative route via transit node 3 from the route fan for destination node 2. The alternative routes removed from the route fan because of the unavailability on the second link are again treated as explained above.

Claims

Patentansprüche claims
1. Verfahren zur dynamischen Verkehrslenkung in einem Kommunikationsnetz, demgemäß a) Calls zwischen einem Ursprungs-Vermittlungsknoten und einem Ziel -Vermittlungsknoten zunächst einem oder mehreren bevorzugten Wegen (Planwegen) angeboten werden, b) für den Fall, daß keiner der Planwege verfügbar ist, Calls Alternativwegen, die in einem Wegefächer enthalten sind, nach einem bestimmten Auswahlschema angeboten werden, c) ein bisher in dem Wegefächer enthaltener Alternativweg aus dem Wegefächer entfernt wird, sobald beim Anbieten eines Calls festgestellt wird, daß er nicht mehr verfügbar ist, d) der Wegefächer nach Eintreten eines bestimmten Ereignisses und/oder Erfüllen einer bestimmten Bedingung reinitialisiert wird, indem er mit früher entfernten Alternativwegen wieder aufgefüllt wird, dadurch gekennzeichnet, daß e) die zeitliche Reihenfolge, nach der die Alternativwege aus dem Wegewefächer entfernt werden, festgehalten1. Method for dynamic traffic control in a communication network, accordingly a) calls between an originating switching node and a destination switching node are initially offered one or more preferred routes (planned routes), b) in the event that none of the planned routes is available, calls Alternative routes, which are contained in a route fan, are offered according to a certain selection scheme, c) an alternative route previously contained in the route fan is removed from the route fan as soon as it is determined when a call is offered that it is no longer available, d) the route fans after the occurrence of a certain event and / or the fulfillment of a certain condition, is reinitialized by refilling it with alternative routes which were removed earlier, characterized in that e) the chronological order in which the alternative routes are removed from the route fan is recorded
(registriert) wird, f) der Wegefächer mit denjenigen Alternativwegen wieder aufgefüllt wird, die gemäß der zeitlichen Reihenfolge bereits am längsten aus dem Wegefächer entfernt sind.(registered), f) the route fan is replenished with those alternative routes which, according to the chronological order, have been the longest removed from the route fan.
2. Verfahren nach Anspruch 1, dadurch gekennzeichnet, daß a) einem aus dem Wegefächer für den Überlaufverkehr ausgewählten Alternativweg überlaufende Calls bis zu einer vorgegebenen Maximalzahl angeboten werden, bevor zu dem nach dem genannten Auswahlschema nächsten Alternativweg übergegangen wird, b) die Anzahl der dem Alternativweg bis zu einem etwaigen Feststellen der Nichtverfugbarkeit angebotenen Calls gezählt wird, c) bei Feststellen der Nichtverfugbarkeit des Alternativwegs dieser in eine erste Passiv-Menge von Alternativwegen aufgenommen wird, wenn die genannte Anzahl unter einem bestimmten Wert liegt und in eine zweite Passiv-Menge von Alternativwegen aufgenommen wird, wenn die genannte Anzahl den bestimmten Wert erreicht oder übersteigt, d) der Wegefächer reinitialisiert wird, indem dl) zunächst solche Alternativwege erneut in den Wegefächer aufgenommen werden, die aus der ersten Passiv-Menge kommen und zeitlich bereits am längsten aus dem Wegefächer entfernt sind, d2) falls diese zum Auffüllen des Wegefächers nicht ausreichen auch solche Alternativwege in den Wegefächer aufgenommen werden, die aus der zweiten Passiv-Menge kommen und zeitlich bereits am längsten aus dem Wegefächer entfernt sind. 2. The method according to claim 1, characterized in that a) one of an alternative route selected from the route fan for the overflow traffic overflowing calls are offered up to a predetermined maximum number before the next alternative route according to the said selection scheme is used, b) the number of calls offered to the alternative route until a possible determination of the non-availability is counted, c) if the alternative route is determined to be unavailable, it is included in a first passive set of alternative routes if the number mentioned is below a certain value and in a second passive set of alternative routes is included if the number mentioned reaches or exceeds the specific value, d) the route fan is reinitialized by dl) first including such alternative routes in the route compartments that come from the first passive set and are the longest in time from the route fan, d2) if these are not sufficient to fill up the route fan, such alternative routes are also included in the route compartments that come from the second set of passives and have been the longest away from the route fan.
EP97947027A 1996-11-22 1997-11-03 Method and system of dynamic trafic control in a communication network Withdrawn EP0941619A1 (en)

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
DE19648479 1996-11-22
DE19648479 1996-11-22
PCT/DE1997/002545 WO1998024247A1 (en) 1996-11-22 1997-11-03 Method and system of dynamic trafic control in a communication network

Publications (1)

Publication Number Publication Date
EP0941619A1 true EP0941619A1 (en) 1999-09-15

Family

ID=7812519

Family Applications (1)

Application Number Title Priority Date Filing Date
EP97947027A Withdrawn EP0941619A1 (en) 1996-11-22 1997-11-03 Method and system of dynamic trafic control in a communication network

Country Status (4)

Country Link
US (1) US6411701B1 (en)
EP (1) EP0941619A1 (en)
CN (1) CN1106771C (en)
WO (1) WO1998024247A1 (en)

Families Citing this family (62)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1021052A1 (en) * 1999-01-14 2000-07-19 Telefonaktiebolaget Lm Ericsson Method and arrangement for controlling alternate routing of traffic in a circuit-switched network
US6535923B1 (en) * 1999-03-30 2003-03-18 International Business Machines Corporation Method and system for defining an efficient and reliable meshing of CP-CP sessions in an advanced peer to peer network
US6989471B2 (en) * 2000-02-15 2006-01-24 The Procter & Gamble Company Absorbent article with phase change material
CN100479573C (en) * 2000-10-10 2009-04-15 英特尔公司 Communications meshes
US7006509B1 (en) * 2000-12-22 2006-02-28 Cisco Technology, Inc. Method and system for graceful slowlink deletion and subsequent fast link addition in an IMA group
US6952434B1 (en) 2000-12-27 2005-10-04 Cisco Technology, Inc. System and method for processing control cells to prevent event missequencing and data loss in IMA groups
US7065104B1 (en) 2000-12-28 2006-06-20 Cisco Technology, Inc. Method and system for managing inverse multiplexing over ATM
WO2005041516A2 (en) * 2003-10-15 2005-05-06 Ntt Docomo, Inc. Apparatus and method for controlling an operation of a plurality of communication layers in a layered communication scenario
DE102004003548B3 (en) * 2004-01-23 2005-06-30 Siemens Ag Traffic loading optimization method for packet-based communications network with multi-path routing using adaption of distribution weightings of outgoing communications links dependent on traffic loadings
CN1330214C (en) * 2004-02-02 2007-08-01 华为技术有限公司 Interactive method for re-selecting operating network to wireless local network
US7141956B2 (en) * 2005-03-18 2006-11-28 Power-One, Inc. Digital output voltage regulation circuit having first control loop for high speed and second control loop for high accuracy
US9377768B2 (en) 2008-10-27 2016-06-28 Lennox Industries Inc. Memory recovery scheme and data structure in a heating, ventilation and air conditioning network
US8892797B2 (en) 2008-10-27 2014-11-18 Lennox Industries Inc. Communication protocol system and method for a distributed-architecture heating, ventilation and air conditioning network
US8437878B2 (en) 2008-10-27 2013-05-07 Lennox Industries Inc. Alarm and diagnostics system and method for a distributed architecture heating, ventilation and air conditioning network
US8548630B2 (en) 2008-10-27 2013-10-01 Lennox Industries, Inc. Alarm and diagnostics system and method for a distributed-architecture heating, ventilation and air conditioning network
US8762666B2 (en) 2008-10-27 2014-06-24 Lennox Industries, Inc. Backup and restoration of operation control data in a heating, ventilation and air conditioning network
US9152155B2 (en) 2008-10-27 2015-10-06 Lennox Industries Inc. Device abstraction system and method for a distributed-architecture heating, ventilation and air conditioning system
US8994539B2 (en) 2008-10-27 2015-03-31 Lennox Industries, Inc. Alarm and diagnostics system and method for a distributed-architecture heating, ventilation and air conditioning network
US8463442B2 (en) 2008-10-27 2013-06-11 Lennox Industries, Inc. Alarm and diagnostics system and method for a distributed architecture heating, ventilation and air conditioning network
US8452906B2 (en) 2008-10-27 2013-05-28 Lennox Industries, Inc. Communication protocol system and method for a distributed-architecture heating, ventilation and air conditioning network
US8744629B2 (en) 2008-10-27 2014-06-03 Lennox Industries Inc. System and method of use for a user interface dashboard of a heating, ventilation and air conditioning network
US8802981B2 (en) 2008-10-27 2014-08-12 Lennox Industries Inc. Flush wall mount thermostat and in-set mounting plate for a heating, ventilation and air conditioning system
US9268345B2 (en) 2008-10-27 2016-02-23 Lennox Industries Inc. System and method of use for a user interface dashboard of a heating, ventilation and air conditioning network
US8615326B2 (en) 2008-10-27 2013-12-24 Lennox Industries Inc. System and method of use for a user interface dashboard of a heating, ventilation and air conditioning network
US9325517B2 (en) 2008-10-27 2016-04-26 Lennox Industries Inc. Device abstraction system and method for a distributed-architecture heating, ventilation and air conditioning system
US8725298B2 (en) 2008-10-27 2014-05-13 Lennox Industries, Inc. Alarm and diagnostics system and method for a distributed architecture heating, ventilation and conditioning network
US8655491B2 (en) 2008-10-27 2014-02-18 Lennox Industries Inc. Alarm and diagnostics system and method for a distributed architecture heating, ventilation and air conditioning network
US8661165B2 (en) 2008-10-27 2014-02-25 Lennox Industries, Inc. Device abstraction system and method for a distributed architecture heating, ventilation and air conditioning system
US8798796B2 (en) 2008-10-27 2014-08-05 Lennox Industries Inc. General control techniques in a heating, ventilation and air conditioning network
US8774210B2 (en) 2008-10-27 2014-07-08 Lennox Industries, Inc. Communication protocol system and method for a distributed-architecture heating, ventilation and air conditioning network
US8977794B2 (en) 2008-10-27 2015-03-10 Lennox Industries, Inc. Communication protocol system and method for a distributed-architecture heating, ventilation and air conditioning network
US8463443B2 (en) 2008-10-27 2013-06-11 Lennox Industries, Inc. Memory recovery scheme and data structure in a heating, ventilation and air conditioning network
US9632490B2 (en) 2008-10-27 2017-04-25 Lennox Industries Inc. System and method for zoning a distributed architecture heating, ventilation and air conditioning network
US8788100B2 (en) 2008-10-27 2014-07-22 Lennox Industries Inc. System and method for zoning a distributed-architecture heating, ventilation and air conditioning network
US8295981B2 (en) 2008-10-27 2012-10-23 Lennox Industries Inc. Device commissioning in a heating, ventilation and air conditioning network
US8433446B2 (en) 2008-10-27 2013-04-30 Lennox Industries, Inc. Alarm and diagnostics system and method for a distributed-architecture heating, ventilation and air conditioning network
US9678486B2 (en) 2008-10-27 2017-06-13 Lennox Industries Inc. Device abstraction system and method for a distributed-architecture heating, ventilation and air conditioning system
US8560125B2 (en) 2008-10-27 2013-10-15 Lennox Industries Communication protocol system and method for a distributed-architecture heating, ventilation and air conditioning network
US8600558B2 (en) 2008-10-27 2013-12-03 Lennox Industries Inc. System recovery in a heating, ventilation and air conditioning network
US8855825B2 (en) 2008-10-27 2014-10-07 Lennox Industries Inc. Device abstraction system and method for a distributed-architecture heating, ventilation and air conditioning system
US8352081B2 (en) 2008-10-27 2013-01-08 Lennox Industries Inc. Communication protocol system and method for a distributed-architecture heating, ventilation and air conditioning network
US8694164B2 (en) 2008-10-27 2014-04-08 Lennox Industries, Inc. Interactive user guidance interface for a heating, ventilation and air conditioning system
US8437877B2 (en) 2008-10-27 2013-05-07 Lennox Industries Inc. System recovery in a heating, ventilation and air conditioning network
US8564400B2 (en) 2008-10-27 2013-10-22 Lennox Industries, Inc. Communication protocol system and method for a distributed-architecture heating, ventilation and air conditioning network
US9261888B2 (en) 2008-10-27 2016-02-16 Lennox Industries Inc. System and method of use for a user interface dashboard of a heating, ventilation and air conditioning network
US8352080B2 (en) 2008-10-27 2013-01-08 Lennox Industries Inc. Communication protocol system and method for a distributed-architecture heating, ventilation and air conditioning network
US9432208B2 (en) 2008-10-27 2016-08-30 Lennox Industries Inc. Device abstraction system and method for a distributed architecture heating, ventilation and air conditioning system
US8452456B2 (en) 2008-10-27 2013-05-28 Lennox Industries Inc. System and method of use for a user interface dashboard of a heating, ventilation and air conditioning network
US8874815B2 (en) 2008-10-27 2014-10-28 Lennox Industries, Inc. Communication protocol system and method for a distributed architecture heating, ventilation and air conditioning network
US8655490B2 (en) 2008-10-27 2014-02-18 Lennox Industries, Inc. System and method of use for a user interface dashboard of a heating, ventilation and air conditioning network
US8600559B2 (en) 2008-10-27 2013-12-03 Lennox Industries Inc. Method of controlling equipment in a heating, ventilation and air conditioning network
US8255086B2 (en) 2008-10-27 2012-08-28 Lennox Industries Inc. System recovery in a heating, ventilation and air conditioning network
US9651925B2 (en) 2008-10-27 2017-05-16 Lennox Industries Inc. System and method for zoning a distributed-architecture heating, ventilation and air conditioning network
US8543243B2 (en) 2008-10-27 2013-09-24 Lennox Industries, Inc. System and method of use for a user interface dashboard of a heating, ventilation and air conditioning network
US8239066B2 (en) 2008-10-27 2012-08-07 Lennox Industries Inc. System and method of use for a user interface dashboard of a heating, ventilation and air conditioning network
US8442693B2 (en) 2008-10-27 2013-05-14 Lennox Industries, Inc. System and method of use for a user interface dashboard of a heating, ventilation and air conditioning network
USD648641S1 (en) 2009-10-21 2011-11-15 Lennox Industries Inc. Thin cover plate for an electronic system controller
USD648642S1 (en) 2009-10-21 2011-11-15 Lennox Industries Inc. Thin cover plate for an electronic system controller
US8260444B2 (en) 2010-02-17 2012-09-04 Lennox Industries Inc. Auxiliary controller of a HVAC system
CN102572907A (en) * 2012-01-21 2012-07-11 重庆大学 Wireless communication mode of industrial information corridor
US9584518B1 (en) * 2015-09-09 2017-02-28 Callware Technologies, Inc. Dynamic communications controller
CN110278175B (en) 2018-03-14 2020-06-02 阿里巴巴集团控股有限公司 Graph structure model training and garbage account identification method, device and equipment

Family Cites Families (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4669113A (en) 1985-04-26 1987-05-26 At&T Company Integrated network controller for a dynamic nonhierarchical routing switching network
GB8531138D0 (en) 1985-12-18 1986-01-29 British Telecomm Telecommunications network
US5101451A (en) 1988-12-29 1992-03-31 At&T Bell Laboratories Real-time network routing
CA2001665C (en) 1988-12-29 1993-10-12 Gerald Richard Ash Real-time network routing
US5142570A (en) 1990-06-15 1992-08-25 Bell Communications Research, Inc. Routing of network traffic using discrete traffic measurement data
ES2098544T3 (en) 1991-10-15 1997-05-01 Siemens Ag PROCEDURE FOR THE NON-HIERARCHICAL DIRECTION OF TRAFFIC IN A COMMUNICATION NETWORK.
EP0696147A1 (en) 1994-08-03 1996-02-07 Siemens Aktiengesellschaft Procedure and routing system for dynamic traffic management in a communications network

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See references of WO9824247A1 *

Also Published As

Publication number Publication date
CN1238891A (en) 1999-12-15
CN1106771C (en) 2003-04-23
US6411701B1 (en) 2002-06-25
WO1998024247A1 (en) 1998-06-04

Similar Documents

Publication Publication Date Title
EP0940048B1 (en) Method and system of dynamic traffic control in a communication network
WO1998024247A1 (en) Method and system of dynamic trafic control in a communication network
EP0696147A1 (en) Procedure and routing system for dynamic traffic management in a communications network
DE69524119T2 (en) DYNAMICALLY CONTROLLED GUIDANCE USING VIRTUAL TARGET NODES
EP0608279B1 (en) Method for the non-hierarchical routing of traffic in a communications net
DE3880501T2 (en) NETWORK TRAFFIC GUIDE CONTROL.
DE68915281T2 (en) NETWORK TRAFFIC GUIDE CONTROL.
DE3785524T2 (en) Adaptive toll traffic routing and automatic network management system for multi-service telecommunications networks.
DE69736466T2 (en) DYNAMIC ALLOCATION OF TELECOMMUNICATIONS RESOURCES
DE69534729T2 (en) Request for a virtual connection dependent on concurrent request information
DE69412274T2 (en) METHOD FOR SELECTING CONNECTIONS IN NETWORKS
DE4445800C1 (en) Method for forming routing information intended for the subsequent switching of traffic relationships in a communication network
DE19523290A1 (en) Method and device for addaptive route selection in communication networks
DE69636242T2 (en) METHOD AND DEVICE FOR MULTI-CELL TRANSMISSION
AT401702B (en) METHOD AND ARRANGEMENT FOR ROUTING CONNECTIONS IN A MEDIATING COMMUNICATION NETWORK
DE3023205C2 (en)
DE4428349C2 (en) Method and routing system for traffic control in a communication network
EP0463215B1 (en) Communication network for establishing a redundant link
DE69425253T2 (en) METHOD FOR CONTROLLING A TELECOMMUNICATION NETWORK
EP0016397B1 (en) Indirectly controlled switching system, in particular telephone switching system
DE19747605C2 (en) Method and device for establishing at least one low-priority connection in a telecommunications network
DE2360391C3 (en) Telecommunication network with centralized, memory-oriented processor control
DE3730761C2 (en)
DE4422546A1 (en) Route list regulation method for switching data network
EP1051867B1 (en) Method for overload control for a switching center

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 19990520

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): DE FR

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE APPLICATION IS DEEMED TO BE WITHDRAWN

18D Application deemed to be withdrawn

Effective date: 20070601