[go: up one dir, main page]

WO1999009782A1 - Procede de multiplexage statistique de communications mta - Google Patents

Procede de multiplexage statistique de communications mta Download PDF

Info

Publication number
WO1999009782A1
WO1999009782A1 PCT/DE1998/002109 DE9802109W WO9909782A1 WO 1999009782 A1 WO1999009782 A1 WO 1999009782A1 DE 9802109 W DE9802109 W DE 9802109W WO 9909782 A1 WO9909782 A1 WO 9909782A1
Authority
WO
WIPO (PCT)
Prior art keywords
connection
bandwidth
class
pcr
connections
Prior art date
Application number
PCT/DE1998/002109
Other languages
German (de)
English (en)
Inventor
Dorothea Lampe
Raimar Thudt
Original Assignee
Siemens Aktiengesellschaft
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
Family has litigation
First worldwide family litigation filed litigation Critical https://patents.darts-ip.com/?family=7838901&utm_source=google_patent&utm_medium=platform_link&utm_campaign=public_patent_search&patent=WO1999009782(A1) "Global patent litigation dataset” by Darts-ip is licensed under a Creative Commons Attribution 4.0 International License.
Application filed by Siemens Aktiengesellschaft filed Critical Siemens Aktiengesellschaft
Priority to CA002300190A priority Critical patent/CA2300190A1/fr
Priority to EP98947344A priority patent/EP1004221A1/fr
Publication of WO1999009782A1 publication Critical patent/WO1999009782A1/fr

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q11/00—Selecting arrangements for multiplex systems
    • H04Q11/04—Selecting arrangements for multiplex systems for time-division multiplexing
    • H04Q11/0428—Integrated services digital network, i.e. systems for transmission of different types of digitised signals, e.g. speech, data, telecentral, television signals
    • H04Q11/0478—Provisions for broadband connections
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems 
    • H04L12/56—Packet switching systems
    • H04L12/5601—Transfer mode dependent, e.g. ATM
    • H04L2012/5629—Admission control
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems 
    • H04L12/56—Packet switching systems
    • H04L12/5601—Transfer mode dependent, e.g. ATM
    • H04L2012/5629—Admission control
    • H04L2012/5631—Resource management and allocation
    • H04L2012/5632—Bandwidth allocation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems 
    • H04L12/56—Packet switching systems
    • H04L12/5601—Transfer mode dependent, e.g. ATM
    • H04L2012/5672—Multiplexing, e.g. coding, scrambling

Definitions

  • the invention relates to a method according to the preamble of claim 1.
  • connection types are defined for connections via which information is transmitted according to an asynchronous transfer mode (ATM).
  • ATM asynchronous transfer mode
  • connections with strict requirements for cell delay times are differentiated from connections that do not have strict requirements for line delay times.
  • the former include, in particular, connections via which information is transmitted at a constant bit rate (constant bit rate, CBR), and connections via which real-time information is transmitted at a variable bit rate (rt-VBR).
  • CBR constant bit rate
  • rt-VBR variable bit rate
  • nrt-VBR non-real-time VBR connections
  • ABR available bitrate
  • UBR unspecified bitrate connections
  • connection bandwidth The information on all five connection types is routed in ATM cells together via virtual paths or virtual lines with a predetermined bit rate (bandwidth).
  • bandwidth As part of the establishment of new connections which have stringent requirements for the line delay times, it is necessary to calculate the bandwidth which is required for the entirety of all connections made via a connection section / connection line or a virtual path. To calculate this effective bandwidth, it is necessary to determine at what rate it is for that type of connection as well as the other connection types (nrt-VBR, ABR, UBR) provided large cell memory may be emptied.
  • the sending device when an ATM connection is set up, the sending device must inform a higher-level control device (call acceptance control) of predetermined parameters. This is necessary to ensure the quality of the connection for all participants (Quality of Service). For example, if too many cells are transmitted and the transmission capacity is exceeded, too many cells would have to be discarded. However, this should be avoided under all circumstances, as this always involves a loss of information. For this purpose, standardization bodies, for example, call for a cell loss probability of 10 "10 of a connection. For this reason, it is calculated when the connection is established whether this new connection to existing connections can be accepted. If the transmission capacity has already been exhausted, the requesting connection is rejected.
  • a number of transmission parameters are defined to describe these processes. This includes, for example, the peak cell rate (PCR) defined on a connection. This is an upper limit for the number of ATM cells that can be transmitted over this connection per second. Furthermore, the control device is informed by the sending device of a permanently permitted cell rate (SCR) in the case of a connection with a variable bit rate. This is the upper limit of an average cell rate at which the cells are transmitted during the connection. As a further parameter, the control device knows the maximum possible transmission capacity of the connecting line (Link Cell Rate, C) and the maximum possible load on the connecting line (p 0 ). The former is essentially a material constant of the connecting line, while the latter defines a size with which the maximum permissible total cell rate is specified on the connection line. This is usually 95% of the maximum possible transmission capacity of the connecting line. Based on these parameters, it is then decided whether new connection requests can be met or not.
  • SCR permanently permitted cell rate
  • an algorithm runs in the higher-level control device, by means of which the parameters received from the sending device are checked. Furthermore, these are compared with parameters that have already been calculated and relate to the instantaneous load on the connecting line. Based on these comparisons, a decision is then made as to whether the new connection request can be met and whether this connection can still be permitted.
  • the key parameters include use the already mentioned peak cell rate or the sustainable cell rate.
  • connection is also permitted if, taking into account additional properties of the n connections, as explained below, the following condition (b) is fulfilled.
  • the condition (b) shows that the pending connections are divided into two classes.
  • the sigma rule algorithm must therefore decide which of two classes, namely a class S and a class P, the ATM connection which is to be added is to be divided.
  • All other virtual connections are assigned to class P. This includes, in particular, the connections with constant bit rate. Furthermore, all the connections are assigned here for which the parameters SCR and PCR are very close to each other - or very far apart, or which already have a high peak cell rate PCR in relation to the total capacity of the connecting line. The criterion for this is a peak cell rate that is greater than 3% of the maximum possible transmission capacity of the connecting line.
  • an nth virtual connection VC n with a defined peak cell rate PCR n and a permanently permitted cell rate SCR n becomes (nl) already existing virtual connections VC ⁇ with the parameters SCRi and PCRi (l ⁇ i ⁇ nl ) permitted on a connecting line if conditions (a) or (b) are met.
  • condition (a) it is checked whether the sum of the peak cell rates of all n connections on the connecting line is less than or equal to the maximum possible transmission capacity on the connecting line. If this is the case, the nth virtual connection can be accepted and there is no need to query condition (b). If this is not the case, then condition (b) checks whether the upper estimate of the mean of the sum of the peak cell rates of all compounds of class S together with a cell rate which is calculated from the burstiness of all compounds of class S is smaller or is the cell rate currently available for Class S connections. If this is the case, the nth virtual connection is accepted, in the other case it is rejected.
  • the first class S is now subdivided into further sub-classes S x , S 2 or S 3 in order to achieve an even finer classification. If a new connection request is received, the sigma rule algorithm must therefore check which of the subclasses this new connection is to be assigned to, in accordance with specified query criteria. The cheapest sub-class S x is then automatically selected.
  • a subclass S x is defined via a lower limit or upper limit of the peak cell rate PCR and the ratio of the transmission parameters SCR / PCR.
  • Formula (b) is thus modified by the sub-classes S k , P mentioned
  • connection acceptance algorithm is therefore able to decide whether a given bandwidth, for example the bandwidth of a virtual path or a line, is sufficient for a group of connections as a whole. Since such acceptance algorithms provide a yes / no decision as to whether a connection is to be accepted or not, they are not suitable directly for calculating the effective bandwidth for a group of connections.
  • the invention has for its object to show a way how to design an acceptance algorithm in such a way that a bandwidth representative of all connections can be calculated in an efficient manner.
  • the invention is achieved on the basis of the features specified in the preamble of claim 1 by the features of the characterizing part.
  • the sigma rule algorithm is used as the acceptance algorithm. Starting from an initial value, the bandwidth is determined step by step with the connection setup / disconnection. The sigma rule algorithm is started at every step and, in addition to a yes / no decision, provides an estimate of the bandwidth by first adding or subtracting a conservative traffic parameter value to a class-specific bandwidth based on acceptance criteria. The conservative traffic parameter value is different in the case of connection establishment than in the case of connection disconnection. If the sigma rule algorithm determines that the conservative bandwidth estimate would be sufficient, a more aggressive traffic parameter value is added or subtracted from the class-specific bandwidth. Here, too, the more aggressive traffic parameter value is different in the case of connection establishment than in the case of connection disconnection.
  • Fig. 1 drive a flow chart according to the invention.
  • Fig. 2 is a flowchart according to the invention. 1 shows a flow chart of the method according to the invention.
  • the sigma rule algorithm SR described at the outset as prior art is used as the acceptance algorithm. Accordingly, additional state variables are introduced in addition to the state variables guided in the Sigma Rule Algorithm SR. These are the state variables c S ⁇ , c Pk and c * 1 :
  • the state variable c S ⁇ is the effective bandwidth of the virtual connections which, according to the sigma rule algorithm SR, are to be assigned to one of the classes S k .
  • the state variable c p "specifies the sum of the peak cell rates PCR of all virtual connections in class P, while the state variable c ⁇ * is defined as the effective bandwidth of all connections in relation to the classes k.
  • the new connection VC n can be accepted or not
  • connection VC n can be assigned to one of the classes S k or P k .
  • S k the classes S k or P k .
  • P k the classes
  • condition (2) may result in a bandwidth that is greater than the sum of the peak cell rates PCR n of all compounds. Since the sum of all added effective bandwidths can never be greater than the sum of their peak cell rates PCR n , condition (2) is modified in such a way that
  • condition (3) If condition (3) is not met, the effective bandwidth used up to that point plus the peak cell rate PCR n permitted for the nth connection VC n is taken as the new effective bandwidth c ⁇ .
  • connection VC n cannot be assigned to one of the classes S k , it is automatically assumed that it is to be assigned to one of the classes P k . This results in:
  • connection is to be cleared down. It is assumed here that with n existing connections VC ⁇ a connection VC n is cleared down with the parameters PCR t , SCR.
  • connection VC n When the connection is triggered, it is first checked whether this connection VC n in question was assigned to one of the classes S. In this case, a query criterion is applied to all remaining virtual connections VCi (excluding connection VC n ) according to condition (7): ⁇ SCR, -r- qCc ⁇ - PCR n , S k ). ⁇ SCR,. (PCR, - SCR,) ⁇ c Sk - PCR n
  • condition (7) Strict application of condition (7) now results in a bandwidth for the remaining (n-1) connections that is greater than the sum of the peak cell rates of the connections. Therefore condition (7) should be modified in such a way that
  • the effective bandwidth used up to that point minus the peak cell rate PCR n permitted for the nth connection VC n is taken as the new effective bandwidth c s ".
  • the effective bandwidth used up to that point minus the cell rate SCR n permanently permitted for the nth connection VC n is taken as the new effective bandwidth c S ⁇ .

Landscapes

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

Abstract

Lors de communications MTA, une pluralité de communications sont transmises par l'intermédiaire de sections de liaison communes. De nouvelles communications entrantes sont admises en fonction de décisions prises par des algorithmes d'acceptation. Toutefois seules des décisions oui/non sont prises. Il est cependant souvent nécessaire que la largeur de bande nécessaire pour l'ensemble de toutes les communications conduites par lesdites sections de liaison soit connue. Ce problème est résolu selon l'invention par le fait que la largeur de bande est évaluée pas à pas en même temps que l'établissement/la coupure de communications, par modification de l'algorithme de règle sigma.
PCT/DE1998/002109 1997-08-13 1998-07-27 Procede de multiplexage statistique de communications mta WO1999009782A1 (fr)

Priority Applications (2)

Application Number Priority Date Filing Date Title
CA002300190A CA2300190A1 (fr) 1997-08-13 1998-07-27 Procede de multiplexage statistique de communications mta
EP98947344A EP1004221A1 (fr) 1997-08-13 1998-07-27 Procede de multiplexage statistique de communications mta

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
DE19735166.2 1997-08-13
DE19735166 1997-08-13

Publications (1)

Publication Number Publication Date
WO1999009782A1 true WO1999009782A1 (fr) 1999-02-25

Family

ID=7838901

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/DE1998/002109 WO1999009782A1 (fr) 1997-08-13 1998-07-27 Procede de multiplexage statistique de communications mta

Country Status (3)

Country Link
EP (1) EP1004221A1 (fr)
CA (1) CA2300190A1 (fr)
WO (1) WO1999009782A1 (fr)

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0673138A2 (fr) * 1994-03-17 1995-09-20 Fujitsu Limited Méthode de gestion d'admission de connections pour un réseau ATM
WO1997001895A2 (fr) * 1995-06-27 1997-01-16 Newbridge Networks Corporation Dispositif de controle d'admission des connexions (cac) pour reseaux atm

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0673138A2 (fr) * 1994-03-17 1995-09-20 Fujitsu Limited Méthode de gestion d'admission de connections pour un réseau ATM
WO1997001895A2 (fr) * 1995-06-27 1997-01-16 Newbridge Networks Corporation Dispositif de controle d'admission des connexions (cac) pour reseaux atm

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
CHENG L: "QUALITY OF SERVICES BASED ON BOTH CALL ADMISSION AND CELL SCHEDULING", COMPUTER NETWORKS AND ISDN SYSTEMS, vol. 29, no. 5, April 1997 (1997-04-01), pages 555 - 567, XP000686166 *

Also Published As

Publication number Publication date
CA2300190A1 (fr) 1999-02-25
EP1004221A1 (fr) 2000-05-31

Similar Documents

Publication Publication Date Title
DE69114789T2 (de) Steuerungsverfahren für Datenübertragung in einem ATM-Netz mit Zellenverlust gemäss Prioritätsstufen.
DE69126462T2 (de) ATM-Kommunikationssystem
DE69728630T2 (de) Verfahren und System zur Steigerung der Dienstleitungsqualität bei oder unter einem Grenz-Tarif
DE60203708T2 (de) Resourcen Zutrittskontrolle in einem Zugangsnetz
DE69525616T2 (de) Leaky-bucket-vorrichtung zweiter ordnung und verfahren zum verkehrsmanagement in zellenrelais-netzwerken
DE69629890T2 (de) ATM-Vermittlungssystem und Prioritätensteuerungsverfahren
DE69926599T2 (de) Verfahren und Vorrichtung zur Reglementierung des Datenverkehrs
EP0579980B1 (fr) Système de communication à ATM
EP1700434B1 (fr) Procede pour determiner des valeurs limites pour un controle du trafic dans des reseaux de communication a controle d'acces
DE69428425T2 (de) Verfahren zur Formung eines Zellenstromes, der Benutzer- und OAM-Zellen enthält
WO1999009782A1 (fr) Procede de multiplexage statistique de communications mta
DE69617512T2 (de) ATM Überwachungsanlage
EP0941630B1 (fr) Procede de multiplexage statistique de communications atm
DE102004045740B4 (de) Selbstadaptierendes Bandbreitenmanagement
DE69718747T2 (de) Lokales Netz mit Zugang zu mobilen Teilnehmern und Verfahren zur Leitweglenkung in solch einem Netz
WO1999009781A1 (fr) Procede de multiplexage statistique de communications mta
DE69704905T2 (de) Lokales Netz mit Zugang für mobile Teilnehmer, welches mit Mitteln zur Verwaltung der Systemressourcen ausgestattet ist
DE19730621A1 (de) Verfahren zum Übertragen von Daten auf einer ISDN-Anschlußleitung, sowie Leitungsabschlußeinheit, Vermittlungsstelle, Netzabschlußeinheit und Datenendgerät dafür
EP1060634B1 (fr) Procede pour determiner le debit binaire necessaire a un certain nombre de liaisons de transmission a multiplexage statistique
DE19907923C2 (de) Verfahren zum Ermitteln eines Verbindungsweges in einem Kommunikationsnetz zwischen zwei benachbarten Netzknoten
DE19730760C2 (de) Verfahren zum Optimieren der Auslastung auf Verbindungsabschnitten bei ABR Verkehr
EP0940952B1 (fr) Méthode et appareil pour établir une liaison de communication
EP1027816A2 (fr) Procede et dispositif permettant d'etablir au moins une liaison a faible priorite dans un reseau de telecommunications
DE10129837B4 (de) ATM-Switch und Verfahren zum Steuern seiner Traffic-Shaper
DE19723091C2 (de) Verfahren und Datenverarbeitungsanlage zum Vermitteln in einem Telekommunikationssystem

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A1

Designated state(s): CA US

AL Designated countries for regional patents

Kind code of ref document: A1

Designated state(s): AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE

DFPE Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101)
121 Ep: the epo has been informed by wipo that ep was designated in this application
WWE Wipo information: entry into national phase

Ref document number: 1998947344

Country of ref document: EP

WWE Wipo information: entry into national phase

Ref document number: 09485525

Country of ref document: US

ENP Entry into the national phase

Ref document number: 2300190

Country of ref document: CA

Ref country code: CA

Ref document number: 2300190

Kind code of ref document: A

Format of ref document f/p: F

WWP Wipo information: published in national office

Ref document number: 1998947344

Country of ref document: EP

WWW Wipo information: withdrawn in national office

Ref document number: 1998947344

Country of ref document: EP